Related papers: Modeling an adiabatic quantum computer
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. Based on results from [BeTe1] for special…
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…
We propose and solve a minimal model of dynamic passage through a second-order phase transition in the presence of symmetry breaking interactions and no dissipation. Our model generalizes the Hamiltonian dynamics of the Painleve'-2 equation…
We study quantum dynamics of Grover's adiabatic search algorithm with the equivalent two-level system. Its adiabatic and non-adiabatic evolutions are visualized as trajectories of Bloch vectors on a Bloch sphere. We find the change in the…
A geometric phase is found for a general quantum state that undergoes adiabatic evolution. For the case of eigenstates, it reduces to the original Berry's phase. Such a phase is applicable in both linear and nonlinear quantum systems.…
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum approximate heuristics take advantage of alternation between a…
Shortcuts to adiabaticity are alternative fast processes which reproduce the same final state as the adiabatic process in a finite or even shorter time, which have been extended from Hermitian systems to non-Hermitian systems in recent…
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…
There are well developed theoretical tools to analyse how quantum dynamics can solve computational problems by varying Hamiltonian parameters slowly, near the adiabatic limit. On the other hand, there are relatively few tools to understand…
The adiabatic theorem of quantum mechanics states that the error between an instantaneous eigenstate of a time-dependent Hamiltonian and the state given by quantum evolution of duration $\tau$ is upper bounded by $C/\tau$ for some positive…
This article deals with non-adiabatic processes (i.e. processes excluded by the adiabatic theorem) from the geometrical (group-theoretical) point of view. An approximated formula for the probabilities of the non-adiabatic transitions is…
The adiabatic approximation is well-known method for effective study of few-body systems in molecular, atomic and nuclear physics, using the idea of separation of "fast" and "slow" variables. The generalization of the standard adiabatic…
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…
We present an optimized adiabatic quantum schedule for unstructured search building on the original approach of Roland and Cerf [Phys. Rev. A 65, 042308 (2002)]. Our schedule adiabatically varies the Hamiltonian even more rapidly at the…
In quantum information processing, the development of fast and robust control schemes remains a central challenge. Although quantum adiabatic evolution is inherently robust against control errors, it typically demands long evolution times.…
Besides the traditional circuit-based model of quantum computation, several quantum algorithms based on a continuous-time Hamiltonian evolution have recently been introduced, including for instance continuous-time quantum walk algorithms as…
We propose a method to speed up the quantum adiabatic algorithm using catalysis by many-body delocalization. This is applied to random-field antiferromagnetic Ising spin models. The algorithm is catalyzed in such a way that the evolution…
We present an approach for carrying out non-adiabatic molecular dynamics simulations of systems in which non-adiabatic transitions arise from the coupling between the classical atomic motions and a quasi-continuum of electronic quantum…
We investigate microscopically the tunneling dynamics in spontaneous fission of atomic nuclei. To this end, we employ a schematic solvable model with a pairing-plus-quadrupole interaction. The spontaneous decay of a system is simulated by…
Quantum computation has revolutionary potential for speeding algorithms and for simulating quantum systems such as molecules. We report here a quantum computer design that performs universal quantum computation within a single…