Year: 2015
Type: conference-paper
Abstract: Sparse quantum codes are analogous to LDPC codes in that their check operators require examining only a constant number of qubits. In contrast to LDPC codes, good sparse quantum codes are not known, and even to encode a single qubit, the best known distance is O(√{n log(n)}), due to Freedman, Meyer and Luo.
Authors: Dave Bacon, Steven T. Flammia, Aram W. Harrow, Jonathan Shi
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G1126671073, CAREER: Applications of Quantum Information Theory, CAREER: Approximation and Hardness from Strong Relaxations, G5539695041, G6705642846, AF: Large: Collaborative Research: Reliable Quantum Communication and Computation in the Presence of Noise, G7749294, EMT/QIS: Robust Quantum Simulation Techniques for Fault-Tolerant Quantum Computation, Quantum Concatenated Code Hamiltonians, G8635998262, AF: Small: Graph Isomorphism and Quantum Random Walks by Anyons
OpenAlex ID: W2078053614
