Gate count estimates for performing quantum chemistry on small quantum computers

Abstract

As quantum computing technology improves and quantum computers with a small but non-trivial number of N > 100 qubits appear feasible in the near future the question of possible applications of small quantum computers gains importance. One frequently mentioned application is Feynman's original proposal of simulating quantum systems, and in particular the electronic structure of molecules and materials. In this paper, we analyze the computational requirements for one of the standard algorithms to perform quantum chemistry on a quantum computer. We focus on the quantum resources required to find the ground state of a molecule twice as large as what current classical computers can solve exactly. We find that while such a problem requires about a ten-fold increase in the number of qubits over current technology, the required increase in the number of gates that can be coherently executed is many orders of magnitude larger. This suggests that for quantum computation to become useful for quantum chemistry problems, drastic algorithmic improvements will be needed.

15 pages, 8 figures, 3 tables. Added references and clarified key aspects. Accepted for publication in Physical Review A

References in corpus (12)

• Non-Abelian Anyons and Topological Quantum Computation
• Simulated Quantum Computation of Molecular Energies
• 14-qubit entanglement: creation and coherence
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Simulating chemistry using quantum computers
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Numerical-Diagonalization Study of Spin Gap Issue of the Kagome Lattice Heisenberg Antiferromagnet
• Complete-Graph Tensor Network States: A New Fermionic Wave Function Ansatz for Molecules
• Simulating sparse Hamiltonians with star decompositions
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• Universal Programmable Quantum Circuit Schemes to Emulate an Operator
• Efficient quantum simulation of fermionic and bosonic models in trapped ions

Cited by in corpus (187)

• The theory of variational hybrid quantum-classical algorithms
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Majorana Zero Modes and Topological Quantum Computation
• Quantum algorithms: an overview
• Hamiltonian Simulation by Qubitization
• Scalable Quantum Simulation of Molecular Energies
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Efficient variational quantum simulator incorporating active error minimisation
• Quantum optimization using variational algorithms on near-term quantum devices
• Interfacing spin qubits in quantum dots and donors - hot, dense and coherent
• Toward the first quantum simulation with quantum speedup
• A Theory of Trotter Error
• Robust determination of molecular spectra on a quantum processor
• Quantum chemistry calculations on a trapped-ion quantum simulator
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• A compact ion-trap quantum computing demonstrator
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Qubits made by advanced semiconductor manufacturing
• A random compiler for fast Hamiltonian simulation
• Quantum simulation and computing with Rydberg-interacting qubits
• Quantum Computation of Electronic Transitions using a Variational Quantum Eigensolver
• Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Solving strongly correlated electron models on a quantum computer
• Low Depth Quantum Simulation of Electronic Structure
• Hybrid quantum-classical approach to correlated materials
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Quantum memories at finite temperature
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Local and Distributed Quantum Computation
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Adiabatic Quantum Simulation of Quantum Chemistry
• Strategies for solving the Fermi-Hubbard model on near-term quantum computers
• Nearly optimal lattice simulation by product formulas
• Standard Model Physics and the Digital Quantum Revolution: Thoughts about the Interface
• Leakage reduction in fast superconducting qubit gates via optimal control
• Faster quantum simulation by randomization
• Increasing the representation accuracy of quantum simulations of chemistry without extra quantum resources
• Digitization of Scalar Fields for Quantum Computing
• A Software Methodology for Compiling Quantum Programs
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Performing Quantum Computing Experiments in the Cloud
• Quantum Algorithms for Simulating the Lattice Schwinger Model
• Analog quantum chemistry simulation
• Probing single electrons across 300 mm spin qubit wafers
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization
• Universal transversal gates with color codes - a simplified approach
• Gate-efficient simulation of molecular eigenstates on a quantum computer
• Statistical Assertions for Validating Patterns and Finding Bugs in Quantum Programs
• Exploiting locality in quantum computation for quantum chemistry
• Reducing qubit requirements for quantum simulation using molecular point group symmetries
• The impact of classical control electronics on qubit fidelity
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Quantum Software Engineering: Landscapes and Horizons
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• Error-Mitigated Quantum Gates Exceeding Physical Fidelities in a Trapped-Ion System
• A Jastrow-type decomposition in quantum chemistry for low-depth quantum circuits
• Fast multi-qubit gates by adiabatic evolution in interacting excited state manifolds
• Quantum Computing for Neutrino-nucleus Scattering
• Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
• Hamiltonian simulation in the low-energy subspace
• Exponentially More Precise Quantum Simulation of Fermions in the Configuration Interaction Representation
• Minimizing State Preparations in Variational Quantum Eigensolver by Partitioning into Commuting Families
• Hamiltonian Simulation with Optimal Sample Complexity
• Early fault-tolerant simulations of the Hubbard model
• Entanglement spectroscopy on a quantum computer
• How will quantum computers provide an industrially relevant computational advantage in quantum chemistry?
• Applying quantum algorithms to constraint satisfaction problems
• Bounding the costs of quantum simulation of many-body physics in real space
• Variational Quantum-Neural Hybrid Eigensolver
• Nearly tight Trotterization of interacting electrons
• Quantum codes for quantum simulation of Fermions on a square lattice of qubits
• Quantum inverse iteration algorithm for programmable quantum simulators
• Experimental test of non-macrorealistic cat-states in the cloud
• Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer
• Compilation by stochastic Hamiltonian sparsification
• Bounds in Nonequilibrium Quantum Dynamics
• Hamiltonian simulation with random inputs
• Dynamical mean field theory algorithm and experiment on quantum computers
• Floquet quantum simulation with superconducting qubits
• Non-unitary operations for ground-state calculations in near term quantum computers
• Reducing the quantum computing overhead with complex gate distillation
• First-Order Trotter Error from a Second-Order Perspective
• Quantum computing methods for electronic states of the water molecule
• A Trotter-Suzuki approximation for Lie groups with applications to Hamiltonian simulation
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
• Quantum Computation for Periodic Solids in Second Quantization
• Well-conditioned multi-product formulas for hardware-friendly Hamiltonian simulation
• Hardware-efficient quantum algorithm for the simulation of open-system dynamics and thermalisation
• Resource-Optimized Fermionic Local-Hamiltonian Simulation on Quantum Computer for Quantum Chemistry
• Linear and logarithmic time compositions of quantum many-body operators
• Quantum simulation of real-space dynamics
• Scalable arrays of micro-Penning traps for quantum computing and simulation
• Quantum Computation of Reactions on Surfaces Using Local Embedding
• Error-resilient Monte Carlo quantum simulation of imaginary time
• Resource estimate for quantum many-body ground-state preparation on a quantum computer
• Liouvillian Dynamics of the Open Schwinger Model: String Breaking and Kinetic Dissipation in a Thermal Medium
• Strong Error Bounds for Trotter & Strang-Splittings and Their Implications for Quantum Chemistry
• Reinforcement learning for semi-autonomous approximate quantum eigensolver
• QDB: From Quantum Algorithms Towards Correct Quantum Programs
• Optimal Trotterization in universal quantum simulators under faulty control
• Magic-State Functional Units: Mapping and Scheduling Multi-Level Distillation Circuits for Fault-Tolerant Quantum Architectures
• Emulating Molecular Orbitals and Electronic Dynamics with Ultracold Atoms
• The Basics of Quantum Computing for Chemists
• Composite Quantum Simulations
• Exponential improvements in the simulation of lattice gauge theories using near-optimal techniques
• Tailoring Term Truncations for Electronic Structure Calculations Using a Linear Combination of Unitaries
• Importance sampling for stochastic quantum simulations
• Exploiting fermion number in factorized decompositions of the electronic structure Hamiltonian
• Hierarchical Clifford transformations to reduce entanglement in quantum chemistry wavefunctions
• Hardware-efficient fermionic simulation with a cavity-QED system
• Synthesizing efficient circuits for Hamiltonian simulation
• Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
• Post-Hartree-Fock method in Quantum Chemistry for Quantum Computer
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Fault-tolerant fermionic quantum computation based on color code
• Quantum algorithms for scientific computing
• What the foundations of quantum computer science teach us about chemistry
• Development of Zero-Noise Extrapolated Projection Based Quantum Algorithm for Accurate Evaluation of Molecular Energetics in Noisy Quantum Devices
• Double-bracket quantum algorithms for diagonalization
• Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation
• A stabilizer framework for Contextual Subspace VQE and the noncontextual projection ansatz
• Measurement-Based Time Evolution for Quantum Simulation of Fermionic Systems
• Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
• Single-electron occupation in quantum dot arrays at selectable plunger gate voltage
• Doubling the order of approximation via the randomized product formula
• Density functionals and Kohn-Sham potentials with minimal wavefunction preparations on a quantum computer
• Constant depth fault-tolerant Clifford circuits for multi-qubit large block codes
• The Promise of Quantum Simulation
• From Ansätze to Z-gates: a NASA View of Quantum Computing
• Engineering autonomous error correction in stabilizer codes at finite temperature
• Resource estimations for the Hamiltonian simulation in correlated electron materials
• Analyzing many-body localization with a quantum computer
• Fast quantum simulation of electronic structure by spectrum amplification
• Solving reaction dynamics with quantum computing algorithms
• Simulating time evolution on distributed quantum computers
• Analysis of Superfast Encoding Performance for Electronic Structure Simulations
• Engineering analog quantum chemistry Hamiltonians using cold atoms in optical lattices
• Calculation of core-excited and core-ionized states using variational quantum deflation method and applications to photocatalyst modelling
• Digital quantum simulation of the BCS model with a central-spin-like quantum processor
• Scalable evaluation of quantum-circuit error loss using Clifford sampling
• Polynomial Equivalence of Complexity Geometries
• Exploiting anticommutation in Hamiltonian simulation
• A Comprehensive Cross-Model Framework for Benchmarking the Performance of Quantum Hamiltonian Simulations
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Quantum technologies for climate change: Preliminary assessment
• Quantum simulation costs for Suzuki-Trotter decomposition of quantum many-body lattice models
• Ab initio extended Hubbard model of short polyenes for efficient quantum computing
• Error-mitigated deep-circuit quantum simulation of open systems: steady state and relaxation rate problems
• Digital Quantum Simulation, Learning of the Floquet Hamiltonian, and Quantum Chaos of the Kicked Top
• Recipes for the Digital Quantum Simulation of Lattice Spin Systems
• General, efficient, and robust Hamiltonian engineering
• Managing approximation errors in quantum programs
• A Generalized Circuit for the Hamiltonian Dynamics Through the Truncated Series
• Quantum simulation by qubitization without Toffoli gates
• The role of master clock stability in scalable quantum information processing
• Learning from physics experiments, with quantum computers: Applications in muon spectroscopy
• Optimize quantum simulation using a force-gradient integrator
• A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations
• Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm
• Holonomic quantum manipulation in the Weyl Disk
• Analyzing the spectral density of a perturbed analog quantum simulator using Keldysh formalism
• Density Matrix Embedding Theory and Strongly Correlated Lattice Systems
• The local detection method: Dynamical detection of quantum discord with local operations
• HybridQ: A Hybrid Simulator for Quantum Circuits
• A measurement driven analog of adiabatic quantum computation for frustration-free Hamiltonians
• Discontinuous Galerkin discretization for quantum simulation of chemistry
• The impacts of optimization algorithm and basis size on the accuracy and efficiency of variational quantum eigensolver
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Simulating the Fermi-Hubbard model with long-range hopping on a quantum computer
• Quantum-computing within a bosonic context: Assessing finite basis effects on prototypical vibrational Hamiltonian spectra
• Phase estimation with partially randomized time evolution
• Efficient quantum simulation of fermionic and bosonic models in trapped ions
• Adaptive random compiler for Hamiltonian simulation
• Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
• Fluctuation-guided adaptive random compiler for Hamiltonian simulation
• Many-Fermion Simulation from the Contracted Quantum Eigensolver without Fermionic Encoding of the Wave Function
• Numerical investigation of the quantum inverse algorithm on small molecules
• Optimizing Unitary Coupled Cluster Wave Functions on Quantum Hardware: Error Bound and Resource-Efficient Optimizer
• Chemistry beyond the Hartree-Fock limit via quantum computed moments
• Quantum Chaos and Universal Trotterisation Behaviours in Digital Quantum Simulations
• Error Interference in Quantum Simulation