The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Projective Plane and Planar Quantum Codes
Open accessAbstract
Abstract Cellulations of the projective plane RP ^2 define single qubit topological quantum error correcting codes since there is a unique essential cycle in H1(RP2;Z2) . We construct three of the smallest such codes, show they are inequivalent, and identify one of them as Shor's original 9 qubit repetition code. We observe that Shor's code can be constructed in a planar domain and generalize to planar constructions of higher-genus codes for multiple qubits.
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
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
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 · cited 1×
“One might ask whether the 5 qubit [11] and 7 qubit [12] single qubit codes are also equivalent to some projective plane quantum code.”
BackgroundQuantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Simple quantum error-correcting codes
Steane, A. M. (1996) · Physical Review A · doi:10.1103/physreva.54.4741 · Cited by 522 · cited 1×
“The length of the shortest essential cycle in C is thus the (bit flip error) distance of the code [6].”
Background
Cited by
Decoherence, einselection, and the quantum origins of the classical
Zurek, W. H. (2003) · Reviews of Modern Physics · doi:10.1103/revmodphys.75.715 · Cited by 4,295
Superconducting Circuits for Quantum Information: An Outlook
Devoret, M. H., & Schoelkopf, R. J. (2013) · Science · doi:10.1126/science.1231930 · Cited by 2,114
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Topological superconductors: a review
Sato, M., & Ando, Y. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa6ac7 · Cited by 1,614
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Nonbinary Stabilizer Codes Over Finite Fields
Ketkar, A., Klappenecker, A., Kumar, S., & Sarvepalli, P. K. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.883612 · Cited by 623
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
“Surface codes use a 2D regular lattice of entangled physical qubits to give the substrate on which logical qubits are defined [11, 12].”
BackgroundGlobal entanglement in multiparticle systems
Meyer, D. A., & Wallach, N. R. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1497700 · Cited by 520
Self-citationData for "Realizing topologically ordered states on a quantum processor"
Satzinger, K. J. (2021) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.5570481 · Cited by 423
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
Quantum Low-Density Parity-Check Codes
Breuckmann, N. P., & Eberhardt, J. N. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.040101 · Cited by 328
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
Degenerate Quantum LDPC Codes With Good Finite Length Performance
Panteleev, P., & Kalachev, G. (2021) · Quantum · doi:10.22331/q-2021-11-22-585 · Cited by 257
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
Fault-tolerant thresholds for quantum error correction with the surface code
Stephens, A. M. (2014) · Physical Review A · doi:10.1103/physreva.89.022321 · Cited by 133
The ZX calculus is a language for surface code lattice surgery
de Beaudrap, N., & Horsman, D. (2020) · Quantum · doi:10.22331/q-2020-01-09-218 · Cited by 83
Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
Dalton, K., Long, C. K., Yordanov, Y. S., Smith, C. G., Barnes, C. H. W., Mertig, N., & Arvidsson-Shukur, D. R. M. (2024) · npj Quantum Information · doi:10.1038/s41534-024-00808-x · Cited by 43
Quantum Error Correction For Dummies
Chatterjee, A., Phalak, K., & Ghosh, S. (2023) · 2023 IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce57702.2023.00017 · Cited by 35
Metadata
- Authors
- Freedman, M. H., & Meyer, D. A.
- Venue
- Foundations of Computational Mathematics
- Published
- 2001-07
- Volume
- 1
- Issue
- 3
- Pages
- 325-332
- ISSN
- 1615-3375 (ISSN-L)
- OpenAlex
- W2045873381
- Cited by
- 183
- References
- 4
- FWCI
- 3.38
- 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.