The Quantum House Of Cards
arXiv:2312.17570 · doi:10.1073/pnas.2313269120
Abstract
Quantum computers have been proposed to solve a number of important problems such as discovering new drugs, new catalysts for fertilizer production, breaking encryption protocols, optimizing financial portfolios, or implementing new artificial intelligence applications. Yet, to date, a simple task such as multiplying 3 by 5 is beyond existing quantum hardware. This article examines the difficulties that would need to be solved for quantum computers to live up to their promises. I discuss the whole stack of technologies that has been envisioned to build a quantum computer from the top layers (the actual algorithms and associated applications) down to the very bottom ones (the quantum hardware, its control electronics, cryogeny, etc.) while not forgetting the crucial intermediate layer of quantum error correction.
arXiv comment7 pages, 1 figure. Published as a Perspective in PNAS
References in corpus (32)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Mechanics helps in searching for a needle in a haystack
- Surface codes: Towards practical large-scale quantum computation
- The Physical Implementation of Quantum Computation
- Solving the Quantum Many-Body Problem with Artificial Neural Networks
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
- Superconducting Qubits: Current State of Play
- Suppressing quantum errors by scaling a surface code logical qubit
- Elucidating Reaction Mechanisms on Quantum Computers
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Real-time quantum error correction beyond break-even
- Simulation of strongly correlated fermions in two spatial dimensions with fermionic Projected Entangled-Pair States
- Demonstration of fault-tolerant universal quantum gate operations
- Coherent control of single electrons: a review of current progress
- Resolving catastrophic error bursts from cosmic rays in large arrays of superconducting qubits
- Beating the break-even point with a discrete-variable-encoded logical qubit
- The Ground State Electronic Energy of Benzene
- Coexistence of superconductivity with partially filled stripes in the Hubbard model
- Phase transition in Random Circuit Sampling
- A single hole spin with enhanced coherence in natural silicon
- A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
- Assessing requirements to scale to practical quantum advantage
- Quantum Fourier Transform Has Small Entanglement
- Effective quantum volume, fidelity and computational cost of noisy quantum processing experiments
- Two-level system hyperpolarization using a quantum Szilard engine
- Variability of electron and hole spin qubits due to interface roughness and charge traps
- Origin and fate of the pseudogap in the doped Hubbard model
- Operating in a deep underground facility improves the locking of gradiometric fluxonium qubits at the sweet spots
- Better-than-classical Grover search via quantum error detection and suppression
- What determines the ultimate precision of a quantum computer?
Cited by in corpus (5)
- Engineering of Anyons on M5-Probes via Flux Quantization
- Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
- Feasibility of performing quantum chemistry calculations on quantum computers
- Limits of Clifford Disentangling in Tensor Network States
- Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques