The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Tradeoffs for Reliable Quantum Information Storage in 2D Systems
Open accessAbstract
We ask whether there are fundamental limits on storing quantum information reliably in a bounded volume of space. To investigate this question, we study quantum error correcting codes specified by geometrically local commuting constraints on a 2D lattice of finite-dimensional quantum particles. For these 2D systems, we derive a tradeoff between the number of encoded qubits k, the distance of the code d, and the number of particles n. It is shown that kd{2}=O(n) where the coefficient in O(n) depends only on the locality of the constraints and dimension of the Hilbert spaces describing individual particles. The analogous tradeoff for the classical information storage is k sqrt[d]=O(n).
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
Quantum Computation and Quantum Information
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895
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
Ultimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120
Structure of States Which Satisfy Strong Subadditivity of Quantum Entropy with Equality
Hayden, P., Jozsa, R., Petz, D., & Winter, A. (2004) · Communications in Mathematical Physics · doi:10.1007/s00220-004-1049-z · Cited by 429
Quantum codes on a lattice with boundary
Bravyi, S. B., & Kitaev, A. Y. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9811052 · Cited by 394
Self-citationDissipation and noise immunity in computation and communication
Landauer, R. (1988) · Nature · doi:10.1038/335779a0 · Cited by 208
Research works printed but not linked: 15
- C. H. Bennett, 1985, Sci. Am., 253, 48, 10.1038/scientificamerican0785-48 · DOI · Paper page
- 10.1088/1367-2630/11/4/043029 · DOI · Paper page
- 10.1103/PhysRevB.71.045110 · DOI · Paper page
- 10.1103/PhysRevB.79.195123 · DOI
- 10.1016/S0003-4916(02)00018-0 · DOI · Paper page
- 10.1103/PhysRevLett.91.090402 · DOI · Paper page
- 10.1038/nphys287 · DOI · Paper page
- 10.1103/RevModPhys.74.825 · DOI · Paper page
- G. Zemor, 2009, Coding and Cryptography
- 10.1103/PhysRevA.73.062303 · DOI
- M. Freedman, 2002, Mathematics of Computation
- 10.1109/12.286310 · DOI
- 10.1103/PhysRevE.60.5068 · doi:10.1103/physreve.60.5068
- 10.1103/PhysRevA.54.2629 · DOI · Paper page
- S. Bravyi, 2005, Quantum Inf. Comput., 5, 187, 10.26421/QIC5.3-2 · DOI
Cited by
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Self-citationLocal stabilizer codes in three dimensions without string logical operators
Haah, J. (2011) · Physical Review A · doi:10.1103/physreva.83.042330 · Cited by 690
Roads towards fault-tolerant universal quantum computation
Campbell, E. T., Terhal, B. M., & Vuillot, C. (2017) · Nature · doi:10.1038/nature23460 · Cited by 596
Self-citationHigh-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456
“One drawback of high-rate LDPC codes is that their Tanner graphs may not be locally embeddable into the 2D grid [39, 40].”
BackgroundSelf-citationThe future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
Self-citationQuantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
Exotic topological order in fractal spin liquids
Yoshida, B. (2013) · Physical Review B · doi:10.1103/physrevb.88.125122 · Cited by 283
Fault-Tolerant quantum computation with constant overhead
Gottesman, D. (2014) · Quantum Information and Computation · doi:10.26421/qic14.15-16-5 · Cited by 172
“Codes for which all syndrome bits can be locally measured do not seem capable of encoding qubits without an overhead that grows as the system size grows [6], but there may be some possibility of a result comparable to Thm.”
ResultFocus beyond Quadratic Speedups for Error-Corrected Quantum Advantage
Babbush, R., McClean, J. R., Newman, M., Gidney, C., Boixo, S., & Neven, H. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010103 · Cited by 148
“ical qubits to physical qubits, assuming an underlying growing code distance [79,80].”
BackgroundLow-overhead fault-tolerant quantum computing using long-range connectivity
Cohen, L. Z., Kim, I. H., Bartlett, S. D., & Brown, B. J. (2022) · Science Advances · doi:10.1126/sciadv.abn1717 · Cited by 98
Constant-Overhead Quantum Error Correction with Thin Planar Connectivity
Tremblay, M. A., Delfosse, N., & Beverland, M. E. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.050504 · Cited by 83
Code Properties from Holographic Geometries
Pastawski, F., & Preskill, J. (2017) · Physical Review X · doi:10.1103/physrevx.7.021022 · Cited by 52
Gidney, C., Newman, M., Brooks, P., & Jones, C. (2025) · Nature Communications · doi:10.1038/s41467-025-59714-1 · Cited by 85
Entangling Four Logical Qubits beyond Break-Even in a Nonlocal Code
Hong, Y., Durso-Sabina, E., Hayes, D., & Lucas, A. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.180601 · Cited by 29
Hierarchical memories: Simulating quantum LDPC codes with local gates
Pattison, C. A., Krishna, A., & Preskill, J. (2023) · arXiv · doi:10.48550/arxiv.2303.04798 · Cited by 20
Distance-preserving stabilizer measurements in hypergraph product codes
Manes, A. G., & Claes, J. (2025) · Quantum · doi:10.22331/q-2025-01-30-1618 · Cited by 17
A Numerical Study of Bravyi-Bacon-Shor and Subsystem Hypergraph Product Codes
Li, M., & Yoder, T. J. (2020) · 2020 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00024 · Cited by 12
Quantum error correction and fault tolerance: A comprehensive tutorial
Spencer, D. J., Jain, S. P., Tanggara, A., Sun, Z., Haug, T., Khu, D., & Bharti, K. (2026) · arXiv
Metadata
- Authors
- Bravyi, S., Poulin, D., & Terhal, B.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2010-02-05
- Volume
- 104
- Issue
- 5
- Pages
- 050503-050503
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2062794279
- Cited by
- 191
- References
- 6
- FWCI
- 9.18
- 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.