Fast quantum simulation of electronic structure by spectrum amplification

Abstract

The most advanced techniques using fault-tolerant quantum computers to estimate the ground-state energy of a chemical Hamiltonian involve compression of the Coulomb operator through tensor factorizations, enabling efficient block-encodings of the Hamiltonian. A natural challenge of these methods is the degree to which block-encoding costs can be reduced. We address this challenge through the technique of spectrum amplification, which magnifies the spectrum of the low-energy states of Hamiltonians that can be expressed as sums of squares. Spectrum amplification enables estimating ground-state energies with significantly improved cost scaling in the block encoding normalization factor $\Lambda$ to just $\sqrt{2\Lambda E_{\text{gap}}}$, where $E_{\text{gap}}\ll \Lambda$ is the lowest energy of the sum-of-squares Hamiltonian. To achieve this, we show that sum-of-squares representations of the electronic structure Hamiltonian are efficiently computable by a family of classical simulation techniques that approximate the ground-state energy from below. In order to further optimize, we also develop a novel factorization that provides a trade-off between the two leading Coulomb integral factorization schemes -- namely, double factorization and tensor hypercontraction -- that when combined with spectrum amplification yields a factor of 4 to 195 speedup over the state of the art in ground-state energy estimation for models of Iron-Sulfur complexes and a CO${}_2$-fixation catalyst.

References in corpus (28)

• Quantum algorithm for solving linear systems of equations
• Simulated Quantum Computation of Molecular Energies
• Hamiltonian Simulation by Qubitization
• Elucidating Reaction Mechanisms on Quantum Computers
• On the relationship between continuous- and discrete-time quantum walk
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Gate count estimates for performing quantum chemistry on small quantum computers
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Quantum computing enhanced computational catalysis
• Structure of Fermionic Density Matrices: Complete N-representability Conditions
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
• Convergent relaxations of polynomial optimization problems with non-commuting variables
• The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Trading T gates for dirty qubits in state preparation and unitary synthesis
• Spectral Gap Amplification
• Fault-tolerant quantum simulation of materials using Bloch orbitals
• Rapid initial state preparation for the quantum simulation of strongly correlated molecules
• Compatibility of subsystem states and convex geometry
• Reducing the runtime of fault-tolerant quantum simulations in chemistry through symmetry-compressed double factorization
• Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization
• Hamiltonian simulation for low-energy states with optimal time dependence
• Comparison of one-dimensional and quasi-one-dimensional Hubbard models from the variational two-electron reduced-density-matrix method

Cited by in corpus (2)

• Exponential distillation of dominant eigenproperties
• Benchmarking Quantum Simulation of Chemical Hamiltonians using the Sorted-List Encoding