Rent’s rule and extensibility in quantum computing
Open accessThe DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Abstract
Abstract Quantum computing is on the verge of a transition from fundamental research to practical applications. Yet, to make the step to large-scale quantum computation, an extensible qubit system has to be developed. In classical semiconductor technology, this was made possible by the invention of the integrated circuit, which allowed to interconnect large numbers of components without having to solder to each and every one of them. Similarly, we expect that the scaling of interconnections and control lines with the number of qubits will be a central bottleneck in creating large-scale quantum technology. Here, we define the quantum Rent exponent p to quantify the progress in overcoming this challenge at different levels throughout the quantum computing stack. We further discuss the concept of quantum extensibility as an indicator of a platform’s potential to reach the large quantum volume needed for universal quantum computing and review extensibility limits faced by different qubit implementations on the way towards truly large-scale qubit systems.
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
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
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
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088
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
Linear optical quantum computing with photonic qubits
Kok, P., Munro, W. J., Nemoto, K., Ralph, T. C., Dowling, J. P., & Milburn, G. J. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.135 · Cited by 2,904
The nitrogen-vacancy colour centre in diamond
Doherty, M. W., Manson, N. B., Delaney, P., Jelezko, F., Wrachtrup, J., & Hollenberg, L. C. L. (2013) · Physics Reports · doi:10.1016/j.physrep.2013.02.001 · Cited by 2,866
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
Architecture for a large-scale ion-trap quantum computer
Kielpinski, D., Monroe, C., & Wineland, D. J. (2002) · Nature · doi:10.1038/nature00784 · Cited by 1,589
Quantum error correction for quantum memories
Terhal, B. M. (2015) · Reviews of Modern Physics · doi:10.1103/revmodphys.87.307 · Cited by 1,354
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175
14-Qubit Entanglement: Creation and Coherence
Monz, T., Schindler, P., Barreiro, J. T., Chwalla, M., Nigg, D., Coish, W. A., Harlander, M., Hänsel, W., Hennrich, M., & Blatt, R. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.130506 · Cited by 1,110
Goals and opportunities in quantum simulation
Cirac, J. I., & Zoller, P. (2012) · Nature Physics · doi:10.1038/nphys2275 · Cited by 891
Fault-Tolerant Quantum Computation with High Threshold in Two Dimensions
Raussendorf, R., & Harrington, J. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.190504 · Cited by 812
Scaling the Ion Trap Quantum Processor
Monroe, C., & Kim, J. (2013) · Science · doi:10.1126/science.1231298 · Cited by 786
Quantum optimization using variational algorithms on near-term quantum devices
Moll, N., Barkoutsos, P., Bishop, L. S., Chow, J. M., Cross, A., Egger, D. J., Filipp, S., Fuhrer, A., Gambetta, J. M., Ganzhorn, M., et al. (2018) · Quantum Science and Technology · doi:10.1088/2058-9565/aab822 · Cited by 744
High-fidelity spin entanglement using optimal control
Dolde, F., Bergholm, V., Wang, Y., Jakobi, I., Naydenov, B., Pezzagna, S., Meijer, J., Jelezko, F., Neumann, P., Schulte-Herbrüggen, T., et al. (2014) · Nature Communications · doi:10.1038/ncomms4371 · Cited by 325
Quantum computing and the entanglement frontier
Preskill, J. (2012) · arXiv · doi:10.48550/arxiv.1203.5813 · Cited by 308
Pareto-Efficient Quantum Circuit Simulation Using Tensor Contraction Deferral
Pednault, E., Gunnels, J. A., Nannicini, G., Horesh, L., Magerlein, T., Solomonik, E., Draeger, E. W., Holland, E. T., & Wisnieff, R. (2017) · arXiv · doi:10.48550/arxiv.1710.05867 · Cited by 48
Lanzerotti, M. Y., Fiorenza, G., & Rand, R. A. (2005) · IBM Journal of Research and Development · doi:10.1147/rd.494.0777 · Cited by 47
Cited by
The germanium quantum information route
Scappucci, G., Kloeffel, C., Zwanenburg, F. A., Loss, D., Myronov, M., Zhang, J.-J., De Franceschi, S., Katsaros, G., & Veldhorst, M. (2020) · Nature Reviews Materials · doi:10.1038/s41578-020-00262-z · Cited by 382
Self-citationA Race-Track Trapped-Ion Quantum Processor
Moses, S. A., Baldwin, C. H., Allman, M. S., Ancona, R., Ascarrunz, L., Barnes, C., Bartolotta, J., Bjork, B., Blanchard, P., Bohn, M., et al. (2023) · Physical Review X · doi:10.1103/physrevx.13.041052 · Cited by 391
Universal quantum logic in hot silicon qubits
Petit, L., Eenink, H. G. J., Russ, M., Lawrie, W. I. L., Hendrickx, N. W., Philips, S. G. J., Clarke, J. S., Vandersypen, L. M. K., & Veldhorst, M. (2020) · Nature · doi:10.1038/s41586-020-2170-7 · Cited by 318
Self-citationScaling silicon-based quantum computing using CMOS technology
Gonzalez-Zalba, M. F., de Franceschi, S., Charbon, E., Meunier, T., Vinet, M., & Dzurak, A. S. (2021) · Nature Electronics · doi:10.1038/s41928-021-00681-y · Cited by 272
Shared control of a 16 semiconductor quantum dot crossbar array
Borsoi, F., Hendrickx, N. W., John, V., Meyer, M., Motz, S., van Riggelen, F., Sammak, A., de Snoo, S. L., Scappucci, G., & Veldhorst, M. (2024) · Nature Nanotechnology · doi:10.1038/s41565-023-01491-3 · Cited by 165
Self-citation
Metadata
- Authors
- Franke, D. P., Clarke, J. S., Vandersypen, L. M. K., & Veldhorst, M.
- Venue
- Microprocessors and Microsystems
- Publisher
- Elsevier BV
- Published
- 2019-06
- Volume
- 67
- Pages
- 1-7
- ISSN
- 0141-9331 (ISSN-L)
- OpenAlex
- W2806224692
- Cited by
- 80
- References
- 19
- FWCI
- 4.83
- Type
- journal article
- Language
- en
- Open access
- bronze
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.