Quantum simulation of exact electron dynamics can be more efficient than classical mean-field methods

Abstract

Quantum algorithms for simulating electronic ground states are slower than popular classical mean-field algorithms such as Hartree-Fock and density functional theory, but offer higher accuracy. Accordingly, quantum computers have been predominantly regarded as competitors to only the most accurate and costly classical methods for treating electron correlation. However, here we tighten bounds showing that certain first quantized quantum algorithms enable exact time evolution of electronic systems with exponentially less space and polynomially fewer operations in basis set size than conventional real-time time-dependent Hartree-Fock and density functional theory. Although the need to sample observables in the quantum algorithm reduces the speedup, we show that one can estimate all elements of the $k$-particle reduced density matrix with a number of samples scaling only polylogarithmically in basis set size. We also introduce a more efficient quantum algorithm for first quantized mean-field state preparation that is likely cheaper than the cost of time evolution. We conclude that quantum speedup is most pronounced for finite temperature simulations and suggest several practically important electron dynamics problems with potential quantum advantage.

31 pages, 2 tables, 1 figure

References in corpus (9)

• Simulated Quantum Computation of Molecular Energies
• Quantum random access memory
• Synthesis of Quantum Logic Circuits
• Nearsightedness of Electronic Matter
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Linear Scaling Density Matrix Real Time TDDFT: Propagator Unitarity \& Matrix Truncation

Cited by in corpus (18)

• Drug design on quantum computers
• Quantum computation of stopping power for inertial fusion target design
• Group-theoretic error mitigation enabled by classical shadows and symmetries
• Multiscale Embedding for Quantum Computing
• A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits
• Inferring interpretable dynamical generators of local quantum observables from projective measurements through machine learning
• Exponential learning advantages with conjugate states and minimal quantum memory
• A Simple and Efficient Joint Measurement Strategy for Estimating Fermionic Observables and Hamiltonians
• Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• Low Depth Phase Oracle Using a Parallel Piecewise Circuit
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers
• On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials
• Optimizing Quantum Chemistry Simulations with a Hybrid Quantization Scheme
• Calculating potential energy surfaces with quantum computers by measuring only the density along adiabatic transitions
• Quantum Simulation of Nuclear Dynamics in First Quantization
• Comprehensive Study on Heisenberg-limited Quantum Algorithms for Multiple Observables Estimation
• Fast collisional $\sqrt{\mathrm{SWAP}}$ gate for fermionic atoms in an optical superlattice