A framework for robust quantum speedups in practical correlated electronic structure and dynamics

2025/08/21 by Chen, Jielun, Chan, Garnet Kin-Lic
#FOS: Physical sciences #Quantum Physics (quant-ph)

paper · doi:10.48550/arxiv.2508.15765

Abstract

Proposed quantum advantage in electronic structure has so far required significant fine-tuning to find problems where classical heuristics fail. We describe how to obtain robust quantum speedups for correlated electronic structure and dynamics precisely in the regime where widely used classical heuristics are most successful.

Citations

• Digital quantum simulations of scattering in quantum field theories using W states
• Faster Quantum Algorithm for Multiple Observables Estimation in Fermionic Problems
• Fast quantum simulation of electronic structure by spectral amplification
• Quantum linear algebra for disordered electrons
• Solving Free Fermion Problems on a Quantum Computer
• Quantum Simulations of Chemistry in First Quantization with any Basis Set
• Shadow Hamiltonian Simulation
• A shortcut to an optimal quantum linear system solver
• Quantum sampling algorithms for quantum state preparation and matrix block-encoding
• Quantum Simulation of Realistic Materials in First Quantization Using Non-local Pseudopotentials
• Linear Scaling Approach for Optical Excitations Using Maximally Localized Wannier Functions
• Randomized adiabatic quantum linear solver algorithm with optimal complexity scaling and detailed running costs
• Exponential Quantum Speedup in Simulating Coupled Classical Oscillators
• On adaptive low-depth quantum algorithms for robust multiple-phase estimation
• Efficient and Error-Resilient Data Access Protocols for a Limited-Sized Quantum Random Access Memory
• Quantum state preparation without coherent arithmetic
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices
• Optimal scaling quantum linear systems solver via discrete adiabatic theorem
• Asymptotically Optimal Circuit Depth for Quantum State Preparation and General Unitary Synthesis
• Discontinuous Galerkin discretization for quantum simulation of chemistry
• Phase estimation with randomized Hamiltonians
• Quantum Algorithms for Quantum Chemistry based on the sparsity of the CI-matrix
• Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations
• Simulated Quantum Computation of Molecular Energies
• Creating superpositions that correspond to efficiently integrable probability distributions

Related

• Exponential quantum speedups in quantum chemistry with linear depth
• Quantum speedup for combinatorial optimization with flat energy landscapes
• Defining and detecting quantum speedup
• Speedup in quantum computation is associated with attenuation of processing probability
• How Much Structure Is Needed for Huge Quantum Speedups?