Related papers: Sufficient condition for validity of quantum adiab…
The Principle of Sufficient Reason implies determinism. An explicit indeterministic quantum jump dynamics is constructed, which may be naturally transformed into a deterministic one. A consistent application of the Principle of Sufficient…
The codespace of a quantum error-correcting code can often be identified with the degenerate ground-space within a gapped phase of quantum matter. We argue that the stability of such a phase is directly related to a set of coherent error…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
In order to understand quantum decoherence of a quantum system due to its interaction with a large system behaving classically, we introduce the concept of adiabatic quantum entanglement based on the Born-Oppenhemeir approximation. In the…
The recent discovery of inconsistency (MS inconsistency) in the adiabatic approximation is discussed. In particular, the so-called, inconsistency in Berry phase is analyzed. On the contrary to some authors, we found that the MS…
We present details and expand on the framework leading to the recently introduced degenerate adiabatic perturbation theory [Phys. Rev. Lett. 104, 170406 (2010)], and on the formulation of the degenerate adiabatic theorem, along with its…
Adiabatic quantum computing enables the preparation of many-body ground states. This is key for applications in chemistry, materials science, and beyond. Realisation poses major experimental challenges: Direct analog implementation requires…
Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…
I study the effectiveness of fault-tolerant quantum computation against correlated Hamiltonian noise, and derive a sufficient condition for scalability. Arbitrarily long quantum computations can be executed reliably provided that noise…
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 investigate the freezing phenomenon of quantum discord occurring in phase damping noise processes. By relating the expression of the time variation of the discord to the convex function of relative entropy, we obtain the necessary and…
We provide a simple proof for the necessity of conditions for discriminating with minimum error between a known set of quantum states.
Adiabatic elimination is a perturbative model reduction technique based on timescale separation and often used to simplify the description of composite quantum systems. We here analyze a quantum experiment where the perturbative expansion…
A major challenge facing adiabatic quantum computing is that algorithm design and error correction can be difficult for adiabatic quantum computing. Recent work has considered addressing his challenge by using coherently controlled…
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…
We define for quantum many-body systems a quasi-adiabatic continuation of quantum states. The continuation is valid when the Hamiltonian has a gap, or else has a sufficiently small low-energy density of states, and thus is away from a…
When parameters are varied periodically, charge can be pumped through a mesoscopic conductor without applied bias. Here, we consider the inverse effect in which a transport current drives a periodic variation of an adiabatic degree of…
Quantum annealing is a generic name of quantum algorithms to use quantum-mechanical fluctuations to search for the solution of optimization problem. It shares the basic idea with quantum adiabatic evolution studied actively in quantum…
Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing, with deep connections to both classical…
The adiabatic approximation in quantum mechanics is considered in the case where the self-adjoint hamiltonian $H_0(t)$, satisfying the usual spectral gap assumption in this context, is perturbed by a term of the form $\epsilon H_1(t)$. Here…