Related papers: Experimental Adiabatic Quantum Factorization under…
Geometric phases accompanying adiabatic processes in quantum systems can be utilized as unitary gates for quantum computation. Optimization of control of the adiabatic process naturally leads to the isoholonomic problem. The isoholonomic…
The first proof of the quantum adiabatic theorem was given as early as 1928. Today, this theorem is increasingly applied in a many-body context, e.g. in quantum annealing and in studies of topological properties of matter. In this setup,…
Designing proper time-dependent control fields for slowly varying the system to the ground state that encodes the problem solution is crucial for adiabatic quantum computation. However, inevitable perturbations in real applications demand…
Energy minimization of Ising spin-glasses has played a central role in statistical and solid-state physics, facilitating studies of phase transitions and magnetism. Recent proposals suggest using Ising spin-glasses for non-traditional…
We propose a simple feedback-control scheme for adiabatic quantum computation with superconducting flux qubits. The proposed method makes use of existing on-chip hardware to monitor the ground-state curvature, which is then used to control…
We study the computational strength of quantum particles (each of finite dimensionality) arranged on a line. First, we prove that it is possible to perform universal adiabatic quantum computation using a one-dimensional quantum system (with…
A central challenge in the successful implementation of adiabatic quantum algorithms is to maintain the quantum adiabaticity during the entire evolution. However, the energy gap between the ground and the excited states of interacting…
Quantum adiabatic transfer is widely used in quantum computation and quantum simulation. However, the transfer speed is limited by the quantum adiabatic approximation condition, which hinders its application in quantum systems with a short…
We analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm'.
We present a technique that dramatically improves the accuracy of adiabatic state transfer for a broad class of realistic Hamiltonians. For some systems, the total error scaling can be quadratically reduced at a fixed maximum transfer rate.…
Universal single-qubit operations based on purely geometric phase factors in adiabatic processes are demonstrated by utilizing a four-level system in a trapped single $^{40}$Ca$^+$ ion connected by three oscillating fields. Robustness…
The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a first result this thesis extends the original theorem to…
The observation that concepts from quantum information has generated many alternative indicators of quantum phase transitions hints that quantum phase transitions possess operational significance with respect to the processing of quantum…
Suppressing undesired nonunitary effects is a major challenge in quantum computation and quantum control. In this work, by considering the adiabatic dynamics in presence of a surrounding environment, we theoretically and experimentally…
Adiabatic quantum computation, based on the adiabatic theorem, is a promising alternative to conventional quantum computation. The validity of an adiabatic algorithm depends on the existence of a nonzero energy gap between the ground and…
Feedback in compound quantum systems is effected by using the output from one sub-system (``the system'') to control the evolution of a second sub-system (``the ancilla'') which is reversibly coupled to the system. In the limit where the…
We introduce an approach for quantum computing in continuous time based on the Lewis-Riesenfeld dynamic invariants. This approach allows, under certain conditions, for the design of quantum algorithms running on a nonadiabatic regime. We…
It is believed that the presence of anticrossings with exponentially small gaps between the lowest two energy levels of the system Hamiltonian, can render adiabatic quantum optimization inefficient. Here, we present a simple adiabatic…
We prove the equivalence between adiabatic quantum computation and quantum computation in the circuit model. An explicit adiabatic computation procedure is given that generates a ground state from which the answer can be extracted. The…
Quantum optimization is the most mature quantum computing technology to date, providing a promising approach towards efficiently solving complex combinatorial problems. Methods such as adiabatic quantum computing (AQC) have been employed in…