Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
arXiv:2404.18878 · doi:10.1103/PhysRevResearch.7.013191
Abstract
The performance of quantum algorithms for eigenvalue problems, such as computing Hamiltonian spectra, depends strongly on the overlap of the initial wavefunction and the target eigenvector. In a basis of Slater determinants, the representation of energy eigenstates of systems with strongly correlated electrons requires a number of determinants that scales exponentially with . On classical processors, this restricts simulations to systems where is small. Here, we show that quantum computers can efficiently simulate strongly correlated molecular systems by directly encoding the dominant entanglement structure in the form of spin-coupled initial states. This avoids resorting to expensive classical or quantum state preparation heuristics and instead exploits symmetries in the wavefunction. We provide quantum circuits for deterministic preparation of a family of spin eigenfunctions with Slater determinants with depth and local gates. Their use as highly entangled initial states in quantum algorithms reduces the total runtime of quantum phase estimation and related fault-tolerant methods by orders of magnitude. Furthermore, we assess the application of spin-coupled wavefunctions as initial states for several heuristic quantum algorithms, namely the variational quantum eigensolver, adiabatic state preparation, and different versions of quantum subspace diagonalization (QSD) including QSD based on real-time-evolved states. We also propose a novel QSD algorithm that exploits states obtained through adaptive quantum eigensolvers. For all algorithms, we demonstrate that using spin-coupled initial states drastically reduces the quantum resources required to simulate strongly correlated ground and excited states. Our work provides a crucial component for enabling scalable quantum simulation of classically challenging electronic systems.
Miscellaneous edits: expanded the discussion of existing literature and extensions of our work; corrected a typo in Eqn. 4
References in corpus (81)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- The theory of variational hybrid quantum-classical algorithms
- Quantum computational chemistry
- Adiabatic Quantum Computing
- Simulated Quantum Computation of Molecular Energies
- Recent developments in the PySCF program package
- An Area Law for One Dimensional Quantum Systems
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Hamiltonian Simulation by Qubitization
- Quantum algorithms for quantum chemistry and quantum materials science
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Elucidating Reaction Mechanisms on Quantum Computers
- Hartree-Fock on a superconducting qubit quantum computer
- Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
- Synthesis of Quantum Logic Circuits
- Lieb-Robinson bounds and the generation of correlations and topological quantum order
- Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
- Heat-bath Configuration Interaction: An efficient selected CI algorithm inspired by heat-bath sampling
- A Theory of Trotter Error
- Variational Quantum Computation of Excited States
- Robust determination of molecular spectra on a quantum processor
- Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
- Sequential generation of entangled multi-qubit states
- A deterministic alternative to the full configuration interaction quantum Monte Carlo method
- Low-energy spectrum of iron-sulfur clusters directly from many-particle quantum mechanics
- Even more efficient quantum computations of chemistry through tensor hypercontraction
- Halving the cost of quantum addition
- A spin-adapted Density Matrix Renormalization Group algorithm for quantum chemistry
- Quantum computing enhanced computational catalysis
- Is there evidence for exponential quantum advantage in quantum chemistry?
- Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
- Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
- Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
- Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
- Near-optimal ground state preparation
- Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
- 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
- A Non-Orthogonal Variational Quantum Eigensolver
- Efficient synthesis of universal Repeat-Until-Success circuits
- Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
- Qubit-excitation-based adaptive variational quantum eigensolver
- The electronic complexity of the ground-state of the FeMo cofactor of nitrogenase as relevant to quantum simulations
- Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
- Deterministic Preparation of Dicke States
- Hamiltonian Simulation Using Linear Combinations of Unitary Operations
- Efficient quantum circuits for quantum computational chemistry
- Quantum Krylov subspace algorithms for ground and excited state energy estimation
- Electronic landscape of the P-cluster of nitrogenase as revealed through many-electron quantum wavefunctions
- Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
- Quantum Power Method by a Superposition of Time-Evolved States
- Preparation of matrix product states with log-depth quantum circuits
- Efficient Formulation of Full Configuration Interaction Quantum Monte Carlo in a Spin Eigenbasis via the Graphical Unitary Group Approach
- Real time evolution for ultracompact Hamiltonian eigenstates on quantum hardware
- Adiabatic state preparation study of methylene
- Preparation of Dicke States in an Ion Chain
- Exact and efficient Lanczos method on a quantum computer
- Trading T gates for dirty qubits in state preparation and unitary synthesis
- A theory of quantum subspace diagonalization
- Operational determination of multi-qubit entanglement classes via tuning of local operations
- Resource Estimation for Quantum Variational Simulations of the Hubbard Model
- A Divide-and-Conquer Approach to Dicke State Preparation
- Initial state preparation for quantum chemistry on quantum computers
- Quantifying the effect of gate errors on variational quantum eigensolvers for quantum chemistry
- Measuring Electron Correlation. The Impact of Symmetry and Orbital Transformations
- Real-Time Krylov Theory for Quantum Computing Algorithms
- Combined unitary and symmetric group approach applied to low-dimensional spin systems
- Challenges in the use of quantum computing hardware-efficient Ansatze in electronic structure theory
- Approximate encoding of quantum states using shallow circuits
- State Preparation Boosters for Early Fault-Tolerant Quantum Computation
- What Can Quantum Information Theory Offer to Quantum Chemistry?
- Quantum circuits for the preparation of spin eigenfunctions on quantum computers
- A stochastic quantum Krylov protocol with double factorized Hamiltonians
- Simulation of adiabatic quantum computing for molecular ground states
- Analysis of quantum Krylov algorithms with errors
- Tailored and Externally Corrected Coupled Cluster with Quantum Inputs
- State preparation of AGP on a quantum computer without number projection
- Exploiting subspace constraints and ab initio variational methods for quantum chemistry