Rapid initial state preparation for the quantum simulation of strongly correlated molecules

Abstract

Studies on quantum algorithms for ground state energy estimation often assume perfect ground state preparation; however, in reality the initial state will have imperfect overlap with the true ground state. Here we address that problem in two ways: by faster preparation of matrix product state (MPS) approximations, and more efficient filtering of the prepared state to find the ground state energy. We show how to achieve unitary synthesis with a Toffoli complexity about $7\times$ lower than that in prior work, and use that to derive a more efficient MPS preparation method. For filtering we present two different approaches: sampling and binary search. For both we use the theory of window functions to avoid large phase errors and minimise the complexity. We find that the binary search approach provides better scaling with the overlap at the cost of a larger constant factor, such that it will be preferred for overlaps less than about $0.003$. Finally, we estimate the total resources to perform ground state energy estimation of Fe-S cluster systems, including the FeMo cofactor by estimating the overlap of different MPS initial states with potential ground-states of the FeMo cofactor using an extrapolation procedure. {With a modest MPS bond dimension of 4000, our procedure produces an estimate of $\sim 0.9$ overlap squared with a candidate ground-state of the FeMo cofactor, producing a total resource estimate of $7.3\times 10^{10}$ Toffoli gates; neglecting the search over candidates and assuming the accuracy of the extrapolation, this validates prior estimates that used perfect ground state overlap. This presents an example of a practical path to prepare states of high overlap in a challenging-to-compute chemical system.

47 pages, 20 figures

References in corpus (38)

• Quantum Amplitude Amplification and Estimation
• Recent developments in the PySCF program package
• Elucidating Reaction Mechanisms on Quantum Computers
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Sequential generation of entangled multi-qubit states
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Halving the cost of quantum addition
• Quantum computing enhanced computational catalysis
• Is there evidence for exponential quantum advantage in quantum chemistry?
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Near-optimal ground state preparation
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• Encoding of Matrix Product States into Quantum Circuits of One- and Two-Qubit Gates
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations
• Block2: a comprehensive open source framework to develop and apply state-of-the-art DMRG algorithms in electronic structure and beyond
• Quantum Algorithm for Spectral Measurement with Lower Gate Count
• Electronic landscape of the P-cluster of nitrogenase as revealed through many-electron quantum wavefunctions
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Early Fault-Tolerant Quantum Computing
• Preparation of matrix product states with log-depth quantum circuits
• Low communication high performance ab initio density matrix renormalization group algorithms
• A randomized quantum algorithm for statistical phase estimation
• The Variational Power of Quantum Circuit Tensor Networks
• Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
• Trading T gates for dirty qubits in state preparation and unitary synthesis
• Quantum algorithm for ground state energy estimation using circuit depth with exponentially improved dependence on precision
• Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
• Initial state preparation for quantum chemistry on quantum computers
• Reducing molecular electronic Hamiltonian simulation cost for Linear Combination of Unitaries approaches
• On low-depth algorithms for quantum phase estimation
• Simultaneous estimation of multiple eigenvalues with short-depth quantum circuit on early fault-tolerant quantum computers
• Analyzing Prospects for Quantum Advantage in Topological Data Analysis
• Fourier Analytic Approach to Phase Estimation
• Quantum Multiple Eigenvalue Gaussian filtered Search: an efficient and versatile quantum phase estimation method
• High ground state overlap via quantum embedding methods
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms

Cited by in corpus (19)

• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Bias-Field Digitized Counterdiabatic Quantum Algorithm for Higher-Order Binary Optimization
• Faster quantum chemistry simulations on a quantum computer with improved tensor factorization and active volume compilation
• Fast quantum simulation of electronic structure by spectrum amplification
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Multireference error mitigation for quantum computation of chemistry
• Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation
• Phase estimation with partially randomized time evolution
• Toward scalable quantum computations of atomic nuclei
• Exponential distillation of dominant eigenproperties
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Chemically Motivated Simulation Problems are Efficiently Solvable by a Quantum Computer
• Feasibility of performing quantum chemistry calculations on quantum computers
• Quantum State Preparation Of Multiconfigurational States For Quantum Chemistry
• Dissipative ground state preparation in ab initio electronic structure theory
• Quantum linear system algorithm with optimal queries to initial state preparation
• Double-bracket quantum algorithms for high-fidelity ground state preparation
• Energy Spectra of Compressed Quantum States
• Quantum phase estimation with optimal confidence interval using three control qubits