Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
Encoding a qubit in the continuous degrees of freedom of an oscillator is a promising path to error-corrected quantum computation. One advantageous way to achieve this is through Gottesman-Kitaev-Preskill (GKP) grid states, whose symmetries allow for the correction of any small continuous error on the oscillator. Unfortunately, ideal grid states have infinite energy, so it is important to find finite-energy approximations that are realistic, practical, and useful for applications. In the first half of this work we investigate the impact of imperfect GKP states on computational circuits independently of the physical architecture. To this end, we analyze the behavior of the physical and logical content of normalizable GKP states through several figures of merit, employing a recently developed modular subsystem decomposition. By tracking the errors that enter into the computational circuit due to imperfections in the GKP states, we are able to gauge the utility of these states for noisy intermediate-scale quantum devices. In the second half, we focus on a state preparation approach in the photonic domain wherein photon-number-resolving measurements on some modes of Gaussian states produce non-Gaussian states in others. We produce detailed numerical results for the preparation of GKP states alongside estimating the resource requirements in practical settings and probing the quality of the resulting states with the tools we develop. Our numerical experiments indicate that we can generate any state in the GKP Bloch sphere with nearly equal resources, which has implications for magic state preparation overheads.
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
SciPy 1.0: fundamental algorithms for scientific computing in Python
Virtanen, P., Gommers, R., Oliphant, T. E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J., et al. (2019) · Apollo - University of Cambridge Repository · doi:10.17863/cam.64134 · Cited by 10,460
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
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Negativity of the Wigner function as an indicator of non-classicality
Kenfack, A., & yczkowski, K. (2004) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/6/10/003 · Cited by 779
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
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
All-Gaussian universality and fault tolerance with the Gottesman-Kitaev-Preskill code
Baragiola, B. Q., Pantaleoni, G., Alexander, R. N., Karanjai, A., & Menicucci, N. C. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.200502 · Cited by 173
Self-citationFault-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
Quantum error correction beyond qubits
Aoki, T., Takahashi, G., Kajiya, T., Yoshikawa, J.-I., Braunstein, S. L., van Loock, P., & Furusawa, A. (2009) · Nature Physics · doi:10.1038/nphys1309 · Cited by 144
Cited by
Quantum repeaters: From quantum networks to the quantum internet
Azuma, K., Economou, S. E., Elkouss, D., Hilaire, P., Jiang, L., Lo, H.-K., & Tzitrin, I. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045006 · Cited by 559
Self-citationQuantum Simulation for High-Energy Physics
Bauer, C. W., Davoudi, Z., Balantekin, A. B., Bhattacharya, T., Carena, M., de Jong, W. A., Draper, P., El-Khadra, A., Gemelke, N., Hanada, M., et al. (2023) · PRX Quantum · doi:10.1103/prxquantum.4.027001 · Cited by 326
Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
Bourassa, J. E., Alexander, R. N., Vasmer, M., Patil, A., Tzitrin, I., Matsuura, T., Su, D., Baragiola, B. Q., Guha, S., Dauphinais, G., et al. (2021) · Quantum · doi:10.22331/q-2021-02-04-392 · Cited by 302
Self-citationFault-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
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
Metadata
- Authors
- Tzitrin, I., Bourassa, J. E., Menicucci, N. C., & Sabapathy, K. K.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2020-03-12
- Volume
- 101
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W3011304246
- Cited by
- 157
- References
- 12
- FWCI
- 8.33
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes. https://app.cochat.ai/papers/10.1103/physreva.101.032315
- The paper
- Tzitrin, I., Bourassa, J. E., Menicucci, N. C., & Sabapathy, K. K. (2020). Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes. Physical Review A. https://doi.org/10.1103/physreva.101.032315
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.