Cited by 423Quantum Information and CryptographySuperconducting and THz Device TechnologyQuantum Computing Algorithms and Architecture

Tunable Coupling Scheme for Implementing High-Fidelity Two-Qubit Gates

Open access
Yan, Fei, Krantz, Philip, Sung, Youngkyu, Kjaergaard, Morten, Campbell, Daniel L., Orlando, Terry P., Gustavsson, Simon, Oliver, William D.·2018·Physical Review Applied

Abstract

Superconducting qubits now offer coherence times exceeding 100 $\ensuremath{\mu}$s and single-qubit gate fidelities above 99.9%, but realizing a large-scale quantum computer is still impeded by the quality of two-qubit gates, with typical fidelities of 95--99%. Here a simple, broadly applicable scheme to improve two-qubit gates using a tunable coupler is proposed. It simplifies the coupling scheme, and reduces unwanted interactions typically present in schemes in which the interactions are always on. Numerical simulations show that this approach should allow two-qubit gate fidelities greater than 99.9%, when implemented using state-of-the-art superconducting qubits.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevapplied.10.054062

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [35]35. Michel H. Devoret, in Proceedings of the Les Houches Summer School, Session LXIII, edited by S. Reynaud, E. Giacobino, and J. Zinn Justin (Elsevier, New York, 1997), pp. 351-386.
  2. [36]36. Steven M. Girvin, in Proceedings of the 2011 Les Houches Summer School (Oxford University Press, Oxford, 2011).

Cited by

Sorted by citations

Authors
Yan, F., Krantz, P., Sung, Y., Kjaergaard, M., Campbell, D. L., Orlando, T. P., Gustavsson, S., & Oliver, W. D.
Affiliations
  • Massachusetts Institute of Technology (US)
  • MIT Lincoln Laboratory (US)
Venue
Physical Review Applied
Published
2018-11-28
Volume
10
Issue
5
ISSN
2331-7019 (ISSN-L)
OpenAlex
W2795017070
Cited by
423
References
37
Citations by year
2026: 55 · 2025: 84 · 2024: 68 · 2023: 87 · 2022: 43 · 2021: 55 · 2020: 25 · 2019: 6
FWCI
11.94
Type
journal article
Language
en
Open access
Locations
  • Physical Review Applied (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
  • Chalmers Research (Chalmers University of Technology) (submittedVersion)
  • arXiv (Cornell University)
  • Physical Review Letters
Funders
  • MIT Lincoln Laboratory (FA8721-05-C-0002)
  • Army Research Office
  • National Science Foundation
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Astronomy and Astrophysics › Superconducting and THz Device Technology
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
Keywords
tunable coupler, two-qubit gates, gate fidelity, superconducting qubits, quantum computing

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