Optimal scheduling in probabilistic imaginary-time evolution on a quantum computer

Abstract

Ground-state preparation is an important task in quantum computation. The probabilistic imaginary-time evolution (PITE) method is a promising candidate for preparing the ground state of the Hamiltonian, which comprises a single ancilla qubit and forward- and backward-controlled real-time evolution operators. The ground state preparation is a challenging task even in the quantum computation, classified as complexity-class quantum Merlin-Arthur. However, optimal parameters for PITE could potentially enhance the computational efficiency to a certain degree. In this study, we analyze the computational costs of the PITE method for both linear and exponential scheduling of the imaginary-time step size for reducing the computational cost. First, we analytically discuss an error defined as the closeness between the states acted on by exact and approximate imaginary-time evolution operators. The optimal imaginary-time step size and rate of change of imaginary time are also discussed. Subsequently, the analytical discussion is validated using numerical simulations for a one-dimensional Heisenberg chain. From the results, we find that linear scheduling works well in the case of unknown eigenvalues of the Hamiltonian. For a wide range of eigenstates, the linear scheduling returns smaller errors on average. However, the linearity of the scheduling causes problems for some specific energy regions of eigenstates. To avoid these problems, incorporating a certain level of nonlinearity into the scheduling, such as by inclusion of an exponential character, is preferable for reducing the computational costs of the PITE method. The findings of this study can make a significant contribute to the field of ground-state preparation of many-body Hamiltonians on quantum computers.

arXiv comment16 pages, 9 figures

References in corpus (38)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Coherent control of macroscopic quantum states in a single-Cooper-pair box
• A Quantum Engineer's Guide to Superconducting Qubits
• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Error mitigation for short-depth quantum circuits
• Trapped-Ion Quantum Computing: Progress and Challenges
• Suppressing quantum errors by scaling a surface code logical qubit
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Quantum algorithms for quantum chemistry and quantum materials science
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Variational ansatz-based quantum simulation of imaginary time evolution
• Practical Quantum Error Mitigation for Near-Future Applications
• Hybrid quantum-classical algorithms and quantum error mitigation
• A Theory of Trotter Error
• Theory of variational quantum simulation
• Polynomial-time quantum algorithm for the simulation of chemical dynamics
• Efficient Simulation of Quantum Systems by Quantum Computers
• Low Depth Quantum Simulation of Electronic Structure
• 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
• Exponential Error Suppression for Near-Term Quantum Devices
• Preparing ground states of quantum many-body systems on a quantum computer
• Quantum Power Method by a Superposition of Time-Evolved States
• Rodeo Algorithm for Quantum Computing
• Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
• A randomized quantum algorithm for statistical phase estimation
• Non-adiabatic molecular quantum dynamics with quantum computers
• Bounding the costs of quantum simulation of many-body physics in real space
• Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
• Projection algorithm for state preparation on quantum computers
• State Preparation Boosters for Early Fault-Tolerant Quantum Computation
• First-quantized eigensolver for ground and excited states of electrons under a uniform magnetic field

Cited by in corpus (6)

• Exhaustive search for optimal molecular geometries using imaginary-time evolution on a quantum computer
• Noise-Robust Detection of Quantum Phase Transitions
• First-quantized adiabatic time evolution for the ground state of a many-electron system and the optimal nuclear configuration
• Encoded probabilistic imaginary-time evolution on a trapped-ion quantum computer for ground and excited states of spin qubits
• Probabilistic imaginary-time evolution in state-vector-based and shot-based simulations and on quantum devices
• Accelerated spin-adapted ground state preparation with non-variational quantum algorithms