CoChat

Hyperbolic and semi-hyperbolic surface codes for quantum storage

Open access
Breuckmann, Nikolas P, Vuillot, Christophe, Campbell, Earl, Krishna, Anirudh, Terhal, Barbara M · 2017 · Quantum Science and Technology
Cited by 87

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/2058-9565/aa7d3b

Cites

5 of 5 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 5 references

Research works printed but not linked: 15

  1. Steane, 2005, Fault-tolerant logical gate networks for Calderbank-Shor-Steane codes, Phys. Rev. A, 72, 10.1103/PhysRevA.72.052335 · DOI · Paper page
  2. Breuckmann, 2016, Constructions and noise threshold of hyperbolic surface codes, IEEE Trans. Inf. Theory, 62, 3731, 10.1109/TIT.2016.2555700 · DOI · Paper page
  3. 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
  4. 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
  5. 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
  6. Dennis, 2002, Topological quantum memory, J. Math. Phys., 43, 4452, 10.1063/1.1499754 · DOI · Paper page
  7. Freedman, 2001, Projective plane and planar quantum codes, Foundations of Computational Mathematics, 1, 325, 10.1007/s102080010013 · DOI · Paper page
  8. Freedman, 2002, Z2-systolic freedom and quantum codes, 287, 10.1201/9781420035377.ch12 · DOI
  9. 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
  10. 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
  11. Madras, 2005, Self-avoiding walks on hyperbolic graphs, Comb. Probab. Comput., 14, 523, 10.1017/S0963548305006772 · doi:10.1017/s0963548305006772
  12. Cross, 2009, A comparative code study for quantum fault tolerance, Quant. Inf. Comp, 9, 541
  13. Fowler, 2013, Accurate simulations of planar topological codes cannot use cyclic boundaries, Phys. Rev. A, 87, 10.1103/PhysRevA.87.062320 · DOI
  14. Koenig, 2010, Quantum computation with Turaev-Viro codes, Ann. Phys., 325, 2707, 10.1016/j.aop.2010.08.001 · DOI · Paper page
  15. 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

See all 87

Metadata

Authors
Breuckmann, N. P., Vuillot, C., Campbell, E., Krishna, A., & Terhal, B. M.
Venue
Quantum Science and Technology
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
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.