Related papers: Adiabatic state preparation study of methylene
A new method is proposed for determining the ground state wave function of a quantum many-body system on a quantum computer, without requiring an initial trial wave function that has good overlap with the true ground state. The technique of…
The preparation of ground states of spin systems is a fundamental operation in quantum computing and serves as the basis of adiabatic quantum computing. This form of quantum computation is subject to the adiabatic theorem which in turn…
Quantum annealing (QA) is one of the ways to search the ground state of the problem Hamiltonian. Here, we propose the QA scheme to search arbitrary excited states of the problem Hamiltonian. In our scheme, an $n$-th excited state of the…
This thesis investigates quantum algorithms for eigenstate preparation, with a focus on solving eigenvalue problems such as the Schrodinger equation by utilizing near-term quantum computing devices. These problems are ubiquitous in several…
We analyze the performance of adiabatic quantum computation (AQC) under the effect of decoherence. To this end, we introduce an inherently open-systems approach, based on a recent generalization of the adiabatic approximation. In contrast…
We present a coherent counter-diabatic quantum protocol to prepare ground states in the lattice gauge mapping of all-to-all Ising models (LHZ) with considerably enhanced final ground state fidelity compared to a quantum annealing protocol.…
Despite significant work on resource estimation for quantum simulation of electronic systems, the challenge of preparing states with sufficient ground state support has so far been largely neglected. In this work we investigate this issue…
Local counterdiabatic driving (CD) provides a feasible approach for realizing approximate reversible/adiabatic processes like quantum state preparation using only local controls and without demanding excessively long protocol times.…
Preparation of Gibbs distributions is an important task for quantum computation. It is a necessary first step in some types of quantum simulations and further is essential for quantum algorithms such as quantum Boltzmann training. Despite…
Excited states of molecules lie in the heart of photochemistry and chemical reactions. The recent development in quantum computational chemistry leads to inventions of a variety of algorithms that calculate the excited states of molecules…
We show how to apply the quantum adiabatic algorithm directly to the quantum computation of molecular properties. We describe a procedure to map electronic structure Hamiltonians to 2-local qubit Hamiltonians with a small set of physically…
Quantum adiabatic processes -that keep constant the populations in the instantaneous eigenbasis of a time-dependent Hamiltonian- are very useful to prepare and manipulate states, but take typically a long time. This is often problematic…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
Adiabatic techniques are well known tools in multi-level electron systems to transfer population between different states with high fidelity. Recently it has been realised that these ideas can also be used in ultra-cold atom systems to…
While quantum computers are capable of simulating many quantum systems efficiently, the simulation algorithms must begin with the preparation of an appropriate initial state. We present a method for generating physically relevant quantum…
Eigenstate preparation is ubiquitous in quantum computing, and a standard approach for generating the lowest-energy states of a given system is by employing adiabatic state preparation (ASP). In the present work, we investigate a…
Recently, a new method, which can significantly speed up adiabatic quantum state transfer by using dressed states, was proposed by Baksic \emph{et~al.} [Phys. Rev. Lett. \textbf{116}, 230503 (2016)]. Assisted by quantum Zeno dynamics, we…
The quantum adiabatic method, which maintains populations in their instantaneous eigenstates throughout the state evolution, is an established and often a preferred choice for state preparation and manipulation. Though it minimizes the…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum…