Limits on the storage of quantum information in a volume of space
arXiv:1610.06169 · doi:10.22331/q-2017-04-25-4
Abstract
We study the fundamental limits on the reliable storage of quantum information in lattices of qubits by deriving tradeoff bounds for approximate quantum error correcting codes. We introduce a notion of local approximate correctability and code distance, and give a number of equivalent formulations thereof, generalizing various exact error-correction criteria. Our tradeoff bounds relate the number of physical qubits , the number of encoded qubits , the code distance , the accuracy parameter that quantifies how well the erasure channel can be reversed, and the locality parameter that specifies the length scale at which the recovery operation can be done. In a regime where the recovery is successful to accuracy that is exponentially small in , which is the case for perturbations of local commuting projector codes, our bound reads for codes on -dimensional lattices of Euclidean metric. We also find that the code distance of any local approximate code cannot exceed if . As a corollary of our formulation of correctability in terms of logical operator avoidance, we show that the code distance and the size of a minimal region that can support all approximate logical operators satisfies , where the logical operators are accurate up to in operator norm. Finally, we prove that for two-dimensional systems if logical operators can be approximated by operators supported on constant-width flexible strings, then the dimension of the code space must be bounded. This supports one of the assumptions of algebraic anyon theories, that there exist only finitely many anyon types.
20+10 pages, 5 figures. v2, Final published version to appear in the journal Quantum. v3, fixing Lemma 15(iv)
References in corpus (7)
- Restrictions on Transversal Encoded Quantum Gate Sets
- The Ryu-Takayanagi Formula from Quantum Error Correction
- A Sharp Fannes-type Inequality for the von Neumann Entropy
- A no-go theorem for a two-dimensional self-correcting quantum memory based on stabilizer codes
- Framework for classifying logical operators in stabilizer codes
- Entanglement renormalization, quantum error correction, and bulk causality
- Approximate symmetries of Hamiltonians
Cited by in corpus (27)
- Holographic tensor network models and quantum error correction: A topical review
- Recoverable Information and Emergent Conservation Laws in Fracton Stabilizer Codes
- The ghost in the radiation: Robust encodings of the black hole interior
- Quantum Approximate Markov Chains are Thermal
- Higher-dimensional quantum hypergraph-product codes
- Towards holography via quantum source-channel codes
- Approximate Bacon-Shor Code and Holography
- On the stability of charges in infinite quantum spin systems
- A degeneracy bound for homogeneous topological order
- Topological quantum error correction in the Kitaev honeycomb model
- Good approximate quantum LDPC codes from spacetime circuit Hamiltonians
- Complexity and order in approximate quantum error-correcting codes
- Theory of quasi-exact fault-tolerant quantum computing and valence-bond-solid codes
- Fractalizing quantum codes
- Gauging the bulk: generalized gauging maps and holographic codes
- Quantum chi-squared tomography and mutual information testing
- Decay of quantum conditional mutual information for purely generated finitely correlated states
- Renormalization group and approximate error correction
- Minimal distances for certain quantum product codes and tensor products of chain complexes
- Quantum error correction and entanglement spectrum in tensor networks
- Open-System Quantum Error Correction
- Ground Subspaces of Topological Phases of Matter as Error Correcting Codes
- Matrix product states and the decay of quantum conditional mutual information
- Approximate Quantum Codes From Long Wormholes
- Wire Codes
- Roughening Transition in Quantum Circuits
- Universal Decay of Mutual Information and Conditional Mutual Information in Gapped Pure- and Mixed-State Quantum Matter