Related papers: Equating quantum imaginary time evolution, Riemann…
Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems, and the heart of a number of numerical methods that have been used with great success in quantum chemistry, condensed matter and…
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…
Simulating time evolution of generic quantum many-body systems using classical numerical approaches has an exponentially growing cost either with evolution time or with the system size. In this work, we present a polynomially scaling hybrid…
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…
We introduce an adiabatic state preparation protocol which implements quantum imaginary time evolution under the Hamiltonian of the system. Unlike the original quantum imaginary time evolution algorithm, adiabatic quantum imaginary time…
Quantum confinement is studied by numerically solving time-dependent Schr\"odinger equation. An imaginary-time evolution technique is employed in conjunction with the minimization of an expectation value, to reach the global minimum.…
Gradient descent is a fundamental algorithm in both theory and practice for continuous optimization. Identifying its quantum counterpart would be appealing to both theoretical and practical quantum applications. A conventional approach to…
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…
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…
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 computers have been widely speculated to offer significant advantages in obtaining the ground state of difficult Hamiltonian in chemistry and physics. In this work, we first propose a Lyapunov control-inspired strategy to accelerate…
Variational quantum circuits have arisen as an important method in quantum computing. A crucial step of it is parameter optimization, which is typically tackled through gradient-descent techniques. We advantageously explore instead the use…
The phase estimation algorithm is a powerful quantum algorithm with applications in cryptography, number theory, and simulation of quantum systems. We use this algorithm to simulate the time evolution of a system of two spin-1/2 particles…
We introduce evolved quantum Boltzmann machines as a variational ansatz for quantum optimization and learning tasks. Given two parameterized Hamiltonians $G(\theta)$ and $H(\phi)$, an evolved quantum Boltzmann machine consists of preparing…
Quantum walks are a promising framework that can be used to both understand and implement quantum information processing tasks. The quantum stochastic walk is a recently developed framework that combines the concept of a quantum walk with…
We propose a hybrid quantum-classical algorithm for solving QUBO problems using an Imaginary Time Evolution-Mimicking Circuit (ITEMC). The circuit parameters are optimized to closely mimic imaginary time evolution, using only single- and…
We show that the continuous-time gradient descent in Rn can be viewed as an optimal controlled evolution for a suitable action functional; a similar result holds for stochastic gradient descent. We then provide an analogous characterization…
We reveal the power of Grover's algorithm from thermodynamic and geometric perspectives by showing that it is a product formula approximation of imaginary-time evolution (ITE), a Riemannian gradient flow on the special unitary group. This…
Computing the ground-state properties of quantum many-body systems is a promising application of near-term quantum hardware with a potential impact in many fields. The conventional algorithm quantum phase estimation uses deep circuits and…
To overcome the fast oscillatory behavior of correlation functions for extracting scattering phase shift in real-time quantum simulations encountered in Ref.\cite{Guo:2026qkx}, we propose and test two solutions in the present work. One is…