Quantum algorithms for generator coordinate methods
arXiv:2212.09205 · doi:10.1103/PhysRevResearch.5.023200
Abstract
This paper discusses quantum algorithms for the generator coordinate method (GCM) that can be used to benchmark molecular systems. The GCM formalism defined by exponential operators with exponents defined through generators of the Fermionic U(N) Lie algebra (Thouless theorem) offers a possibility of probing large sub-spaces using low-depth quantum circuits. In the present studies, we illustrate the performance of the quantum algorithm for constructing a discretized form of the Hill-Wheeler equation for ground and excited state energies. We also generalize the standard GCM formulation to multi-product extension that when collective paths are properly probed, can systematically introduce higher rank effects and provide elementary mechanisms for symmetry purification when generator states break the spatial or spin symmetries. The GCM quantum algorithms also can be viewed as an alternative to existing variational quantum eigensolvers, where multi-step classical optimization algorithms are replaced by a single-step procedure for solving the Hill-Wheeler eigenvalue problem.
References in corpus (49)
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- The theory of variational hybrid quantum-classical algorithms
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum computational chemistry
- Quantum Chemistry in the Age of Quantum Computing
- Quantum Algorithms Revisited
- Predicting Many Properties of a Quantum System from Very Few Measurements
- An adaptive variational algorithm for exact molecular simulations on a quantum computer
- Extending the computational reach of a noisy superconducting quantum processor
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Towards Practical Quantum Variational Algorithms
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Robust determination of molecular spectra on a quantum processor
- On the relationship between continuous- and discrete-time quantum walk
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- Quantum Implementation of Unitary Coupled Cluster for Simulating Molecular Electronic Structure
- Measurement Optimization in the Variational Quantum Eigensolver Using a Minimum Clique Cover
- Quantum computing enhanced computational catalysis
- Projected Hartree-Fock Theory
- A Quantum Computing View on Unitary Coupled Cluster Theory
- Correlations beyond the mean field in Magnesium isotopes: Angular momentum projection and configuration mixing
- Exact Parameterization of Fermionic Wave Functions via Unitary Coupled Cluster Theory
- Matchgates and classical simulation of quantum circuits
- Configuration mixing of angular-momentum projected triaxial relativistic mean-field wave functions
- Efficient estimation of Pauli observables by derandomization
- Is the Trotterized UCCSD Ansatz chemically well-defined?
- Fermionic partial tomography via classical shadows
- A Non-Orthogonal Variational Quantum Eigensolver
- Robust shadow estimation
- Application of fermionic marginal constraints to hybrid quantum algorithms
- Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
- Quantum Algorithm for Spectral Measurement with Lower Gate Count
- Downfolding of many-body Hamiltonians using active-space models: extension of the sub-system embedding sub-algebras approach to unitary coupled cluster formalisms
- Experimental Estimation of Quantum State Properties from Classical Shadows
- State-of-the-art of beyond mean field theories with nuclear density functionals
- Experimental quantum state measurement with classical shadows
- Cartan sub-algebra approach to efficient measurements of quantum observables
- Multi-reference symmetry-projected variational approaches for ground and excited states of the one-dimensional Hubbard model
- Symmetry-projected variational approach for ground and excited states of the two-dimensional Hubbard model
- On the order problem in construction of unitary operators for the Variational Quantum Eigensolver
- Dimensionality reduction of many-body problem using coupled-cluster sub-system flow equations: classical and quantum computing perspective
- Sub-system quantum dynamics using coupled cluster downfolding techniques
- Excited electronic states from a variational approach based on symmetry-projected Hartree--Fock configurations
- Generator coordinate method with a conjugate momentum: application to the particle number projection
- Mapping renormalized coupled cluster methods to quantum computers through a compact unitary representation of non-unitary operators
- Charge transfer excitations from excited state Hartree-Fock subsequent minimization scheme
Cited by in corpus (3)
- A Perspective on Quantum Computing Applications in Quantum Chemistry using 25--100 Logical Qubits
- Unleashed from Constrained Optimization: Quantum Computing for Quantum Chemistry Employing Generator Coordinate Inspired Method
- Exploring fixed points and eigenstates of quantum systems with reinforcement learning