Hyperbolic and semi-hyperbolic surface codes for quantum storage
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
We show how a hyperbolic surface code could be used for overhead-efficient quantum storage. We give numerical evidence for a noise threshold of 1.3 % for the { 4 , 5 } -hyperbolic surface code in a phenomenological noise model (as compared with 2.9 % for the toric code). In this code family, parity checks are of weight 4 and 5, while each qubit participates in four different parity checks. We introduce a family of semi-hyperbolic codes that interpolate between the toric code and the { 4 , 5 } -hyperbolic surface code in terms of encoding rate and threshold. We show how these hyperbolic codes outperform the toric code in terms of qubit overhead for a target logical error probability. We show how Dehn twists and lattice code surgery can be used to read and write individual qubits to this quantum storage medium.
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
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904 · cited 1×
“However, 2D connectivity is not a necessity for some qubit implementations such as trapped ions or NV-centers linked via photonic couplings [9, 10, 11, 12] or silicon photonic architectures [13].”
BackgroundQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Self-citationLarge-scale modular quantum-computer architecture with atomic memory and photonic interconnects
Monroe, C., Raussendorf, R., Ruthven, A., Brown, K. R., Maunz, P., Duan, L.-M., & Kim, J. (2014) · Physical Review A · doi:10.1103/physreva.89.022317 · Cited by 700
Surface code quantum computing by lattice surgery
Horsman, D., Fowler, A. G., Devitt, S., & Meter, R. V. (2012) · New Journal of Physics · doi:10.1088/1367-2630/14/12/123011 · Cited by 598
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-citation
Research works printed but not linked: 15
- Steane, 2005, Fault-tolerant logical gate networks for Calderbank-Shor-Steane codes, Phys. Rev. A, 72, 10.1103/PhysRevA.72.052335 · DOI · Paper page
- Breuckmann, 2016, Constructions and noise threshold of hyperbolic surface codes, IEEE Trans. Inf. Theory, 62, 3731, 10.1109/TIT.2016.2555700 · DOI · Paper page
- Delfosse, 2013, Tradeoffs for reliable quantum information storage in surface codes and color codes, Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on, 917, 10.1109/ISIT.2013.6620360 · DOI · Paper page
- Nickerson, 2014, Freely scalable quantum technologies using cells of 5-to-50 qubits with very lossy and noisy photonic links, Phys. Rev. X, 4, 10.1103/PhysRevX.4.041041 · DOI · Paper page
- Gimeno-Segovia, 2015, From three-photon greenberger-horne-zeilinger states to ballistic universal quantum computation, Phys. Rev. Lett., 115, 10.1103/PhysRevLett.115.020502 · DOI · Paper page
- Dennis, 2002, Topological quantum memory, J. Math. Phys., 43, 4452, 10.1063/1.1499754 · DOI · Paper page
- Freedman, 2001, Projective plane and planar quantum codes, Foundations of Computational Mathematics, 1, 325, 10.1007/s102080010013 · DOI · Paper page
- Freedman, 2002, Z2-systolic freedom and quantum codes, 287, 10.1201/9781420035377.ch12 · DOI
- Wang, 2003, Confinement-Higgs transition in a disordered gauge theory and the accuracy threshold for quantum memory, Ann. Phys., 303, 31, 10.1016/S0003-4916(02)00019-2 · DOI · Paper page
- Barry, 2007, On the number of self-avoiding walks on hyperbolic lattices, Mathematics Magazine, 80, 369, 10.1080/0025570X.2007.11953512 · doi:10.1080/0025570x.2007.11953512
- Madras, 2005, Self-avoiding walks on hyperbolic graphs, Comb. Probab. Comput., 14, 523, 10.1017/S0963548305006772 · doi:10.1017/s0963548305006772
- Cross, 2009, A comparative code study for quantum fault tolerance, Quant. Inf. Comp, 9, 541
- Fowler, 2013, Accurate simulations of planar topological codes cannot use cyclic boundaries, Phys. Rev. A, 87, 10.1103/PhysRevA.87.062320 · DOI
- Koenig, 2010, Quantum computation with Turaev-Viro codes, Ann. Phys., 325, 2707, 10.1016/j.aop.2010.08.001 · DOI · Paper page
- Conder, 2005, Applications and adaptations of the low index subgroups procedure, Math. Comput., 74, 485, 10.1090/S0025-5718-04-01647-3 · doi:10.1090/s0025-5718-04-01647-3
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
Self-citationHyperbolic lattices in circuit quantum electrodynamics
Kollár, A. J., Fitzpatrick, M., & Houck, A. A. (2019) · Nature · doi:10.1038/s41586-019-1348-3 · Cited by 297
Almost-linear time decoding algorithm for topological codes
Delfosse, N., & Nickerson, N. H. (2021) · Quantum · doi:10.22331/q-2021-12-02-595 · Cited by 242
Topological and Subsystem Codes on Low-Degree Graphs with Flag Qubits
Chamberland, C., Zhu, G., Yoder, T. J., Hertzberg, J. B., & Cross, A. W. (2020) · Physical Review X · doi:10.1103/physrevx.10.011022 · Cited by 223
Low-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
Metadata
- Authors
- Breuckmann, N. P., Vuillot, C., Campbell, E., Krishna, A., & Terhal, B. M.
- Venue
- Quantum Science and Technology
- Publisher
- IOP Publishing
- Published
- 2017-08-02
- Volume
- 2
- Issue
- 3
- Pages
- 035007
- ISSN
- 2058-9565 (ISSN-L)
- OpenAlex
- W2592683362
- Cited by
- 87
- References
- 5
- FWCI
- 2.79
- Type
- journal article
- Language
- en
- Open access
- bronze
- Licence
- publishingsupport.iopscience.iop.org/iop-standard/v1 (vor)
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- Funders
- ERC (682726)
- Engineering and Physical Sciences Research Council (EP/M024261/1)
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Hyperbolic and semi-hyperbolic surface codes for quantum storage. https://app.cochat.ai/papers/10.1088/2058-9565/aa7d3b
- The paper
- Breuckmann, N. P., Vuillot, C., Campbell, E., Krishna, A., & Terhal, B. M. (2017). Hyperbolic and semi-hyperbolic surface codes for quantum storage. Quantum Science and Technology. https://doi.org/10.1088/2058-9565/aa7d3b
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.