Related papers: A probabilistic imaginary-time evolution quantum a…
Quantum imaginary time evolution (QITE) is a powerful method to derive the ground states of the systems. Only the damping of quantum states leads it; hence, reaching the ground state is guaranteed by nature without any external…
This paper proposes a systematic and explicit quantum circuit framework for solving advection-diffusion equations with boundary conditions, based on the Linear Combination of Hamiltonian Simulations (LCHS) method. By employing the Finite…
Quantum computing has made tremendous progress in recent years, providing potentialities for breaking the bottleneck of computing power in the field of scientific computing, like computational fluid dynamics. To reduce computational costs…
We compare the circuit depths for five different gate sets to implement a quantum algorithm solving a drift-diffusion equation in two spatial dimensions. Our algorithm uses diagonalisation by the quantum Fourier transform. The gate sets…
In this paper we introduce an approximate method to solve the quantum cavity equations for transverse field Ising models. The method relies on a projective approximation of the exact cavity distributions of imaginary time trajectories…
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…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
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…
We present four quantum algorithms for solving a multidimensional drift-diffusion equation. They rely on a quantum linear system solver, a quantum Hamiltonian simulation, a quantum random walk, and the quantum Fourier transform. We compare…
We present a quantum algorithm for the simulation of molecular systems that is asymptotically more efficient than all previous algorithms in the literature in terms of the main problem parameters. As in previous work [Babbush et al., New…
Imaginary time evolution is a powerful tool for studying quantum systems. While it is possible to simulate with a classical computer, the time and memory requirements generally scale exponentially with the system size. Conversely, quantum…
In this study, we employed a quantum computer to solve a low-energy effective Hamiltonian for spin defects in diamond (so-called NV centre) and wurtzite-type aluminium nitride, which are anticipated to be qubits. The probabilistic…
We propose a new variational quantum algorithm, which we refer to as TIMES-ADAPT, that prepares time-evolved states in a low-energy or symmetric subspace of a time-independent Hamiltonian on a quantum computer. Using a specially trained…
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…
Simulating the dynamics of open quantum systems is a crucial task in quantum computing, offering wide-ranging applications but remaining computationally challenging. In this paper, we propose two quantum algorithms for simulating the…
Optimization problems in finance, physics and computer science are typically very hard to tackle in classical computing and quantum computing could help speed up computations and provide efficient methods for tackling large problems.…
Non-Hermitian quantum systems exhibit unique properties and hold significant promise for diverse applications, yet their dynamical simulation poses a particular challenge due to intrinsic openness and non-unitary evolution. Here, we…
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in…
The current generation of noisy intermediate scale quantum computers introduces new opportunities to study quantum many-body systems. In this paper, we show that quantum circuits can provide a dramatically more efficient representation than…
Efficient ground state search is fundamental to advancing combinatorial optimization problems and quantum chemistry. While the Variational Imaginary Time Evolution (VITE) method offers a useful alternative to Variational Quantum Eigensolver…