Low-Overhead Fault-Tolerant Quantum Error Correction with the Surface-GKP Code
Open accessThe DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Abstract
Fault-tolerant quantum error correction is essential for implementing quantum algorithms of significant practical importance.In this work, we propose a highly effective use of the surface Gottesman-Kitaev-Preskill (GKP) code, i.e., the surface code consisting of bosonic GKP qubits instead of bare two-level qubits.In our proposal, we use error-corrected two-qubit gates between GKP qubits and introduce a maximum-likelihood decoding strategy for correcting shift errors in the two-GKP-qubit gates.Our proposed decoding reduces the total CNOT failure rate of the GKP qubits, e.g., from 0.87% to 0.36% at a GKP squeezing of 12 dB, compared to the case where the simple closest-integer decoding is used.Then, by concatenating the GKP code with the surface code, we find that the threshold GKP squeezing is given by 9.9 dB under the the assumption that finite squeezing of the GKP states is the dominant noise source.More importantly, we show that a low logical failure rate p L < 10 -7 can be achieved with moderate hardware requirements, e.g., 291 modes and 97 qubits at a GKP squeezing of 12 dB as opposed to 1457 bare qubits for the standard rotated surface code at an equivalent noise level (i.e., p = 0.36%).Such a low failure rate of our surface-GKP code is possible through the use of space-time correlated edges in the matching graphs of the surface-code decoder.Further, all edge weights in the matching graphs are computed dynamically based on analog information from the GKP error correction using the full history of all syndrome measurement rounds.We also show that a highly squeezed GKP state of GKP squeezing 12 dB can be experimentally realized by using a dissipative stabilization method, namely, the big-small-big method, with fairly conservative experimental parameters.Lastly, we introduce a three-level ancilla scheme to mitigate ancilla decay errors during a GKP state preparation.
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 Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 1×
“Despite various opportunities offered by noisy intermediate-scale quantum (NISQ) devices [1], faulttolerant quantum error correction techniques [2] are essential for executing quantum algorithms intractable by classical computers such as integer factorization [3] and the simulation of real-time dynamics of large quant…”
BackgroundCharge-insensitive qubit design derived from the Cooper pair box
Koch, J., Yu, T. M., Gambetta, J., Houck, A. A., Schuster, D. I., Majer, J., Blais, A., Devoret, M. H., Girvin, S. M., & Schoelkopf, R. J. (2007) · Physical Review A · doi:10.1103/physreva.76.042319 · Cited by 3,351
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“Despite various opportunities offered by noisy intermediate-scale quantum (NISQ) devices [1], faulttolerant quantum-error-correction techniques [2] are essential for executing quantum algorithms intractable by classical computers such as integer factorization [3] and the simulation of real-time dynamics of large quant…”
BackgroundSurface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 4×
“One of the most promising approaches towards fault-tolerant quantum computing is to implement the surface code [5] (or its variants) using bare qubits such as transmons [6, 7] or internal states of trapped ions [8].”
BackgroundMethodInfluentialEdmonds, J. (1965) · Canadian Journal of Mathematics · doi:10.4153/cjm-1965-045-4 · Cited by 2,428
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×
“A more promising avenue would be to pursue the more widely used |H〉-type magic states [72].”
BackgroundImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 1×
“In this case, the Gottesman-Knill simulation method [65, 66] does not apply any more in the analysis of the surface code, making it practically impossible to simulate a large-distance surface code.”
MethodQuantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Dynamically protected cat-qubits: a new paradigm for universal quantum computation
Mirrahimi, M., Leghtas, Z., Albert, V. V., Touzard, S., Schoelkopf, R. J., Jiang, L., & Devoret, M. H. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/4/045014 · Cited by 639
Confining the state of light to a quantum manifold by engineered two-photon loss
Leghtas, Z., Touzard, S., Pop, I. M., Kou, A., Vlastakis, B., Petrenko, A., Sliwa, K. M., Narla, A., Shankar, S., Hatridge, M. J., et al. (2015) · Science · doi:10.1126/science.aaa2085 · Cited by 555
The Heisenberg Representation of Quantum Computers
Gottesman, D. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9807006 · Cited by 489
Macroscopically distinct quantum-superposition states as a bosonic code for amplitude damping
Cochrane, P. T., Milburn, G. J., & Munro, W. J. (1999) · Physical Review A · doi:10.1103/physreva.59.2631 · Cited by 470
Quantum error correction of a qubit encoded in grid states of an oscillator
Campagne-Ibarcq, P., Eickbusch, A., Touzard, S., Zalys-Geller, E., Frattini, N. E., Sivak, V. V., Reinhold, P., Puri, S., Shankar, S., Schoelkopf, R. J., et al. (2020) · Nature · doi:10.1038/s41586-020-2603-3 · Cited by 459
Efficient quantum computation using coherent states
Jeong, H., & Kim, M. S. (2002) · Physical Review A · doi:10.1103/physreva.65.042305 · Cited by 398
Encoding a qubit in a trapped-ion mechanical oscillator
Flühmann, C., Nguyen, T. L., Marinelli, M., Negnevitsky, V., Mehta, K., & Home, J. P. (2019) · Nature · doi:10.1038/s41586-019-0960-6 · Cited by 394 · cited 2×
“, q̂) [23, 24, 26] instead of the vacuum state so that we can mostly focus on squeezing the other quadrature (e.”
BackgroundFault-tolerant control of an error-corrected qubit
Egan, L., Debroy, D. M., Noel, C., Risinger, A., Zhu, D., Biswas, D., Newman, M., Li, M., Brown, K. R., Cetina, M., et al. (2021) · Nature · doi:10.1038/s41586-021-03928-y · Cited by 348
Building a Fault-Tolerant Quantum Computer Using Concatenated Cat Codes
Chamberland, C., Noh, K., Arrangoiz-Arriola, P., Campbell, E. T., Hann, C. T., Iverson, J., Putterman, H., Bohdanowicz, T. C., Flammia, S. T., Keller, A., et al. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010329 · Cited by 281 · cited 2×
“In recent proposals [17, 19, 20], the unique noise-bias feature of bosonic cat qubits has been utilized to significantly reduce the required resource overheads for implementing fault-tolerant quantum computation.”
BackgroundMethodSelf-citationExponential suppression of bit-flips in a qubit encoded in an oscillator
Lescanne, R., Villiers, M., Peronnin, T., Sarlette, A., Delbecq, M., Huard, B., Kontos, T., Mirrahimi, M., & Leghtas, Z. (2020) · Nature Physics · doi:10.1038/s41567-020-0824-x · Cited by 276 · cited 2×
“, SNAIL [102] or ATS [16]) such that higher-order nonlinear interactions are minimized.”
BackgroundRepetition Cat Qubits for Fault-Tolerant Quantum Computation
Guillaud, J., & Mirrahimi, M. (2019) · Physical Review X · doi:10.1103/physrevx.9.041053 · Cited by 243 · cited 2×
“In recent proposals [17, 19, 20], the unique noise-bias feature of bosonic cat qubits has been utilized to significantly reduce the required resource overheads for implementing fault-tolerant quantum computation.”
BackgroundMethodAlmost-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
Self-citationEfficient algorithms for maximum likelihood decoding in the surface code
Bravyi, S., Suchara, M., & Vargo, A. (2014) · Physical Review A · doi:10.1103/physreva.90.032326 · Cited by 214 · cited 1×
“, by using a tensor-network decoder [67, 68]) or to speed up the decoding at the expense of decreased performance (e.”
MethodBias-preserving gates with stabilized cat qubits
Puri, S., St-Jean, L., Gross, J. A., Grimm, A., Frattini, N. E., Iyer, P. S., Krishna, A., Touzard, S., Jiang, L., Blais, A., et al. (2020) · Science Advances · doi:10.1126/sciadv.aay5901 · Cited by 201
Fault-tolerant bosonic quantum error correction with the surface–Gottesman-Kitaev-Preskill code
Noh, K., & Chamberland, C. (2020) · Physical Review A · doi:10.1103/physreva.101.012316 · Cited by 164
Self-citationFlag fault-tolerant error correction with arbitrary distance codes
Chamberland, C., & Beverland, M. E. (2018) · Quantum · doi:10.22331/q-2018-02-08-53 · Cited by 159
Self-citationError correction of a logical grid state qubit by dissipative pumping
de Neeve, B., Nguyen, T.-L., Behrle, T., & Home, J. P. (2022) · Nature Physics · doi:10.1038/s41567-021-01487-7 · Cited by 152
Towards scalable bosonic quantum error correction
Terhal, B. M., Conrad, J., & Vuillot, C. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab98a5 · Cited by 146 · cited 1×
“[45,72], we define the effective GKP squeezings (in position and momentum quadratures) of the state ρ̂ as follows and use them as the key figure of merit:”
MethodFault-tolerant quantum computation with few qubits
Chao, R., & Reichardt, B. W. (2018) · npj Quantum Information · doi:10.1038/s41534-018-0085-z · Cited by 137
An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
Gottesman, D. (2009) · arXiv · doi:10.48550/arxiv.0904.2557 · Cited by 129
Triangular color codes on trivalent graphs with flag qubits
Chamberland, C., Kubica, A., Yoder, T. J., & Zhu, G. (2020) · New Journal of Physics · doi:10.1088/1367-2630/ab68fd · Cited by 105
Self-citationAnalog Quantum Error Correction with Encoding a Qubit into an Oscillator
Fukui, K., Tomita, A., & Okamoto, A. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.180507 · Cited by 104 · cited 1×
“, the surface code), extra analog information gathered from GKP error correction [27] can inform us which GKP qubits are more likely to have had an error.”
BackgroundFlag Fault-Tolerant Error Correction for any Stabilizer Code
Chao, R., & Reichardt, B. W. (2020) · PRX Quantum · doi:10.1103/prxquantum.1.010302 · Cited by 95
Stabilization of Finite-Energy Gottesman-Kitaev-Preskill States
Royer, B., Singh, S., & Girvin, S. M. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.260509 · Cited by 88
Fault-Tolerant Operation of a Quantum Error-Correction Code
Egan, L., Debroy, D. M., Noel, C., Risinger, A., Zhu, D., Biswas, D., Newman, M., Li, M., Brown, K. R., Cetina, M., et al. (2020) · arXiv · doi:10.48550/arxiv.2009.11482 · Cited by 65
Error rates and resource overheads of repetition cat qubits
Guillaud, J., & Mirrahimi, M. (2021) · Physical Review A · doi:10.1103/physreva.103.042413 · Cited by 55 · cited 2×
“In recent proposals [17, 19, 20], the unique noise-bias feature of bosonic cat qubits has been utilized to significantly reduce the required resource overheads for implementing fault-tolerant quantum computation.”
BackgroundMethod
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
“This order-of-magnitude reduction in initialization time can reduce the hardware overhead of error correction protocols requiring GKP resource states, such as teleported error correction [8] or the GKP surface code [53, 54].”
MethodJain, S. P., Iosue, J. T., Barg, A., & Albert, V. V. (2024) · Nature Physics · doi:10.1038/s41567-024-02496-y · Cited by 18
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
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
- Noh, K., Chamberland, C., & Brandão, F. G. S. L.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2022-01-28
- Volume
- 3
- Issue
- 1
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W4210810680
- Cited by
- 75
- References
- 39
- FWCI
- 4.77
- 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.