Concrete resource analysis of the quantum linear system algorithm used to compute the electromagnetic scattering cross section of a 2D target

Abstract

We provide a detailed estimate for the logical resource requirements of the quantum linear system algorithm (QLSA) [Phys. Rev. Lett. 103, 150502 (2009)] including the recently described elaborations [Phys. Rev. Lett. 110, 250504 (2013)]. Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width, circuit depth, the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the standard set {X, Y, Z, H, S, T, CNOT}. To perform these estimates, we used an approach that combines manual analysis with automated estimates generated via the Quipper quantum programming language and compiler. Our estimates pertain to the example problem size N=332,020,680 beyond which, according to a crude big-O complexity comparison, QLSA is expected to run faster than the best known classical linear-system solving algorithm. For this problem size, a desired calculation accuracy 0.01 requires an approximate circuit width 340 and circuit depth of order $10^{25}$ if oracle costs are excluded, and a circuit width and depth of order $10^8$ and $10^{29}$, respectively, if oracle costs are included, indicating that the commonly ignored oracle resources are considerable. In addition to providing detailed logical resource estimates, it is also the purpose of this paper to demonstrate explicitly how these impressively large numbers arise with an actual circuit implementation of a quantum algorithm. While our estimates may prove to be conservative as more efficient advanced quantum-computation techniques are developed, they nevertheless provide a valid baseline for research targeting a reduction of the resource requirements, implying that a reduction by many orders of magnitude is necessary for the algorithm to become practical.

37 pages, 40 figures

References in corpus (8)

• Quantum algorithm for solving linear systems of equations
• Exponential algorithmic speedup by quantum walk
• Quantum Data Fitting
• Hamiltonian simulation with nearly optimal dependence on all parameters
• Exact synthesis of multiqubit Clifford+T circuits
• Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations
• Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates
• Towards Large-Scale Quantum Computation

Cited by in corpus (32)

• Quantum Machine Learning
• Variational Quantum Algorithms
• Quantum attacks on Bitcoin, and how to protect against them
• A quantum linear system algorithm for dense matrices
• Solving nonlinear differential equations with differentiable quantum circuits
• Realizing Quantum Convolutional Neural Networks on a Superconducting Quantum Processor to Recognize Quantum Phases
• Black-box quantum state preparation without arithmetic
• On applications of quantum computing to plasma simulations
• Quantum Computers for Weather and Climate Prediction: The Good, the Bad and the Noisy
• Optimizing resource efficiencies for scalable full-stack quantum computers
• Optimizing Quantum Circuits for Arithmetic
• Quantum Kernel Methods for Solving Differential Equations
• Hybrid quantum algorithms for flow problems
• Efficient quantum amplitude encoding of polynomial functions
• Quantum algorithms for approximate function loading
• Algorithm for the solution of the Dirac equation on digital quantum computers
• Quantum Computing Methods for Supply Chain Management
• Quantum Signal Processing for simulating cold plasma waves
• A hybrid classical-quantum approach to solve the heat equation using quantum annealers
• Enabling Accuracy-Aware Quantum Compilers using Symbolic Resource Estimation
• Distributed Quantum Computing with QMPI
• Simulation of linear non-Hermitian boundary-value problems with quantum singular value transformation
• Quantum Algorithms for Geologic Fracture Networks
• Formal Methods for Quantum Programs: A Survey
• An Early Investigation of the HHL Quantum Linear Solver for Scientific Applications
• Efficient explicit circuit for quantum state preparation of piecewise continuous functions
• Quantum spatial search with electric potential : long-time dynamics and robustness to noise
• Quantum Technology for Military Applications
• Unconditionally separating noisy ${\mathsf{QNC}}^0$ from bounded polynomial threshold circuits of constant depth
• Quantum linear system algorithm with optimal queries to initial state preparation
• Composability of global phase invariant distance and its application to approximation error management
• Thermodynamic Effects of Single-Qubit Operations in Silicon-Based Quantum Computing