Sparse Quantum Codes From Quantum Circuits
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit element. Using this prescription, we can map an arbitrary stabilizer code into a new subsystem code with the same distance and number of encoded qubits but where all the generators have constant weight, at the cost of adding some ancilla qubits. With an additional overhead of ancilla qubits, the new code can also be made spatially local. Applying our construction to certain concatenated stabilizer codes yields families of subsystem codes with constant weight generators and with minimum distance d = n1-∈, where E = O(1/√log n). For spatially local codes in D dimensions, we nearly saturate a bound due to Bravyi and Terhal and achieve d = n1-∈-1/D. Previously the best code distance achievable with constant-weight generators in any dimension, due to Freedman, Meyer, and Luo, was O(√n log n) for a stabilizer code.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Good quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Operator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486
Self-citationGauge color codes: optimal transversal gates and gauge fixing in topological stabilizer codes
Bombín, H. (2015) · New Journal of Physics · doi:10.1088/1367-2630/17/8/083002 · Cited by 217
Subsystem Fault Tolerance with the Bacon-Shor Code
Aliferis, P., & Cross, A. W. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.220502 · Cited by 203
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172
An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
Gottesman, D. (2009) · arXiv · doi:10.48550/arxiv.0904.2557 · Cited by 129
Subsystem surface codes with three-qubit check operators
Bravyi, S., Duclos-Cianci, G., Poulin, D., & Suchara, M. (2012) · arXiv · doi:10.48550/arxiv.1207.1443 · Cited by 58
Cited by
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Asymptotically good Quantum and locally testable classical LDPC codes
Panteleev, P., & Kalachev, G. (2022) · Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing · doi:10.1145/3519935.3520017 · Cited by 222
High-fidelity teleportation of a logical qubit using transversal gates and lattice surgery
Ryan-Anderson, C., Brown, N. C., Baldwin, C. H., Dreiling, J. M., Foltz, C., Gaebler, J. P., Gatterman, T. M., Hewitt, N., Holliman, C., Horst, C. V., et al. (2024) · Science · doi:10.1126/science.adp6016 · Cited by 52
Demonstration of logical qubits and repeated error correction with better-than-physical error rates
Paetznick, A., da Silva, M. P., Ryan-Anderson, C., Bello-Rivas, J. M., Campora, J. P., Chernoguzov, A., Dreiling, J. M., Foltz, C., Frachon, F., Gaebler, J. P., et al. (2024) · arXiv · doi:10.48550/arxiv.2404.02280 · Cited by 42
Metadata
- Authors
- Bacon, D., Flammia, S. T., Harrow, A. W., & Shi, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2017-04
- Volume
- 63
- Issue
- 4
- Pages
- 2464-2479
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2587575171
- Cited by
- 37
- References
- 10
- FWCI
- 1.15
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.