Quantum Error Correction with the Gottesman-Kitaev-Preskill Code
Open accessThe DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Abstract
The Gottesman-Kitaev-Preskill (GKP) code was proposed in 2001 by
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: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
Anomalous collapses of Nares Strait ice arches leads to enhanced export of Arctic sea ice
Moore, G. W. K., Howell, S. E. L., Brady, M., Xu, X., & McNeil, K. (2021) · Nature Communications · doi:10.1038/s41467-020-20314-w · Cited by 5,155
Dennis, E., Kitaev, A., Landahl, A., & Preskill, J. (2002) · Journal of Mathematical Physics · doi:10.1063/1.1499754 · Cited by 1,768
Encoding a qubit in an oscillator
Gottesman, D., Kitaev, A., & Preskill, J. (2001) · Physical Review A · doi:10.1103/physreva.64.012310 · Cited by 1,532
Universal quantum computation with ideal Clifford gates and noisy ancillas
Bravyi, S., & Kitaev, A. (2005) · Physical Review A · doi:10.1103/physreva.71.022316 · Cited by 1,525 · cited 1×
“Combined with state preparation of GKP magic states |AL〉 = T̄ |+L〉, logical injection and distillation [81, 82] (both of which only require error correction and Clifford gates) provides the ability to perform universal quantum computation in the GKP-concatenated surface code.”
MethodImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“An elegant solution to this problem is to make use of a so-called Clifford frame, where single qubit Cliffords are tracked “in software” [44, 45].”
MethodQuantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184 · cited 5×
“As shown in the figure, the propagation of displacement errors through the two circuits are essentially equivalent, but the Knill circuit does not require any active recovery.”
BackgroundMethodInfluentialExtending the lifetime of a quantum bit with error correction in superconducting circuits
Ofek, N., Petrenko, A., Heeres, R., Reinhold, P., Leghtas, Z., Vlastakis, B., Liu, Y., Frunzio, L., Girvin, S. M., Jiang, L., et al. (2016) · Nature · doi:10.1038/nature18949 · Cited by 941
A simple formula for the average gate fidelity of a quantum dynamical operation
Nielsen, M. A. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01272-0 · Cited by 725
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 · cited 1×
“An attractive feature of the surface code is that all logical Clifford operations can be implemented via lattice surgery requiring only (single or two-qubit) logical Pauli measurements [16, 79, 80].”
Cited by
Fast universal control of an oscillator with weak dispersive coupling to a qubit
Eickbusch, A., Sivak, V., Ding, A. Z., Elder, S. S., Jha, S. R., Venkatraman, J., Royer, B., Girvin, S. M., Schoelkopf, R. J., & Devoret, M. H. (2022) · Nature Physics · doi:10.1038/s41567-022-01776-9 · Cited by 173
“The finite energy square GKP code stabilizers and logical Pauli operators are defined as [4, 8, 23, 49, 50, 85]”
BackgroundMethodQuantum error correction of qudits beyond break-even
Brock, B. L., Singh, S., Eickbusch, A., Sivak, V. V., Ding, A. Z., Frunzio, L., Girvin, S. M., & Devoret, M. H. (2025) · Nature · doi:10.1038/s41586-025-08899-y · Cited by 64
Two-Qubit Operations for Finite-Energy Gottesman-Kitaev-Preskill Encodings
Rojkov, I., Röggla, P. M., Wagener, M., Fontboté-Schmidt, M., Welte, S., Home, J., & Reiter, F. (2024) · Physical Review Letters · doi:10.1103/physrevlett.133.100601 · Cited by 12
Code conversion with the quantum Golay code for a universal transversal gate set
Sullivan, M. (2024) · Physical Review A · doi:10.1103/physreva.109.042416 · Cited by 7
Gottesman-Kitaev-Preskill codes: A lattice perspective
Conrad, J., Eisert, J., & Arzani, F. (2022) · Quantum · doi:10.22331/q-2022-02-10-648
Metadata
- Authors
- Grimsmo, A. L., & Puri, S.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2021-06-23
- Volume
- 2
- Issue
- 2
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W3174670458
- Cited by
- 132
- References
- 27
- FWCI
- 6.97
- Type
- journal article
- Language
- en
- Open access
- gold
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.