Related papers: Quantum Adiabatic Approximation, Quantum Action, a…
A quantum system will stay near its instantaneous ground state if the Hamiltonian that governs its evolution varies slowly enough. This quantum adiabatic behavior is the basis of a new class of algorithms for quantum computing. We test one…
Numerous sufficient conditions for adiabaticity of the evolution of a driven quantum system have been known for quite a long time. In contrast, necessary adiabatic conditions are scarce. A practicable necessary condition well-suited for…
The adiabatic theorem provides the basis for the adiabatic model of quantum computation. Recently the conditions required for the adiabatic theorem to hold have become a subject of some controversy. Here we show that the reported violations…
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 reformulation of quantum adiabatic theory in terms of an emergent electromagnetic framework, emphasizing the physical consequences of geometric structures in parameter space. Contrary to conventional approaches, we demonstrate…
A new simple proof of the adiabatic theorem is given in the finite dimensional case for nondegenerate as well as degenerate states. The explicitly integrable two level system is considered as an example. It is demonstrated that the error…
We review mathematical results concerning exponentially small corrections to adiabatic approximations and Born--Oppenheimer approximations.
We have developed an adiabatic Abelian geometric quantum computation strategy based on the non-degenerate energy eigenstates in (but not limited to) superconducting phase-qubit systems. The fidelity of the designed quantum gate was…
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…
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…
Based on the adiabatic geometric phase concerning with density matrix[1] , we extend it to the sub-geometric phase in the non-adiabatic case. It is found that whatever the real part or imaginary part of the sub-geometric phase can play an…
We show that by a suitable choice of a time dependent Hamiltonian, Deutsch's algorithm can be implemented by an adiabatic quantum computer. We extend our analysis to the Deutsch-Jozsa problem and estimate the required running time for both…
It is challenged only recently that the precision attainable in any measurement of a physical parameter is fundamentally limited by the quantum Cram\'{e}r-Rao Bound (QCRB). Here, targeting at measuring parameters in strongly dissipative…
In quantum mechanics it is often required to describe in a semiclassical approximation the motion of particles moving within a given energy band. Such a representation leads to the appearance of an analogues of fictitious forces in the…
We introduce a counter-diabatic approach for deriving Hamiltonians modeling superchargable quantum batteries (QBs). A necessary requirement for the supercharging process is the existence of multipartite interactions among the cells of the…
The adiabatic theorem states that when the time evolution of the Hamiltonian is "infinitely slow", a system, when started in the ground state, remains in the instantaneous ground state at all times. This, however, does not mean that the…
Adiabatic evolution is an emergent design principle for time modulated metamaterials, often inspired by insights from topological quantum computing such as braiding operations. However, the pursuit of classical adiabatic metamaterials is…
It is known that for multi-level time-dependent quantum systems one can construct superadiabatic representations in which the coupling between separated levels is exponentially small in the adiabatic limit. For a family of two-state systems…
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential…
The smallness of the variation rate of the hamiltonian matrix elements compared to the (square of the) energy spectrum gap is usually believed to be the key parameter for a quantum adiabatic evolution. However it is only perturbatively…