High-performance superconducting quantum processors via laser annealing of transmon qubits
Open accessThe DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Abstract
Scaling the number of qubits while maintaining high-fidelity quantum gates remains a key challenge for quantum computing. Presently, superconducting quantum processors with >50 qubits are actively available. For these systems, fixed-frequency transmons are attractive because of their long coherence and noise immunity. However, scaling fixed-frequency architectures proves challenging because of precise relative frequency requirements. Here, we use laser annealing to selectively tune transmon qubits into desired frequency patterns. Statistics over hundreds of annealed qubits demonstrate an empirical tuning precision of 18.5 MHz, with no measurable impact on qubit coherence. We quantify gate error statistics on a tuned 65-qubit processor, with median two-qubit gate fidelity of 98.7%. Baseline tuning statistics yield a frequency-equivalent resistance precision of 4.7 MHz, sufficient for high-yield scaling beyond 10 3 qubit levels. Moving forward, we anticipate selective laser annealing to play a central role in scaling fixed-frequency architectures.
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
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904
Ladd, T. D., Jelezko, F., Laflamme, R., Nakamura, Y., Monroe, C., & O’Brien, J. L. (2010) · Nature · doi:10.1038/nature08812 · Cited by 3,592
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
Supervised learning with quantum-enhanced feature spaces
Havlíček, V., Córcoles, A. D., Temme, K., Harrow, A. W., Kandala, A., Chow, J. M., & Gambetta, J. M. (2019) · Nature · doi:10.1038/s41586-019-0980-2 · Cited by 2,572
Self-citationTunneling Between Superconductors
Ambegaokar, V., & Baratoff, A. (1963) · Physical Review Letters · doi:10.1103/physrevlett.10.486 · Cited by 2,195
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Quantum computational chemistry
McArdle, S., Endo, S., Aspuru-Guzik, A., Benjamin, S. C., & Yuan, X. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.015003 · Cited by 1,621
Quantum algorithms: an overview
Montanaro, A. (2016) · npj Quantum Information · doi:10.1038/npjqi.2015.23 · Cited by 1,071
Cited by
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
Self-citationUniversal control of a six-qubit quantum processor in silicon
Philips, S. G. J., Mądzik, M. T., Amitonov, S. V., de Snoo, S. L., Russ, M., Kalhor, N., Volk, C., Lawrie, W. I. L., Brousse, D., Tryputen, L., et al. (2022) · Nature · doi:10.1038/s41586-022-05117-x · Cited by 410
Probabilistic error cancellation with sparse Pauli–Lindblad models on noisy quantum processors
van den Berg, E., Minev, Z. K., Kandala, A., & Temme, K. (2023) · Nature Physics · doi:10.1038/s41567-023-02042-2 · Cited by 305
“ΛUρ) = ○ k∈KK (wk K +U1 −wk)Pk K Pk)ρ, (1)”
BackgroundDynamics of superconducting qubit relaxation times
Carroll, M., Rosenblatt, S., Jurcevic, P., Lauer, I., & Kandala, A. (2022) · npj Quantum Information · doi:10.1038/s41534-022-00643-y · Cited by 136
Self-citationBuilding blocks of a flip-chip integrated superconducting quantum processor
Kosen, S., Li, H.-X., Rommel, M., Shiri, D., Warren, C., Grönberg, L., Salonen, J., Abad, T., Biznárová, J., Caputo, M., et al. (2022) · Quantum Science and Technology · doi:10.1088/2058-9565/ac734b · Cited by 88
Mitigation of frequency collisions in superconducting quantum processors
Osman, A., Fernández-Pendás, J., Warren, C., Kosen, S., Scigliuzzo, M., Frisk Kockum, A., Tancredi, G., Fadavi Roudsari, A., & Bylander, J. (2023) · Physical Review Research · doi:10.1103/physrevresearch.5.043001 · Cited by 41
Metadata
- Authors
- Zhang, E. J., Srinivasan, S., Sundaresan, N., Bogorin, D. F., Martin, Y., Hertzberg, J. B., Timmerwilke, J., Pritchett, E. J., Yau, J.-B., Wang, C., Landers, W., Lewandowski, E. P., Narasgond, A., Rosenblatt, S., Keefe, G. A., Lauer, I., Rothwell, M. B., McClure, D. T., Dial, O. E., Orcutt, J. S., Brink, M., & Chow, J. M.
- Venue
- Science Advances
- Published
- 2022-05-13
- Volume
- 8
- Issue
- 19
- Pages
- eabi6690-eabi6690
- ISSN
- 2375-2548 (ISSN-L)
- OpenAlex
- W4280540000
- Cited by
- 83
- References
- 16
- FWCI
- 5.74
- Type
- journal article
- Language
- en
- Open access
- gold
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.