Efficient quantum imaginary time evolution by drifting real time evolution: an approach with low gate and measurement complexity

Abstract

Quantum imaginary time evolution (QITE) is one of the promising candidates for finding eigenvalues and eigenstates of a Hamiltonian. However, the original QITE proposal [Nat. Phys. 16, 205-210 (2020)], which approximates the imaginary time evolution by real time evolution, suffers from large circuit depth and measurements due to the size of the Pauli operator pool and Trotterization. To alleviate the requirement for deep circuits, we propose a time-dependent drifting scheme inspired by the qDRIFT algorithm [Phys. Rev. Lett 123, 070503 (2019)], which randomly draws a Pauli term out of the approximated unitary operation generators of QITE according to the strength and rescales that term by the total strength of the Pauli terms. We show that this drifting scheme removes the depth dependency on size of the operator pool and converges inverse linearly to the number of steps. We further propose a deterministic algorithm that selects the dominant Pauli term to reduce the fluctuation for the ground state preparation. Meanwhile, we introduce an efficient measurement reduction scheme across Trotter steps, which removes its cost dependence on the number of iterations, and a measurement distribution protocol for different observables within each time step. We also analyze the main source of error for our scheme both theoretically and numerically. We numerically test the validity of depth reduction, convergence performance, and faithfulness of measurement reduction approximation of our algorithms on LiH, BeH${}_2$ and N${}_2$ molecules. In particular, the results on LiH molecule give circuit depths comparable to that of the advanced adaptive variational quantum eigensolver~(VQE) methods while requiring much fewer measurements.

References in corpus (46)

• A variational eigenvalue solver on a quantum processor
• Barren plateaus in quantum neural network training landscapes
• A Quantum Approximate Optimization Algorithm
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• Simulated Quantum Computation of Molecular Energies
• Predicting Many Properties of a Quantum System from Very Few Measurements
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Fermionic quantum computation
• A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
• Noise-Induced Barren Plateaus in Variational Quantum Algorithms
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Spectral Gap and Exponential Decay of Correlations
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Variational ansatz-based quantum simulation of imaginary time evolution
• Density matrix embedding: A simple alternative to dynamical mean-field theory
• Quantum measurements and the Abelian Stabilizer Problem
• Training variational quantum algorithms is NP-hard
• qubit-ADAPT-VQE: An adaptive algorithm for constructing hardware-efficient ansatze on a quantum processor
• A random compiler for fast Hamiltonian simulation
• Unbiasing Fermionic Quantum Monte Carlo with a Quantum Computer
• Near-optimal ground state preparation
• Faster quantum simulation by randomization
• Digital quantum simulation of open quantum systems using quantum imaginary time evolution
• Quantum Simulation and Spectroscopy of Entanglement Hamiltonians
• Yao.jl: Extensible, Efficient Framework for Quantum Algorithm Design
• An Adaptive Optimizer for Measurement-Frugal Variational Algorithms
• Measurements as a roadblock to near-term practical quantum advantage in chemistry: resource analysis
• Quantum Computation of Finite-Temperature Static and Dynamical Properties of Spin Systems Using Quantum Imaginary Time Evolution
• Algorithms for quantum simulation at finite energies
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Quantum simulation with hybrid tensor networks
• Efficient step-merged quantum imaginary time evolution algorithm for quantum chemistry
• Concentration for random product formulas
• Experimental quantum state measurement with classical shadows
• Toward Practical Quantum Embedding Simulation of Realistic Chemical Systems on Near-term Quantum Computers
• Measurement cost of metric-aware variational quantum algorithms
• Probabilistic Nonunitary Gate in Imaginary Time Evolution
• A Hybrid Classical/Quantum Approach for Large-Scale Studies of Quantum Systems with Density Matrix Embedding Theory
• Perturbative quantum simulation
• Shallow-circuit variational quantum eigensolver based on symmetry-inspired Hilbert space partitioning for quantum chemical calculations
• Quantum imaginary time evolution steered by reinforcement learning
• Improved algorithms of quantum imaginary time evolution for ground and excited states of molecular systems
• Error-resilient Monte Carlo quantum simulation of imaginary time
• Universal quantum algorithmic cooling on a quantum computer
• Circuit-Depth Reduction of Unitary-Coupled-Cluster Ansatz by Energy Sorting

Cited by in corpus (11)

• Quantum Machine Learning in Drug Discovery: Applications in Academia and Pharmaceutical Industries
• Ab initio Quantum Simulation of Strongly Correlated Materials with Quantum Embedding
• Towards Efficient Quantum Computing for Quantum Chemistry: Reducing Circuit Complexity with Transcorrelated and Adaptive Ansatz Techniques
• A Quantum Simulation Approach to Implementing Nuclear Density Functional Theory via Imaginary Time Evolution
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Halving the Cost of Quantum Algorithms with Randomization
• Exact block encoding of imaginary time evolution with universal quantum neural networks
• Simulating the non-Hermitian dynamics of financial option pricing with quantum computers
• Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem
• Orbital Expansion Variational Quantum Eigensolver: Enabling Efficient Simulation of Molecules with Shallow Quantum Circuit
• Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time