Related papers: Isoholonomic Problem and Holonomic Quantum Computa…
We present a new approach to quantum computation involving the geometric phase. In this approach, an entire computation is performed by adiabatically evolving a suitably chosen quantum system in a closed circuit in parameter space. The…
Quantum Hamiltonian Computing is a recent approach that uses quantum systems, in particular a single molecule, to perform computational tasks. Within this approach, we present explicit methods to construct logic gates using two different…
We discuss in this chapter the basics of adiabatic computation, as well as some physical implementations. After a short introduction of the quantum circuit model, we describe quantum adiabatic computation, quantum annealing, and the strong…
A periodic change of slow environmental parameters of a quantum system induces quantum holonomy. The phase holonomy is a well-known example. Another is a more exotic kind that exhibits eigenvalue and eigenspace holonomies. We introduce a…
We present a formal geometric framework for the study of adiabatic quantum mechanics for arbitrary finite-dimensional non-degenerate Hamiltonians. This framework generalizes earlier holonomy interpretations of the geometric phase to…
One of the most promising nascent technologies, quantum computation faces a major challenge: The need for stable computational building blocks. We present the quantum-optical realization of non-adiabatic holonomies that can be used as…
Quantum computation is a promising emerging technology, and by utilizing the principles of quantum mechanics, it is expected to achieve faster computations than classical computers for specific problems. There are two distinct architectures…
We introduce a class of quantum adiabatic evolutions that we claim may be interpreted as the equivalents of the unitary gates of the quantum gate model. We argue that these gates form a universal set and may therefore be used as building…
Adiabatic quantum computation is a paradigmatic model aiming to solve a computational problem by finding the many-body ground state encapsulating the solution. However, its use of an adiabatic evolution depending on the spectral gap of an…
We review an approach to fault-tolerant holonomic quantum computation on stabilizer codes. We explain its workings as based on adiabatic dragging of the subsystem containing the logical information around suitable loops along which the…
In adiabatic quantum computing the aim is to track an eigenstate as the Hamiltonian changes. In the usual setup this is achieved using the natural time-dependent Hamiltonian evolution of the system and the main technical tool is the…
Nonadiabatic holonomic quantum computation has received increasing attention due to its robustness against control errors as well as high-speed realization. Several schemes of its implementation have been put forward based on various…
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian,…
Conditional geometric phase shift gate, which is fault tolerate to certain errors due to its geometric property, is made by NMR technique recently under adiabatic condition. By the adiabatic requirement, the result is inexact unless the…
Quantum adiabatic processes -that keep constant the populations in the instantaneous eigenbasis of a time-dependent Hamiltonian- are very useful to prepare and manipulate states, but take typically a long time. This is often problematic…
Following the B. Hiley belief that unresolved problems of conventional quantum mechanics could be the result of a wrong mathematical structure, an alternative basic structure is suggested. Critical part of the structure is modification of…
An adiabatic change of parameters along a closed path may interchange the (quasi-)eigenenergies and eigenspaces of a closed quantum system. Such discrepancies induced by adiabatic cycles are refereed to as the exotic quantum holonomy, which…
Quantized integrable systems can be made to perform universal quantum computation by the application of a global time-varying control. The action-angle variables of the integrable system function as qubits or qudits, which can be coupled…
In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes…
Two-qubit logical gates are proposed on the basis of two atoms trapped in a cavity setup. Losses in the interaction by spontaneous transitions are efficiently suppressed by employing adiabatic transitions and the Zeno effect. Dynamical and…