Forecasting timelines of quantum computing
Jaime Sevilla, C. Jess Riedel

TL;DR
This paper forecasts quantum computing progress by analyzing system data, modeling future improvements, and estimating timelines for fault-tolerant and RSA-2048 factoring capabilities.
Contribution
It introduces a dataset of quantum systems, defines a generalized logical qubit metric, and applies regression models to predict future quantum computing milestones.
Findings
Fault-tolerant quantum computing unlikely before 2026
RSA-2048 factoring unlikely before 2039
Progress may accelerate if current exponential trends continue
Abstract
We consider how to forecast progress in the domain of quantum computing. For this purpose we collect a dataset of quantum computer systems to date, scored on their physical qubits and gate error rate, and we define an index combining both metrics, the generalized logical qubit. We study the relationship between physical qubits and gate error rate, and tentatively conclude that they are positively correlated (albeit with some room for doubt), indicating a frontier of development that trades-off between them. We also apply a log-linear regression on the metrics to provide a tentative upper bound on how much progress can be expected over time. Within the (generally optimistic) assumptions of our model, including the key assumption that exponential progress in qubit count and gate fidelity will continue, we estimate that that proof-of-concept fault-tolerant computation based on…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Mechanics and Applications · Quantum Information and Cryptography
