Solid-State Qubits: 3D Integration and Packaging
Open accessThe DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
Quantum processing has the potential to transform the computing landscape by enabling efficient solutions to problems that are intractable using classical processors. The field was sparked by a suggestion from physicist Richard Feynman in 1981 that a controllable quantum system can be used to simulate other quantum systems, such as the energy band structure of complex materials or the chemical reaction rates of intricate molecules. In the 1990s, interest in quantum computing grew rapidly with the introduction of the first quantum "killer app"-the potential of a large-scale quantum processor to break certain types of public encryption schemes [1]. Recently, there has been growing consensus that myriad other fields besides data security could be impacted by the development of a quantum processor, including machine learning [2], many optimization problems [3], and Feynman's original idea of the simulation of materials properties [4]. In recent years, the field has progressed rapidly, but many technical challenges must be overcome before a large-scale quantum processor can be built. This article focuses on the development of packaging for solid-state qubits and the use of 3D integration to address this challenge.
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
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
Surface codes: Towards practical large-scale quantum computation
Fowler, A. G., Mariantoni, M., Martinis, J. M., & Cleland, A. N. (2012) · Physical Review A · doi:10.1103/physreva.86.032324 · Cited by 3,059 · cited 2×
“This threshold depends on the specific error-correcting code, but the most lenient thresholds are approximately 1% [19].”
BackgroundSuperconducting 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 · cited 1×
“The field has already reached this level, with >99.9% fidelities for single-qubit logic gates and >99% for two-qubit gates [20].”
BackgroundInfluentialSuperconducting Qubits: Current State of Play
Kjaergaard, M., Schwartz, M. E., Braumüller, J., Krantz, P., Wang, J. I.-J., Gustavsson, S., & Oliver, W. D. (2020) · Annual Review of Condensed Matter Physics · doi:10.1146/annurev-conmatphys-031119-050605 · Cited by 1,544 · cited 1×
“This article focuses on solid-state qubits, such as those formed by an electron spin [6] or a superconducting circuit [7], [8].”
BackgroundSelf-citationDecoherence in Josephson Qubits from Dielectric Loss
Martinis, J. M., Cooper, K. B., McDermott, R., Steffen, M., Ansmann, M., Osborn, K. D., Cicak, K., Oh, S., Pappas, D. P., Simmonds, R. W., et al. (2005) · Physical Review Letters · doi:10.1103/physrevlett.95.210503 · Cited by 838
Validating quantum computers using randomized model circuits
Cross, A. W., Bishop, L. S., Sheldon, S., Nation, P. D., & Gambetta, J. M. (2019) · Physical Review A · doi:10.1103/physreva.100.032328 · Cited by 704
Cited by
Materials challenges and opportunities for quantum computing hardware
de Leon, N. P., Itoh, K. M., Kim, D., Mehta, K. K., Northup, T. E., Paik, H., Palmer, B. S., Samarth, N., Sangtawesin, S., & Steuerman, D. W. (2021) · Science · doi:10.1126/science.abb2823 · Cited by 710
Self-citationThe future of quantum computing with superconducting qubits
Bravyi, S., Dial, O., Gambetta, J. M., Gil, D., & Nazario, Z. (2022) · Journal of Applied Physics · doi:10.1063/5.0082975 · Cited by 334
Building 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
Metadata
- Authors
- Rosenberg, D., Weber, S. J., Conway, D., Yost, D.-R. W., Mallek, J., Calusine, G., Das, R., Kim, D., Schwartz, M. E., Woods, W., Yoder, J. L., & Oliver, W. D.
- Venue
- IEEE Microwave Magazine
- Published
- 2020-08
- Volume
- 21
- Issue
- 8
- Pages
- 72-85
- ISSN
- 1527-3342 (ISSN-L)
- 1557-9581
- OpenAlex
- W3041133694
- Cited by
- 57
- References
- 15
- FWCI
- 2.70
- 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.