Many-Fermion Simulation from the Contracted Quantum Eigensolver without Fermionic Encoding of the Wave Function
arXiv:2205.01725 · doi:10.1103/PhysRevA.105.062424
Abstract
Quantum computers potentially have an exponential advantage over classical computers for the quantum simulation of many-fermion quantum systems. Nonetheless, fermions are more expensive to simulate than bosons due to the fermionic encoding -- a mapping by which the qubits are encoded with fermion statistics. Here we generalize the contracted quantum eigensolver (CQE) to avoid fermionic encoding of the wave function. In contrast to the variational quantum eigensolver, the CQE solves for a many-fermion stationary state by minimizing the contraction (projection) of the Schrödinger equation onto two fermions. We avoid fermionic encoding of the wave function by contracting the Schrödinger equation onto an unencoded pair of particles. Solution of the resulting contracted equation by a series of unencoded two-body exponential transformations generates an unencoded wave function from which the energy and two-fermion reduced density matrix (2-RDM) can be computed. We apply the unencoded and the encoded CQE algorithms to the hydrogen fluoride molecule, the dissociation of oxygen O, and a series of hydrogen chains. Both algorithms show comparable convergence towards the exact ground-state energies and 2-RDMs, but the unencoded algorithm has computational advantages in terms of state preparation and tomography.
References in corpus (31)
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Barren plateaus in quantum neural network training landscapes
- The theory of variational hybrid quantum-classical algorithms
- Quantum computational chemistry
- Predicting Many Properties of a Quantum System from Very Few Measurements
- Fermionic quantum computation
- Hamiltonian Simulation by Qubitization
- Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
- The Bravyi-Kitaev transformation for quantum computation of electronic structure
- Simulation of Electronic Structure Hamiltonians Using Quantum Computers
- Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
- qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
- Gate count estimates for performing quantum chemistry on small quantum computers
- Efficient and Noise Resilient Measurements for Quantum Chemistry on Near-Term Quantum Computers
- Low rank representations for quantum simulation of electronic structure
- Fermionic partial tomography via classical shadows
- Qubit-excitation-based adaptive variational quantum eigensolver
- Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators
- Quantum Solver of Contracted Eigenvalue Equations for Scalable Molecular Simulations on Quantum Computing Devices
- Nearly Optimal Measurement Scheduling for Partial Tomography of Quantum States
- Quantum-optimal-control-inspired ansatz for variational quantum algorithms
- Reduced Density Matrix Sampling: Self-consistent Embedding and Multiscale Electronic Structure on Current Generation Quantum Computers
- Qubits as Parafermions
- Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm
- Resolving Correlated States of Benzyne on a Quantum Computer with an Error-Mitigated Quantum Contracted Eigenvalue Solver
- Quantum-Classical Hybrid Algorithm for the Simulation of All-Electron Correlation
- Preserving Symmetries for Variational Quantum Eigensolvers in the Presence of Noise
- Accurate singlet-triplet gaps in biradicals via the spin averaged anti-Hermitian contracted Schrödinger equation
- Cooper-Pair Condensates with Non-Classical Long-Range Order on Quantum Devices
- Lowering Tomography Costs in Quantum Simulation with a Symmetry Projected Operator Basis