Cited by 146Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Towards scalable bosonic quantum error correction

Open access
Terhal, B M, Conrad, J, Vuillot, C·2020·Quantum Science and Technology

Abstract

We review some of the recent efforts in devising and engineering bosonic qubits for superconducting devices, with emphasis on the Gottesman–Kitaev–Preskill (GKP) qubit. We present some new results on decoding repeated GKP error correction using finitely-squeezed GKP ancilla qubits, exhibiting differences with previously studied stochastic error models. We discuss circuit-QED ways to realize CZ gates between GKP qubits and we discuss different scenarios for using GKP and regular qubits as building blocks in a scalable superconducting surface code architecture.

Integrity signals

Registry

Crossref · 10.1088/2058-9565/ab98a5

Cites

6 of 6 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Such a concatenation requires entangling gates, which for GKP qudits can be realized with the same operations used for entangling GKP qubits.

    “Such a concatenation requires entangling gates, which for GKP qudits can be realized with the same operations used for entangling GKP qubits20,53–55.”

    From Quantum error correction of qudits beyond break-even (2025) · cites this paper as [53]

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Terhal, B. M., Conrad, J., & Vuillot, C.
Affiliations
  • Forschungszentrum Jülich (DE)
  • Helmholtz-Zentrum Berlin für Materialien und Energie (DE)
  • Centre Inria de Paris (FR)
Corresponding author
  • Terhal, B M
  • Conrad, J
  • Vuillot, C
Venue
Quantum Science and Technology
Published
2020-07-09
Volume
5
Issue
4
Pages
043001
ISSN
2058-9565 (ISSN-L)
OpenAlex
W3007806070
Cited by
146
References
6
Citations by year
2026: 16 · 2025: 31 · 2024: 29 · 2023: 25 · 2022: 14 · 2021: 27 · 2020: 4
FWCI
6.97
Type
journal article
Language
en
Open access
Locations
  • Quantum Science and Technology (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • HAL (submittedVersion)
  • Research Repository (Delft University of Technology) (submittedVersion)
  • Data Archiving and Networked Services (DANS) (submittedVersion, cc-by)
  • arXiv (Cornell University)
Funders
  • QuantERA (QCDA Consortium)
  • H2020 European Research Council (682726)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
bosonic quantum error correction, superconducting qubits, circuit quantum electrodynamics, CZ gate, scalable quantum computing, stochastic error model

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