Related papers: Ground State Preparation via Dynamical Cooling
Simulating the nonequilibrium dynamics of thermal states is a fundamental problem across scales from high energy to condensed matter physics. Quantum computers may provide a way to solve this problem efficiently. Preparing a thermal state…
We propose a polynomial-time algorithm for preparing the Gibbs state of the two-dimensional toric code Hamiltonian at any temperature, starting from any initial condition, significantly improving upon prior estimates that suggested…
This paper explores several aspects of the adiabatic quantum computation model. We first show a way that directly maps any arbitrary circuit in the standard quantum computing model to an adiabatic algorithm of the same depth. Specifically,…
We present a variational approach for quantum simulators to realize finite temperature Gibbs states by preparing thermofield double (TFD) states. Our protocol is motivated by the quantum approximate optimization algorithm (QAOA) and…
We use matrix product techniques to investigate the performance of two algorithms for obtaining the ground state of a quantum many-body Hamiltonian $H = H_A + H_B$ in infinite systems. The first algorithm is a generalization of the quantum…
Finding the ground state of complex quantum systems remains a central challenge in many-body physics, quantum chemistry, and combinatorial optimization, due to the exponential growth of the Hilbert-space dimension and the entangled…
A method is presented in which the ground-state subspace is projected out of a Hamiltonian representation. As a result of this projection, an effective Hamiltonian is constructed where its ground-state coincides with an excited-state of the…
Estimating the ground-state energy of Hamiltonians in quantum systems is an important task. In this work, we demonstrate that the ground-state energy can be accurately estimated without controlled time evolution by using adiabatic state…
We consider measurement-based quantum computation using the state of a spin-lattice system in equilibrium with a thermal bath and free to evolve under its own Hamiltonian. Any single qubit measurements disturb the system from equilibrium…
In recent years, the application of machine learning to physics has been actively explored. In this paper, we study a method for estimating the ground-state energy of quantum Hamiltonians by applying data-driven Koopman analysis within the…
Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to…
An important aspect of quantum simulation is the preparation of physically interesting states on a quantum computer, and this task can often be costly or challenging to implement. A digital, ``site-by-site'' scheme of state preparation was…
Computing electronic structures of quantum systems is a key task underpinning many applications in photonics, solid-state physics, and quantum technologies. This task is typically performed through iterative algorithms to find the energy…
Controlled preparation of highly pure quantum states is at the core of practical applications of quantum information science, from the state initialization of most quantum algorithms to a reliable supply of ancilla qubits that satisfy the…
We formulate a novel ground state quantum computation approach that requires no unitary evolution of qubits in time: the qubits are fixed in stationary states of the Hamiltonian. This formulation supplies a completely time-independent…
By periodical two-step modulation, we demonstrate that the dynamics of multilevel system can still evolve even in multiple large detunings regime, and provide the effective Hamiltonian (of interest) for this system. We then illustrate this…
We introduce a hybrid classical-quantum algorithm to compute dynamical correlation functions and excitation spectra in many-body quantum systems, with a focus on molecular systems. The method combines classical preparation of a perturbed…
It is proposed that the ability for a quantum circuit to thermalize under time evolution is a valid way to compute linear algebra problems. The algorithm makes use of the eigenstate thermalization hypothesis and full ergodicity in quantum…
Quantum phase transitions occur at zero temperature, when the ground state of a Hamiltonian undergoes a qualitative change as a function of a control parameter. We consider a particularly interesting system with competing one-, two- and…
Quantum annealers are an alternative approach to quantum computing which make use of the adiabatic theorem to efficiently find the ground state of a physically realizable Hamiltonian. Such devices are currently commercially available and…