Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · quant-ph/0501126

Primitive Quantum BCH Codes over Finite Fields

Salah Aly·Andreas Klappenecker·Pradeep Kiran Sarvepalli
View original source ↗Read source document ↗Export metadata ↓

Abstract

An attractive feature of BCH codes is that one can infer valuable information from their design parameters (length, size of the finite field, and designed distance), such as bounds on the minimum distance and dimension of the code. In this paper, it is shown that one can also deduce from the design parameters whether or not a primitive, narrow-sense BCH contains its Euclidean or Hermitian dual code. This information is invaluable in the construction of quantum BCH codes. A new proof is provided for the dimension of BCH codes with small designed distance, and simple bounds on the minimum distance of such codes and their duals are derived as a consequence. These results allow us to derive the parameters of two families of primitive quantum BCH codes as a function of their design parameters.

Explore related subjects

quant-phcs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Salah Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli. 2006-01-18. Primitive Quantum BCH Codes over Finite Fields. https://arxiv.org/abs/quant-ph/0501126

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Lie-Algebraic Bounds on Quantum Control Time via the Baker-Campbell-Hausdorff Formula

The time required to implement a desired unitary operation is a central issue in quantum control, especially for many-body systems with limited control access. While controllability theory determines whether a target unitary is reachable in principle, it does not directly quantify the implementation time. Here we derive a Baker-Campbell-Hausdorff (BCH)-based inequality that connects these two questions at the operator level. Whenever a target unitary is implemented by the available Hamiltonians, an effective logarithmic generator can be chosen within the corresponding dynamical Lie algebra, and its normalized traceless Hilbert-Schmidt norm is bounded by the time integral of the same norm of the applied Hamiltonian. This induces a global-phase-insensitive distance on the reachable subgroup and yields a protocol-independent lower bound on the control time that explicitly respects Lie-algebraic restrictions. We compare the resulting bound with familiar quantum-speed-limit estimates and show that it refines a stabilizer-based control-time bound for an XY spin chain in the single-excitation subspace. Our result thus provides an algebraic link between controllability and quantitative bounds on unitary implementation time.

quant-ph↗
arXiv2026

Strict hierarchy between $n$-wise measurement simulability, compatibility structures, and multi-copy compatibility

The incompatibility of quantum measurements, i.e. the fact that certain observable quantities cannot be measured jointly is widely regarded as a distinctive quantum feature with important implications for the foundations and the applications of quantum information theory. While the standard incompatibility of multiple measurements has been the focus of attention since the inception of quantum theory, its generalizations, such as measurement simulability, $n$-wise incompatibility, and mulit-copy incompatibility have only been proposed recently. Here, we point out that all these generalizations are differing notions of the question of how many measurements are genuinely contained in a measurement device. We then show, that all notions do differ not only in their operational meaning but also mathematically in the set of measurement assemblages they describe. We then fully resolve the relations between these different generalizations, by showing a strict hierarchy between these notions. Hence, we provide a general framework for generalized measurement incompatibility. Finally, we consider the implications our results have for recent works using these different notions.

quant-ph↗
arXiv2026

SPARSE: Scattering Poles and Amplitudes from Radial Schrödinger Equations

We introduce an algorithm for the solution of a system of radial Schrödinger equations describing the inelastic scattering of particles with spin in a partial wave with definite total angular momentum. The system of differential equations is approximated as an ordinary linear nonhomogeneous system using the finite difference method. Dirichlet boundary conditions are imposed at the origin and at an arbitrary large radius. The numerical wavefunction is calculated using LAPACK general banded LU decomposition routines. The $K$-matrix for physical energies is calculated from the numerical solutions of the system by least-square fit to the analytical real solutions at large distances. The scattering amplitudes for physical energies is then calculated from the $K$-matrix. Scattering poles in the lower half of the unphysical Riemann sheet are calculated by numerical extrapolation of the scattering amplitudes using the AAA algorithm for rational approximation.

quant-ph↗