Graphical Nonbinary Quantum Error-Correcting Codes
arXiv:0801.0831 · doi:10.1103/PhysRevA.78.012306
Abstract
In this paper, based on the nonbinary graph state, we present a systematic way of constructing good non-binary quantum codes, both additive and nonadditive, for systems with integer dimensions. With the help of computer search, which results in many interesting codes including some nonadditive codes meeting the Singleton bounds, we are able to construct explicitly four families of optimal codes, namely, , , and for any odd dimension and a family of nonadditive code for arbitrary . In the case of composite numbers as dimensions, we also construct a family of stabilizer codes for odd , whose coding subspace is {\em not} of a dimension that is a power of the dimension of the physical subsystem.
12 pages, 5 figures (pdf)
References in corpus (21)
- Fault-tolerant quantum computation by anyons
- Mixed State Entanglement and Quantum Error Correction
- Good Quantum Error-Correcting Codes Exist
- Experimental One-Way Quantum Computing
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
- Multi-party entanglement in graph states
- A Theory of Fault-Tolerant Quantum Computation
- Quantum Error Correction and Orthogonal Geometry
- Topological Quantum Distillation
- Experimental entanglement of six photons in graph states
- Simple Quantum Error Correcting Codes
- Correcting Quantum Errors with Entanglement
- Quantum error-correcting codes associated with graphs
- Quantum computation based on d-level cluster states
- Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
- A nonadditive quantum code
- A simple family of nonadditive quantum codes
- Entanglement Purification of Any Stabilizer State
- Five Quantum Register Error Correction Code For Higher Spin Systems
- Correcting Quantum Errors In Higher Spin Systems
- The Minimum Distance Problem for Two-Way Entanglement Purification
Cited by in corpus (29)
- Quantum Error Correcting Codes Using Qudit Graph States
- Standard Form of Qudit Stabilizer Groups
- On Quantum MDS Codes for odd prime power
- Greenberger-Horne-Zeilinger paradoxes from qudit graph states
- Proofs of the Kochen-Specker theorem based on the N-qubit Pauli group
- Topological Color Codes and Two-Body Quantum Lattice Hamiltonians
- Quantum variational learning for quantum error-correcting codes
- Multi-Error-Correcting Amplitude Damping Codes
- Parity proofs of the Kochen-Specker theorem based on the Lie algebra E8
- Generalized Toric Codes Coupled to Thermal Baths
- Location of quantum information in additive graph codes
- Parity proofs of the Kochen-Specker theorem based on the 120-cell
- Maximally Entangled States of Four Nonbinary Particles
- Quantum Error-Correcting Codes over Mixed Alphabets
- Qutrit ZX-calculus is Complete for Stabilizer Quantum Mechanics
- GHZ paradoxes based on an even number of qubits
- Parafermion stabilizer codes
- Codeword Stabilized Quantum Codes for Asymmetric Channels
- Near MDS and near quantum MDS codes via orthogonal arrays
- Experimental Implementation of a Codeword Stabilized Quantum Code
- Scheme for constructing graphs associated with stabilizer quantum codes
- A Construction of New Quantum MDS Codes
- Decoder for Nonbinary CWS Quantum Codes
- A new approach to codeword stabilized quantum codes using the algebraic structure of modules
- Euclidean and Hermitian Self-orthogonal Algebraic Geometry Codes and Their Application to Quantum Codes
- Revealing effects of local dimension on variable-range interacting model by connecting Lieb-Robinson bounds and multipartite entanglement
- New quantum MDS codes derived from constacyclic codes
- Separable Operations, Graph Codes and the Location of Quantum Information
- Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes