Is there evidence for exponential quantum advantage in quantum chemistry?

Abstract

The idea to use quantum mechanical devices to simulate other quantum systems is commonly ascribed to Feynman. Since the original suggestion, concrete proposals have appeared for simulating molecular and materials chemistry through quantum computation, as a potential ``killer application''. Indications of potential exponential quantum advantage in artificial tasks have increased interest in this application, thus, it is critical to understand the basis for potential exponential quantum advantage in quantum chemistry. Here we gather the evidence for this case in the most common task in quantum chemistry, namely, ground-state energy estimation. We conclude that evidence for such an exponential advantage across chemical space has yet to be found. While quantum computers may still prove useful for quantum chemistry, it may be prudent to assume exponential speedups are not generically available for this problem.

References in corpus (4)

• Simulated Quantum Computation of Molecular Energies
• The Density Matrix Renormalization Group in Chemistry and Molecular Physics: Recent Developments and New Challenges
• Low-energy spectrum of iron-sulfur clusters directly from many-particle quantum mechanics
• Efficient Tree Tensor Network States (TTNS) for Quantum Chemistry: Generalizations of the Density Matrix Renormalization Group Algorithm

Cited by in corpus (126)

• Barren Plateaus in Variational Quantum Computing
• A perspective on the current state-of-the-art of quantum computing for drug discovery applications
• Challenges and Opportunities in Quantum Optimization
• Drug design on quantum computers
• Block2: a comprehensive open source framework to develop and apply state-of-the-art DMRG algorithms in electronic structure and beyond
• Chemistry Beyond the Scale of Exact Diagonalization on a Quantum-Centric Supercomputer
• Benchmarking quantum computers
• Single-ancilla ground state preparation via Lindbladians
• Demonstration of algorithmic quantum speedup
• Nuclear shell-model simulation in digital quantum computers
• Initial state preparation for quantum chemistry on quantum computers
• Block-encoding structured matrices for data input in quantum computing
• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• Measuring Electron Correlation. The Impact of Symmetry and Orbital Transformations
• Ab initio Quantum Simulation of Strongly Correlated Materials with Quantum Embedding
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods
• Seeking a quantum advantage with trapped-ion quantum simulations of condensed-phase chemical dynamics
• Folded Spectrum VQE : A quantum computing method for the calculation of molecular excited states
• Self-healing of Trotter error in digital adiabatic state preparation
• Quantum computation of stopping power for inertial fusion target design
• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Statistical phase estimation and error mitigation on a superconducting quantum processor
• Strong Error Bounds for Trotter & Strang-Splittings and Their Implications for Quantum Chemistry
• Sparse Quantum State Preparation for Strongly Correlated Systems
• Quantum simulation of battery materials using ionic pseudopotentials
• TenCirChem: An Efficient Quantum Computational Chemistry Package for the NISQ Era
• Designing open quantum systems with known steady states: Davies generators and beyond
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• HamLib: A library of Hamiltonians for benchmarking quantum algorithms and hardware
• Multiscale Embedding for Quantum Computing
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Accurate Simulation of the Hubbard Model with Finite Fermionic Projected Entangled Pair States
• Evaluating a quantum-classical quantum Monte Carlo algorithm with Matchgate shadows
• Local minima in quantum systems
• Quantum Simulations of Chemistry in First Quantization with any Basis Set
• Nuclear scattering via quantum computing
• Quantum algorithms for scientific computing
• Unbiasing Fermionic Auxiliary-Field Quantum Monte Carlo with Matrix Product State Trial Wavefunctions
• Sub-system self-consistency in coupled cluster theory
• What Can Quantum Information Theory Offer to Quantum Chemistry?
• Synergetic quantum error mitigation by randomized compiling and zero-noise extrapolation for the variational quantum eigensolver
• Low-depth simulations of fermionic systems on square-grid quantum hardware
• Dissipative Preparation of Many-Body Quantum States: Towards Practical Quantum Advantage
• Contextual Subspace Variational Quantum Eigensolver Calculation of the Dissociation Curve of Molecular Nitrogen on a Superconducting Quantum Computer
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
• Algorithmic Shadow Spectroscopy
• High ground state overlap via quantum embedding methods
• Optimizing the number of measurements for vibrational structure on quantum computers: coordinates and measurement schemes
• Scattering phase shifts from a quantum computer
• Benchmarking quantum gates and circuits
• Dissipative variational quantum algorithms for Gibbs state preparation
• Time Evolution of Uniform Sequential Circuits
• Beyond MP2 initialization for unitary coupled cluster quantum circuits
• A Quantum Computing Implementation of Nuclear-Electronic Orbital (NEO) Theory: Towards an Exact pre-Born-Oppenheimer Formulation of Molecular Quantum Systems
• Measurement-efficient quantum Krylov subspace diagonalisation
• Leveraging Analog Quantum Computing with Neutral Atoms for Solvent Configuration Prediction in Drug Discovery
• Solving an Industrially Relevant Quantum Chemistry Problem on Quantum Hardware
• Circuit Complexity through phase transitions: consequences in quantum state preparation
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Programmable adiabatic demagnetization for systems with trivial and topological excitations
• On proving the robustness of algorithms for early fault-tolerant quantum computers
• Workflow for practical quantum chemical calculations with quantum phase estimation algorithm: electronic ground and π-π* excited states of benzene and its derivatives†
• Coupled-cluster theory for strong entanglement in nuclei
• Towards Efficient Quantum Computing for Quantum Chemistry: Reducing Circuit Complexity with Transcorrelated and Adaptive Ansatz Techniques
• The Coming Decades of Quantum Simulation
• Accelerating quantum imaginary-time evolution with random measurements
• Tensor Network Computations That Capture Strict Variationality, Volume Law Behavior, and the Efficient Representation of Neural Network States
• Stabilizer ground states for simulating quantum many-body physics: theory, algorithms, and applications
• More quantum chemistry with fewer qubits
• Random insights into the complexity of two-dimensional tensor network calculations
• Quantum Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set
• Entanglement engineering of optomechanical systems by reinforcement learning
• Practicality of quantum adiabatic algorithm for chemistry applications
• Projective Quantum Phase Difference Estimation Algorithm for the Direct Computation of Eigenenergy Gaps on a Quantum Computer
• Efficient ground-state energy estimation and certification on early fault-tolerant quantum computers
• Size-consistency and orbital-invariance issues revealed by VQE-UCCSD calculations with the FMO scheme
• Subspace-Search Quantum Imaginary Time Evolution for Excited State Computations
• Fermionic tensor network contraction for arbitrary geometries
• Randomized semi-quantum matrix processing
• Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models
• Shallow quantum circuits for efficient preparation of Slater determinants and correlated states on a quantum computer
• Quantum Algorithm for Vibronic Dynamics: Case Study on Singlet Fission Solar Cell Design
• Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search
• Molecular Properties from Quantum Krylov Subspace Diagonalization
• Emergent Quantum Mechanics at the Boundary of a Local Classical Lattice Model
• The Role of Quantum Computing in Advancing Scientific High-Performance Computing: A perspective from the ADAC Institute
• Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization
• Error mitigation and circuit division for early fault-tolerant quantum phase estimation
• Extending Quantum Computing through Subspace, Embedding and Classical Molecular Dynamics Techniques
• Harnessing Quantum Computing for Energy Materials: Opportunities and Challenges
• Efficient Quantum Simulation of Non-Adiabatic Molecular Dynamics with Precise Electronic Structure
• Unification of Finite Symmetries in Simulation of Many-body Systems on Quantum Computers
• Hamiltonian Forging of a Thermofield Double
• The Electronic Structure of the Hydrogen Molecule: A Tutorial Exercise in Classical and Quantum Computation
• Fault-tolerant quantum simulation of generalized Hubbard models
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers
• Integrating Quantum Algorithms Into Classical Frameworks: A Predictor-corrector Approach Using HHL
• Beating the natural Grover bound for low-energy estimation and state preparation
• A Quantum Information Perspective on Many-Body Dispersive Forces
• A recipe for local simulation of strongly-correlated fermionic matter on quantum computers: the 2D Fermi-Hubbard model
• Tomography-assisted noisy quantum circuit simulator using matrix product density operators
• Practical limitations of quantum data propagation on noisy quantum processors
• Effective temperature in approximate quantum many-body states
• Phase estimation with partially randomized time evolution
• Exponential distillation of dominant eigenproperties
• Toward scalable quantum computations of atomic nuclei
• Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
• Feasibility of performing quantum chemistry calculations on quantum computers
• Quantum Simulations of Chemical Reactions: Achieving Accuracy with NISQ Devices
• Learning the closest product state
• Calculating potential energy surfaces with quantum computers by measuring only the density along adiabatic transitions
• OnionVQE Optimization Strategy for Ground State Preparation on NISQ Devices
• Quantum algorithm for solving generalized eigenvalue problems with application to the Schrödinger equation
• Subsampling Factorization Machine Annealing
• Adiabatic state preparation from general initial states
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
• Dissipative ground state preparation in ab initio electronic structure theory
• Determining Molecular Ground State with Quantum Imaginary Time Evolution using Broken-Symmetry Wave Function
• Optimizing Unitary Coupled Cluster Wave Functions on Quantum Hardware: Error Bound and Resource-Efficient Optimizer
• Data Efficient Prediction of excited-state properties using Quantum Neural Networks
• Nonadiabatic Self-Healing of Trotter Errors in Digitized Counterdiabatic Dynamics
• Energy Spectra of Compressed Quantum States
• Noise-resilient and resource-efficient hybrid algorithm for robust quantum gap estimation
• A quantum eigenvalue solver based on tensor networks