Related papers: An Elementary Proof of the Quantum Adiabatic Theor…
We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors,…
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…
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…
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…
The unitary operator corresponding to the classical canonical transformation that connects a general closed system to an open system under adiabatic conditions is found. The quantum invariant operator of the adiabatic open system is derived…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. In the training phase we identify an optimal set of weak classifiers, to form a single strong classifier. In the testing phase we…
Quantum adiabatic evolution is a dynamical evolution of a quantum system under slow external driving. According to the quantum adiabatic theorem, no transitions occur between non-degenerate instantaneous eigen-energy levels in such a…
We describe a many-body quantum system which can be made to quantum compute by the adiabatic application of a large applied field to the system. Prior to the application of the field quantum information is localized on one boundary of the…
The story on the early days of the Quantum Ergodic Theorem. Alternative proof, underlying heuristics, physical analogies and interpretations.
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
The adiabatic quantum computation is a universal and robust method of quantum computing. In this architecture, the problem can be solved by adiabatically evolving the quantum processor from the ground state of a simple initial Hamiltonian…
We propose an experimental method for evaluating the adiabatic condition during quantum annealing (QA), which will be essential for solving practical problems. The adiabatic condition consists of the transition matrix element and the energy…
Quantum adiabatic evolutions find a broad range of applications in quantum physics and quantum technologies. The traditional form of the quantum adiabatic theorem limits the speed of adiabatic evolution by the minimum energy gaps of the…
In this paper,we present a rigorous demonstration and discussion of the quantum adiabatic theorem for systems having a non degenerate continuous spectrum. A new strategy is initiated by defining a kind of gap, "a virtual gap", for the…
We present the main aspects of the adiabatic theory and show that it can be used to study the motion of test particles in general relativity. The theory is based upon the use of vector elements of the orbits and adiabatic invariants. To…
The arguments employed in quant-ph/0111009, to claim that the quantum algorithm in quant-ph/0110136 does not work, are so general that were they true then the adiabatic theorem itself would have been wrong. As a matter of fact, those…
We present a rigorous proof that quantum circuit algorithm can be transformed into quantum adiabatic algorithm with the exact same time complexity. This means that from a quantum circuit algorithm of $L$ gates we can construct a quantum…
Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power was unknown. We describe an efficient adiabatic simulation of any given quantum algorithm, which…
In this paper, we note that there are two different types of inconsistencies of quantum adiabatic theorem in work of K. P. Marzlin and B. C. Sanders [Phys. Rev. Lett. 93, 160408, 2004], MS inconsistency and MS counterexample. Nevertheless,…