Preparation of many-body states for quantum simulation

Abstract

While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum states on a lattice in real space. In particular, the present algorithm is able to prepare general pure and mixed many-particle states of any number of particles. It relies on a procedure for converting from a second-quantized state to its first-quantized counterpart. The algorithm is efficient in that it operates in time that is polynomial in all the essential descriptors of the system, such the number of particles, the resolution of the lattice, and the inverse of the maximum final error. This scaling holds under the assumption that the wavefunction to be prepared is bounded or its indefinite integral known and that the Fock operator of the system is efficiently simulatable.

10 pages, content as in JCP

References in corpus (11)

• Simulated Quantum Computation of Molecular Energies
• Quantum Algorithms Revisited
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Efficient Simulation of Quantum Systems by Quantum Computers
• The problem of equilibration and the computation of correlation functions on a quantum computer
• Quantum circuits with uniformly controlled one-qubit gates
• Calculating the Thermal Rate Constant with Exponential Speed-Up on a Quantum Computer
• Quantum Algorithm for Obtaining the Energy Spectrum of Molecular Systems

Cited by in corpus (32)

• Quantum Simulation
• Quantum computational chemistry
• The Variational Quantum Eigensolver: a review of methods and best practices
• Hybrid Quantum-Classical Hierarchy for Mitigation of Decoherence and Determination of Excited States
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Simulating chemistry using quantum computers
• Preconditioned quantum linear system algorithm
• Adiabatic Quantum Simulation of Quantum Chemistry
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Application of fermionic marginal constraints to hybrid quantum algorithms
• Using Quantum Computers for Quantum Simulation
• Quantum algorithm for simulating the dynamics of an open quantum system
• Linear Response on a Quantum Computer
• Simulating quantum statistics with entangled photons: a continuous transition from bosons to fermions
• Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
• Simulating Quantum Materials with Digital Quantum Computers
• Quantum Algorithm for Molecular Properties and Geometry Optimization
• Entanglement spectroscopy on a quantum computer
• Universal quantum circuits for quantum chemistry
• Minimally-Entangled State Preparation of Localized Wavefunctions on Quantum Computers
• Bounding the costs of quantum simulation of many-body physics in real space
• Quantum computing applied to calculations of molecular energies: CH2 benchmark
• Introduction to Quantum Algorithms for Physics and Chemistry
• Grid-based methods for chemistry simulations on a quantum computer
• Relativistic quantum chemistry on quantum computers
• Spin-free quantum computational simulations and symmetry adapted states
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• Exact stabilization of entangled states in finite time by dissipative quantum circuits
• On quantum algorithms for the Schrödinger equation in the semi-classical regime
• Quantum Simulation of Simple Many-Body Dynamics
• Unification of Finite Symmetries in Simulation of Many-body Systems on Quantum Computers
• Quantum Machine Learning for State Tomography Using Classical Data