Related papers: Multiple-time Quantum Imaginary Time Evolution
A milestone in the field of quantum computing will be solving problems in quantum chemistry and materials faster than state-of-the-art classical methods. The current understanding is that achieving quantum advantage in this area will…
Quantum phase estimation (QPE) is one of the most important subroutines in quantum computing. In general applications, current QPE algorithms either suffer an exponential time overload or require a set of - notoriously quite fragile - GHZ…
We show that it is possible to uniquely reconstruct a generic many-body local Hamiltonian from a single pair of initial and final states related by time evolution with the Hamiltonian. We then propose a practical version of the protocol…
The Quantum Phase Difference Estimation (QPDE) algorithm, as an extension of the Quantum Phase Estimation (QPE), is a quantum algorithm designed to compute the differences of two eigenvalues of a unitary operator by exploiting the quantum…
Achieving quantum speedups in practical tasks remains challenging for current noisy intermediate-scale quantum (NISQ) devices. These devices always encounter significant obstacles such as inevitable physical errors and the limited…
Quantum simulation using time evolution in phase estimation-based quantum algorithms can yield unbiased solutions of classically intractable models. However, long runtimes open such algorithms to decoherence. We show how measurement-based…
We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number…
The general problem of finding the ground state energy of lattice Hamiltonians is known to be very hard, even for a quantum computer. We show here that this is the case even for translationally invariant systems. We also show that a quantum…
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…
We revisit quantum phase estimation algorithms for the purpose of obtaining the energy levels of many-body Hamiltonians and pay particular attention to the statistical analysis of their outputs. We introduce the mean phase direction of the…
Modeling low energy eigenstates of fermionic systems can provide insight into chemical reactions and material properties and is one of the most anticipated applications of quantum computing. We present three techniques for reducing the cost…
Multivariate (MTV) porous materials exhibit unique structural complexities based on diverse spatial arrangements of multiple building block combinations. These materials possess potential synergistic functionalities that exceed the sum of…
We present two techniques that can greatly reduce the number of gates required to realize an energy measurement, with application to ground state preparation in quantum simulations. The first technique realizes that to prepare the ground…
State preparation is of fundamental importance in quantum physics, which can be realized by constructing the quantum circuit as a unitary that transforms the initial state to the target, or implementing a quantum control protocol to evolve…
Quantum simulation is a promising application for quantum computing. Quantum simulation algorithms may require the ability to control the time evolution unitary. Naive techniques to control a unitary can substantially increase the required…
Classical simulation of real-space quantum dynamics is challenging due to the exponential scaling of computational cost with system dimensions. Quantum computer offers the potential to simulate quantum dynamics with polynomial complexity;…
Quantum systems governed by time-dependent Hamiltonians pose significant challenges for the accurate computation of unitary time-evolution operators, which are essential for predicting quantum state dynamics. In this work, we introduce a…
We introduce a novel approach for estimating the spectrum of quantum many-body Hamiltonians, and more generally, of Hermitian operators, using quantum time evolution. In our approach we are evolving a maximally mixed state under the…
Quantum computers have the potential to solve important problems which are fundamentally intractable on a classical computer. The underlying physics of quantum computing platforms supports using multi-valued logic, which promises a boost in…
We introduce a quantum algorithm to efficiently prepare states with a small energy variance at the target energy. We achieve it by filtering a product state at the given energy with a Lorentzian filter of width $\delta$. Given a local…