The DOI matches its Crossref record; 141 of the 141 references it cites were found in a registry or an index.
Performance and structure of single-mode bosonic codes
Open accessAbstract
The early Gottesman, Kitaev, and Preskill (GKP) proposal for encoding a qubit in an oscillator has recently been followed by cat- and binomial-code proposals. Numerically optimized codes have also been proposed, and we introduce codes of this type here. These codes have yet to be compared using the same error model; we provide such a comparison by determining the entanglement fidelity of all codes with respect to the bosonic pure-loss channel (i.e., photon loss) after the optimal recovery operation. We then compare achievable communication rates of the combined encoding-error-recovery channel by calculating the channel's hashing bound for each code. Cat and binomial codes perform similarly, with binomial codes outperforming cat codes at small loss rates. Despite not being designed to protect against the pure-loss channel, GKP codes significantly outperform all other codes for most values of the loss rate. We show that the performance of GKP and some binomial codes increases monotonically with increasing average photon number of the codes. In order to corroborate our numerical evidence of the cat-binomial-GKP order of performance occurring at small loss rates, we analytically evaluate the quantum error-correction conditions of those codes. For GKP codes, we find an essential singularity in the entanglement fidelity in the limit of vanishing loss rate. In addition to comparing the codes, we draw parallels between binomial codes and discrete-variable systems. First, we characterize one- and two-mode binomial as well as multiqubit permutation-invariant codes in terms of spin-coherent states. Such a characterization allows us to introduce check operators and error-correction procedures for binomial codes. Second, we introduce a generalization of spin-coherent states, extending our characterization to qudit binomial codes and yielding a multiqudit code.
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
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
A scheme for efficient quantum computation with linear optics
Knill, E., Laflamme, R., & Milburn, G. J. (2001) · Nature · doi:10.1038/35051009 · Cited by 5,880
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
Quantum information with continuous variables
Braunstein, S. L., & van Loock, P. (2005) · Reviews of Modern Physics · doi:10.1103/revmodphys.77.513 · Cited by 3,858 · cited 1×
“Continuous-variable (CV) systems [1–4] continue to gain applications in quantum information processing and communication.”
BackgroundWeedbrook, C., Pirandola, S., García-Patrón, R., Cerf, N. J., Ralph, T. C., Shapiro, J. H., & Lloyd, S. (2012) · Reviews of Modern Physics · doi:10.1103/revmodphys.84.621 · Cited by 3,664
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
High-sensitivity diamond magnetometer with nanoscale resolution
Taylor, J. M., Cappellaro, P., Childress, L., Jiang, L., Budker, D., Hemmer, P. R., Yacoby, A., Walsworth, R., & Lukin, M. D. (2008) · Nature Physics · doi:10.1038/nphys1075 · Cited by 1,959
Self-citationBudker, D., & Romalis, M. (2007) · Nature Physics · doi:10.1038/nphys566 · Cited by 1,916
Theory of quantum error-correcting codes
Knill, E., & Laflamme, R. (1997) · Physical Review A · doi:10.1103/physreva.55.900 · Cited by 1,593
Cited by
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Microwave photonics with superconducting quantum circuits
Gu, X., Kockum, A. F., Miranowicz, A., Liu, Y.-X., & Nori, F. (2017) · Physics Reports · doi:10.1016/j.physrep.2017.10.002 · Cited by 1,307
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 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
Self-citationQuantum information processing and quantum optics with circuit quantum electrodynamics
Blais, A., Girvin, S. M., & Oliver, W. D. (2020) · Nature Physics · doi:10.1038/s41567-020-0806-z · Cited by 420
Self-citationEncoding 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
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
Quantum error correction and universal gate set operation on a binomial bosonic logical qubit
Hu, L., Ma, Y., Cai, W., Mu, X., Xu, Y., Wang, W., Wu, Y., Wang, H., Song, Y. P., Zou, C.-L., et al. (2019) · Nature Physics · doi:10.1038/s41567-018-0414-3 · Cited by 286
Self-citationBuilding 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
Self-citationToward large-scale fault-tolerant universal photonic quantum computing
Takeda, S., & Furusawa, A. (2019) · APL Photonics · doi:10.1063/1.5100160 · Cited by 234
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 is important in applications where these spurious couplings can cause decoherence and distortion of encoded states, especially during idling periods [39].”
BackgroundSelf-citationAll-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
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-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
Self-citationContinuous Symmetries and Approximate Quantum Error Correction
Faist, P., Nezami, S., Albert, V. V., Salton, G., Pastawski, F., Hayden, P., & Preskill, J. (2020) · Physical Review X · doi:10.1103/physrevx.10.041018 · Cited by 107
Self-citationStabilization 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
Self-citationRoom-temperature photonic logical qubits via second-order nonlinearities
Krastanov, S., Heuck, M., Shapiro, J. H., Narang, P., Englund, D. R., & Jacobs, K. (2021) · Nature Communications · doi:10.1038/s41467-020-20417-4 · Cited by 44
Jain, S. P., Iosue, J. T., Barg, A., & Albert, V. V. (2024) · Nature Physics · doi:10.1038/s41567-024-02496-y · Cited by 18
Self-citationHardware-efficient error-correcting codes for large nuclear spins
Gross, J. A., Godfrin, C., Blais, A., & Dupont-Ferrier, E. (2024) · Physical Review Applied · doi:10.1103/physrevapplied.22.014006 · Cited by 16
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
Metadata
- Authors
- Albert, V. V., Noh, K., Duivenvoorden, K., Young, D. J., Brierley, R. T., Reinhold, P., Vuillot, C., Li, L., Shen, C., Girvin, S. M., Terhal, B. M., & Jiang, L.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2018-03-30
- Volume
- 97
- Issue
- 3
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2792057424
- Cited by
- 305
- References
- 141
- FWCI
- 16.27
- 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.