Forecasting timelines of quantum computing

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 superconductor technology is unlikely (<5% confidence) to be exhibited before 2026, and that quantum devices capable of factoring RSA-2048 are unlikely (<5% confidence) to exist before 2039. It is of course possible that these milestones will in fact be reached earlier, but that this would require faster progress than has yet been seen.

References in corpus (22)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Surface codes: Towards practical large-scale quantum computation
• Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
• Scalable multi-particle entanglement of trapped ions
• Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
• A Two Qubit Logic Gate in Silicon
• State preservation by repetitive error detection in a superconducting quantum circuit
• Demonstration of a small programmable quantum computer with atomic qubits
• Validating quantum computers using randomized model circuits
• Quantum Annealing and Analog Quantum Computation
• Benchmarking an 11-qubit quantum computer
• Procedure for systematically tuning up crosstalk in the cross resonance gate
• Digitized adiabatic quantum computing with a superconducting circuit
• 10-qubit entanglement and parallel logic operations with a superconducting circuit
• Complete universal quantum gate set approaching fault-tolerant thresholds with superconducting qubits
• Observation of Entangled States of a Fully Controlled 20-Qubit System
• Observation of topological phenomena in a programmable lattice of 1,800 qubits
• Demonstration of Universal Parametric Entangling Gates on a Multi-Qubit Lattice
• How predictable is technological progress?
• On the impact of quantum computing technology on future developments in high-performance scientific computing
• Quantum Computing: Pro and Con
• Investigating the Performance of an Adiabatic Quantum Optimization Processor

Cited by in corpus (12)

• Testing platform-independent quantum error mitigation on noisy quantum computers
• Towards Cosmological Simulations of Dark Matter on Quantum Computers
• Making existing software quantum safe: a case study on IBM Db2
• The prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer
• Using Quantum Computers to Speed Up Dynamic Testing of Software
• Deploying hybrid quantum-secured infrastructure for applications: When quantum and post-quantum can work together
• The Present and Future of Discrete Logarithm Problems on Noisy Quantum Computers
• Faster variational quantum algorithms with quantum kernel-based surrogate models
• Modeling Short-Range Microwave Networks to Scale Superconducting Quantum Computation
• A quantum computing concept for 1-D elastic wave simulation with exponential speedup
• Pitfalls of the sublinear QAOA-based factorization algorithm
• Error Analysis of the Variational Quantum Eigensolver Algorithm