Related papers: Quantum adiabatic elimination at arbitrary order f…
We study temporal behavior of a quantum system under a slow external perturbation, which drives the system across a second order quantum phase transition. It is shown that despite the conventional adiabaticity conditions are always violated…
An alternative interpretation of the quantum adiabatic approximation is presented. This interpretation is based on the ideas originally advocated by David Bohm in his quest for establishing a hidden variable alternative to quantum…
We introduce a new approach to renormalize physical quantities in curved space-time by adiabatic subtraction. We use a comoving infrared cut-off in defining the adiabatic counterpart of the physical quantity under consideration, building on…
The quantum adiabatic unstructured search algorithm is one of only a handful of quantum adiabatic optimization algorithms to exhibit provable speedups over their classical counterparts. With no fault tolerance theorems to guarantee the…
Adiabatic processes are important for studying the dynamics of a time-dependent system. Conventionally, the adiabatic processes can only be achieved by varying the system slowly. We speed up both classical and quantum adiabatic processes by…
We construct a measure for the adiabatic contribution to quantum transitions in an arbitrary basis, tackling the generic complex case where dynamics is only partially adiabatic, simultaneously populates several eigenstates and transitions…
We examine the quantitative condition which has been widely used as a criterion for the adiabatic approximation but was recently found insufficient. Our results indicate that the usual quantitative condition is sufficient for a special…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…
Most investigations devoted to the conditions for adiabatic quantum computing are based on the first-order correction ${\bra{\Psi_{\rm ground}(t)}\dot H(t)\ket{\Psi_{\rm excited}(t)} /\Delta E^2(t)\ll1}$. However, it is demonstrated that…
Analog models of quantum information processing, such as adiabatic quantum computation and analog quantum simulation, require the ability to subject a system to precisely specified Hamiltonians. Unfortunately, the hardware used to implement…
For slow--fast quantum systems, we compute first corrections to the quantum action and to the effective slow Hamiltonian.
Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance, yet is often poorly understood. We study the dynamics of a…
The combined quantum electron-nuclear dynamics is often associated with the Born-Huang expansion of the molecular wave function and the appearance of nonadiabatic effects as a perturbation. On the other hand, native multicomponent…
Quantum computing promises significant improvements of computation capabilities in various fields such as machine learning and complex optimization problems. Recent technological advancements suggest that the adiabatic quantum computing…
We construct a set of instances of 3SAT which are not solved efficiently using the simplest quantum adiabatic algorithm. These instances are obtained by picking random clauses all consistent with two disparate planted solutions and then…
We present an efficient quantum algorithm for some independent set problems in graph theory, based on non-abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different…
On-the-fly quantum nonadiabatic dynamics for large systems greatly benefits from the adiabatic representation readily available from the electronic structure programs. However, frequently occurring in this representation conical…
This paper discusses quantum adiabatic elimination, which is a model reduction technique for a composite Lindblad system consisting of a fast decaying sub-system coupled to another sub-system with a much slower timescale. Such a system…
Quantum state elimination measurements tell us what states a quantum system does not have. This is different from state discrimination, where one tries to determine what the state of a quantum system is, rather than what it is not. Apart…
We employ quantum mechanical principles in the computability exploration of the class of classically noncomputable Hilbert's tenth problem which is equivalent to the Turing halting problem in Computer Science. The Quantum Adiabatic Theorem…