The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
Tunable Coupling Architecture for Fixed-Frequency Transmon Superconducting Qubits
Open accessAbstract
Implementation of high-fidelity 2-qubit operations is a key ingredient for scalable quantum error correction. In superconducting qubit architectures, tunable buses have been explored as a means to higher-fidelity gates. However, these buses introduce new pathways for leakage. Here we present a modified tunable bus architecture appropriate for fixed-frequency qubits in which the adiabaticity restrictions on gate speed are reduced. We characterize this coupler on a range of 2-qubit devices, achieving a maximum gate fidelity of 99.85%. We further show the calibration is stable over one day.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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?
The source backs part of the claim, not all of it — or backs it for a different population, condition or comparison.
In the citing paper
“However, with the tuneable coupler55,56 in IBM Quantum Egret and now being developed for the IBM Quantum Heron, this problem no longer exists as qubit frequencies can be designed to be farther apart.”
From High-threshold and low-overhead fault-tolerant quantum memory (2024) · cites this paper as [56]
Experimental — accuracy not yet measured
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
Charge-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
Blais, A., Huang, R.-S., Wallraff, A., Girvin, S. M., & Schoelkopf, R. J. (2004) · Physical Review A · doi:10.1103/physreva.69.062320 · Cited by 2,989
Demonstration of two-qubit algorithms with a superconducting quantum processor
DiCarlo, L., Chow, J. M., Gambetta, J., Bishop, L. S., Johnson, B., Schuster, D., Majer, J., Blais, A., Frunzio, L., Girvin, S. M., et al. (2009) · Nature · doi:10.1038/nature08121 · Cited by 1,189
A programmable two-qubit quantum processor in silicon
Watson, T. F., Philips, S. G. J., Kawakami, E., Ward, D. R., Scarlino, P., Veldhorst, M., Savage, D. E., Lagally, M. G., Friesen, M. G., Coppersmith, S. N., et al. (2018) · Nature · doi:10.1038/nature25766 · Cited by 739
Building logical qubits in a superconducting quantum computing system
Gambetta, J., Chow, J. M., & Steffen, M. (2017) · npj Quantum Information · doi:10.1038/s41534-016-0004-0 · Cited by 680
Self-citationEfficient Z gates for quantum computing
McKay, D. C., Wood, C. J., Sheldon, S., Chow, J. M., & Gambetta, J. (2017) · Physical Review A · doi:10.1103/physreva.96.022330 · Cited by 614
Tunable Coupling Scheme for Implementing High-Fidelity Two-Qubit Gates
Yan, F., Krantz, P., Sung, Y., Kjaergaard, M., Campbell, D. L., Orlando, T. P., Gustavsson, S., & Oliver, W. D. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.054062 · Cited by 423 · cited 2×
“The direct capacitor between Q1 and Q2 adds a positive coupling term gQ1,Q2; thus, the total effective coupling then becomes Jtot ≈ Jbus +gQ1,Q2 [12].”
BackgroundRigetti, C. T., & Devoret, M. (2010) · Physical Review B · doi:10.1103/physrevb.81.134507 · Cited by 368
Realization of High-Fidelity CZ and Z Z -Free iSWAP Gates with a Tunable Coupler
Sung, Y., Ding, L., Braumüller, J., Vepsäläinen, A. P., Kannan, B., Kjærgaard, M., Greene, A., Samach, G., McNally, C., Kim, D. K., et al. (2021) · Physical Review X · doi:10.1103/physrevx.11.021058 · Cited by 342
Demonstrating a Continuous Set of Two-qubit Gates for Near-term Quantum Algorithms
Foxen, B., Neill, C., Dunsworth, A., Roushan, P., Chiaro, B., Megrant, A., Kelly, J., Chen, Z., Satzinger, K. J., Barends, R., et al. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.120504 · Cited by 324
Cited by
Sorted by citations
Evidence for the utility of quantum computing before fault tolerance
Kim, Y., Eddins, A., Anand, S., Wei, K. X., van den Berg, E., Rosenblatt, S., Nayfeh, H., Wu, Y., Zaletel, M., Temme, K., et al. (2023) · Nature · doi:10.1038/s41586-023-06096-3 · Cited by 1,050
High-threshold and low-overhead fault-tolerant quantum memory
Bravyi, S., Cross, A. W., Gambetta, J. M., Maslov, D., Rall, P., & Yoder, T. J. (2024) · Nature · doi:10.1038/s41586-024-07107-7 · Cited by 456
“However, with the tunable coupler [60, 61], which was used in the IBM Quantum Egret and now being developed for the IBM Quantum Heron, this problem no longer exists as the qubits can be designed to be further apart.”
MethodQuantum Computing for High-Energy Physics: State of the Art and Challenges
Meglio, A. D., Jansen, K., Tavernelli, I., Alexandrou, C., Arunachalam, S., Bauer, C., Borras, K., Carrazza, S., Crippa, A., Croft, V. A., et al. (2024) · PRX Quantum · doi:10.1103/prxquantum.5.037001 · Cited by 359
Kandala, A., Wei, K. X., Srinivasan, S. J., Magesan, E., Carnevale, S. D., Keefe, G., Klaus, D., Dial, O., & McKay, D. C. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.130501 · Cited by 164
Self-citationFluxonium: An Alternative Qubit Platform for High-Fidelity Operations
Bao, F., Deng, H., Ding, D., Gao, R., Gao, X., Huang, C., Xun, J., Ku, H., Li, Z., Ma, X., et al. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.010502 · Cited by 158
Metadata
- Authors
- Stehlik, J., Zajac, D. M., Underwood, D. L., Phung, T., Blair, J., Carnevale, S., Klaus, D., Keefe, G. A., Carniol, A., Kumph, M., Steffen, M., & Dial, O. E.
- Affiliations
- IBM (United States) (US)
- IBM Research - Almaden (US)
- ORCID
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2021-08-20
- Volume
- 127
- Issue
- 8
- Pages
- 080505-080505
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W3196141026
- Semantic Scholar
- ff1016f75b3d25e035add6d5fb668b505a37ac64
- Cited by
- 159
- References
- 29
- Citations by year
- 2026: 21 · 2025: 38 · 2024: 45 · 2023: 27 · 2022: 20 · 2021: 7
- FWCI
- 8.71
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- Physical Review Letters (publishedVersion, cc-by)
- PubMed (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Engineering › Electrical and Electronic Engineering › Superconducting and THz Device Technology
- Keywords
- transmon qubits, adiabaticity, gate speed, quantum error correction
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
