Graphs, Quadratic Forms, and Quantum Codes
arXiv:quant-ph/0703112 · doi:10.1109/ISIT.2002.1023317
Abstract
We show that any stabilizer code over a finite field is equivalent to a graphical quantum code. Furthermore we prove that a graphical quantum code over a finite field is a stabilizer code. The technique used in the proof establishes a new connection between quantum codes and quadratic forms. We provide some simple examples to illustrate our results.
5 pages, 2 figures, paper presented at the 2002 IEEE International Symposium on Information Theory
References in corpus (3)
Cited by in corpus (35)
- Quantum Computing with Very Noisy Devices
- Sparse Graph Codes for Quantum Error-Correction
- Hudson's Theorem for finite-dimensional quantum systems
- Stabilizer states and Clifford operations for systems of arbitrary dimensions, and modular arithmetic
- Codeword Stabilized Quantum Codes
- Graphs, Quadratic Forms, and Quantum Codes
- On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12
- An efficient algorithm to recognize local Clifford equivalence of graph states
- General framework for verifying pure quantum states in the adversarial scenario
- Efficient Representation of Topologically Ordered States with Restricted Boltzmann Machines
- Statistical Methods for Quantum State Verification and Fidelity Estimation
- On Self-Dual Quantum Codes, Graphs, and Boolean Functions
- Graph states and local unitary transformations beyond local Clifford operations
- Non-Additive Quantum Codes from Goethals and Preparata Codes
- Location of quantum information in additive graph codes
- Directed Graph Representation of Half-Rate Additive Codes over GF(4)
- Near-term to distillation protocols using graph codes
- On the classification of Hermitian self-dual additive codes over GF(9)
- Two-colorable graph states with maximal Schmidt measure
- On the local equivalence of complete bipartite and repeater graph states
- A complete characterisation of All-versus-Nothing arguments for stabiliser states
- Spectral Orbits and Peak-to-Average Power Ratio of Boolean Functions with respect to the {I,H,N}^n Transform
- Some Ulam's reconstruction problems for quantum states
- On Quantum and Classical Error Control Codes: Constructions and Applications
- Architecture and protocols for all-photonic quantum repeaters
- Structured Error Recovery for Codeword-Stabilized Quantum Codes
- Shor-Laflamme distributions of graph states and noise robustness of entanglement
- Interlace Polynomials: Enumeration, Unimodality, and Connections to Codes
- Engineering holography with stabilizer graph codes
- Symmetries of Codeword Stabilized Quantum Codes
- Clifford Manipulations of Stabilizer States: A graphical rule book for Clifford unitaries and measurements on cluster states, and application to photonic quantum computing
- Bounds on the number of time steps for simulating arbitrary interaction graphs
- On the relation between a graph code and a graph state
- Separable Operations, Graph Codes and the Location of Quantum Information
- Geometric Graph-Theoretic Aspects of Quantum Stabilizer Codes