Related papers: Efficient quantum imaginary time evolution by drif…
Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with impractically small success probabilities or coherent (quantum…
As a valid tool for solving ground state problems, imaginary time evolution (ITE) is widely used in physical and chemical simulations. Different ITE-based algorithms in their quantum counterpart have recently been proposed and applied to…
Quantum Imaginary-Time Evolution (QITE) is a powerful method for preparing ground states on quantum hardware. However, executing QITE has costly measurement budgets for general Hamiltonians. Both fidelity and computational cost are strongly…
We propose an imaginary time equivalent of the well-established Pauli gadget primitive for Trotter-decomposed real time evolution, using mid-circuit measurements on a single ancilla qubit. Imaginary time evolution (ITE) is widely used for…
Quantum imaginary time evolution (QITE) is a recently proposed quantum-classical hybrid algorithm that is guaranteed to reach the lowest state of system. In this study, we present several improvements on QITE, mainly focusing on molecular…
Quantum imaginary-time evolution (QITE) is a promising tool to prepare thermal or ground states of Hamiltonians, as convergence is guaranteed when the evolved state overlaps with the ground state. However, its implementation using a a…
The quantum stochastic drift protocol, also known as qDRIFT, has become a popular algorithm for implementing time-evolution of quantum systems using randomised compiling. In this work we develop qFLO, a higher order randomised algorithm for…
A fast implementation of the quantum imaginary time evolution (QITE) algorithm called Fast QITE is proposed. The algorithmic cost of QITE typically scales exponentially with the number of particles it nontrivially acts on in each Trotter…
Quantum imaginary time evolution (QITE) algorithm is one of the most promising variational quantum algorithms (VQAs), bridging the current era of Noisy Intermediate-Scale Quantum devices and the future of fully fault-tolerant quantum…
Imaginary-time evolution (ITE) on a quantum computer is a promising formalism for obtaining the ground state of a quantum system. As a kind of it, the probabilistic ITE (PITE) takes advantage of measurements to implement the nonunitary…
Many computationally hard problems can be encoded in quantum Hamiltonians. The solution to these problems is given by the ground states of these Hamiltonians. A state-of-the-art algorithm for finding the ground state of a Hamiltonian is the…
Dynamic quantum circuits combine mid-circuit measurement with classical feed-forward, enabling circuit constructions with reduced entangling-gate depth. Here, we investigate their use in Quantum Imaginary Time Evolution (QITE), where…
A probabilistic imaginary-time evolution (PITE) method was proposed as a nonvariational method to obtain a ground state on a quantum computer. In this formalism, the success probability of obtaining all imaginary-time evolution operators…
The quantum imaginary time evolution (QITE) algorithm is a direct implementation of the classical imaginary time evolution algorithm on quantum computer. We implement the QITE algorithm for the case of nuclear Hartree-Fock equations in a…
We propose a nonvariational scheme for geometry optimization of molecules for the first-quantized eigensolver, a recently proposed framework for quantum chemistry using the probabilistic imaginary-time evolution (PITE) on a quantum…
Quantum phase estimation (QPE) plays a pivotal role in many quantum algorithms, offering provable speedups in applications such as Shor's factoring algorithm. While fault-tolerant quantum algorithms for combinatorial and Hamiltonian…
Developing scalable quantum algorithms to study finite-temperature physics of quantum many-body systems has attracted considerable interest due to recent advancements in quantum hardware. However, such algorithms in their present form…
Imaginary-time evolution, an important technique in tensor network and quantum Monte Carlo algorithms on classical computers, has recently been adapted to quantum computing. In this study, we focus on probabilistic imaginary-time evolution…
We develop a resource efficient step-merged quantum imaginary time evolution approach (smQITE) to solve for the ground state of a Hamiltonian on quantum computers. This heuristic method features a fixed shallow quantum circuit depth along…
There is increasing interest in quantum algorithms that are based on the imaginary-time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy post-processing…