Assessing requirements to scale to practical quantum advantage

Abstract

While quantum computers promise to solve some scientifically and commercially valuable problems thought intractable for classical machines, delivering on this promise will require a large-scale quantum machine. Understanding the impact of architecture design choices for a scaled quantum stack for specific applications, prior to full realization of the quantum system, is an important open challenge. To this end, we develop a framework for quantum resource estimation, abstracting the layers of the stack, to estimate resources required across these layers for large-scale quantum applications. Using a tool that implements this framework, we assess three scaled quantum applications and find that hundreds of thousands to millions of physical qubits are needed to achieve practical quantum advantage. We identify three qubit parameters, namely size, speed, and controllability, that are critical at scale to rendering these applications practical. A goal of our work is to accelerate progress towards practical quantum advantage by enabling the broader community to explore design choices across the stack, from algorithms to qubits.

Cited by in corpus (19)

• Hunting for quantum-classical crossover in condensed matter problems
• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• An Expressive Ansatz for Low-Depth Quantum Approximate Optimisation
• Shorter quantum circuits via single-qubit gate approximation
• Predicting Good Quantum Circuit Compilation Options
• All-optical single-shot readout of a superconducting qubit
• Bounds to electron spin qubit variability for scalable CMOS architectures
• Rapid cryogenic characterisation of 1024 integrated silicon quantum dots
• The Quantum House Of Cards
• Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation
• Grover-QAOA for 3-SAT: Quadratic Speedup, Fair-Sampling, and Parameter Clustering
• Teaching Quantum Computing using Microsoft Quantum Development Kit and Azure Quantum
• Synchronization for Fault-Tolerant Quantum Computers
• Resource Estimation of Quantum Multiplication Algorithms
• Quantum resource estimates for computing binary elliptic curve discrete logarithms
• Averting multi-qubit burst errors in surface code magic state factories
• Type-Based Verification of Connectivity Constraints in Lattice Surgery
• Managing Classical Processing Requirements for Quantum Error Correction
• Circuit-level fault tolerance of cat codes