Efficient quantum imaginary time evolution by drifting real time
evolution: an approach with low gate and measurement complexity
- URL: http://arxiv.org/abs/2203.11112v2
- Date: Mon, 5 Sep 2022 15:40:47 GMT
- Title: Efficient quantum imaginary time evolution by drifting real time
evolution: an approach with low gate and measurement complexity
- Authors: Yifei Huang, Yuguo Shao, Weiluo Ren, Jinzhao Sun and Dingshun Lv
- Abstract summary: Quantum imaginary time evolution (QITE) is one of the promising candidates for finding eigenvalues and eigenstates of a Hamiltonian.
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.
We propose a time-dependent drifting scheme inspired by thePhys. Rev. Lett 123, 070503 LiH], which randomly draws a Pauli term out of the approximated unitary operation generators of
- Score: 7.1064035036390925
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- 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.
Related papers
- Operator-Projected Variational Quantum Imaginary Time Evolution [0.0]
We show that requiring the imaginary-time evolution to be correct only when projected onto a chosen set of operators allows to achieve a twofold reduction in circuit depth.
We demonstrate by a simulation of the transverse-field Ising model that our algorithm achieves a several orders of magnitude improvement in the number of measurements required for the same accuracy.
arXiv Detail & Related papers (2024-09-18T14:30:05Z) - Adaptive variational quantum dynamics simulations with compressed circuits and fewer measurements [4.2643127089535104]
We show an improved version of the adaptive variational quantum dynamics simulation (AVQDS) method, which we call AVQDS(T)
The algorithm adaptively adds layers of disjoint unitary gates to the ansatz circuit so as to keep the McLachlan distance, a measure of the accuracy of the variational dynamics, below a fixed threshold.
We also show a method based on eigenvalue truncation to solve the linear equations of motion for the variational parameters with enhanced noise resilience.
arXiv Detail & Related papers (2024-08-13T02:56:43Z) - Simulating scalar field theories on quantum computers with limited
resources [62.997667081978825]
We present a quantum algorithm for implementing $phi4$ lattice scalar field theory on qubit computers.
The algorithm allows efficient $phi4$ state preparation for a large range of input parameters in both the normal and broken symmetry phases.
arXiv Detail & Related papers (2022-10-14T17:28:15Z) - Exploring the role of parameters in variational quantum algorithms [59.20947681019466]
We introduce a quantum-control-inspired method for the characterization of variational quantum circuits using the rank of the dynamical Lie algebra.
A promising connection is found between the Lie rank, the accuracy of calculated energies, and the requisite depth to attain target states via a given circuit architecture.
arXiv Detail & Related papers (2022-09-28T20:24:53Z) - Numerical Simulations of Noisy Quantum Circuits for Computational
Chemistry [51.827942608832025]
Near-term quantum computers can calculate the ground-state properties of small molecules.
We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
arXiv Detail & Related papers (2021-12-31T16:33:10Z) - Simulating the Mott transition on a noisy digital quantum computer via
Cartan-based fast-forwarding circuits [62.73367618671969]
Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model.
Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models.
This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
arXiv Detail & Related papers (2021-12-10T17:32:15Z) - Error-resilient Monte Carlo quantum simulation of imaginary time [5.625946422295428]
We propose an algorithm for simulating the imaginary-time evolution and solving the ground-state problem.
Compared with quantum phase estimation, the Trotter step number can be thousands of times smaller.
Results show that Monte Carlo quantum simulation is promising even without a fully fault-tolerant quantum computer.
arXiv Detail & Related papers (2021-09-16T08:51:24Z) - Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware.
We present an algorithm that compresses the Trotter steps into a single block of quantum gates.
This results in a fixed depth time evolution for certain classes of Hamiltonians.
arXiv Detail & Related papers (2021-08-06T19:38:01Z) - Fast and differentiable simulation of driven quantum systems [58.720142291102135]
We introduce a semi-analytic method based on the Dyson expansion that allows us to time-evolve driven quantum systems much faster than standard numerical methods.
We show results of the optimization of a two-qubit gate using transmon qubits in the circuit QED architecture.
arXiv Detail & Related papers (2020-12-16T21:43:38Z) - Gate-free state preparation for fast variational quantum eigensolver
simulations: ctrl-VQE [0.0]
VQE is currently the flagship algorithm for solving electronic structure problems on near-term quantum computers.
We propose an alternative algorithm where the quantum circuit used for state preparation is removed entirely and replaced by a quantum control routine.
As with VQE, the objective function optimized is the expectation value of the qubit-mapped molecular Hamiltonian.
arXiv Detail & Related papers (2020-08-10T17:53:09Z) - Variationally Scheduled Quantum Simulation [0.0]
We investigate a variational method for determining the optimal scheduling procedure within the context of adiabatic state preparation.
In the absence of quantum error correction, running a quantum device for any meaningful amount of time causes a system to become susceptible to the loss of relevant information.
Our variational method is found to exhibit resilience against control errors, which are commonly encountered within the realm of quantum computing.
arXiv Detail & Related papers (2020-03-22T14:47:04Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.