Related papers: Geometry of the adiabatic theorem
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…
The quantum superposition principle is reconsidered based on adiabatic theorem of quantum mechanics, nonadiabatic dressed states and experimental evidence. The physical mechanism and physical properties of the quantum superposition are…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
We study the adiabatic time evolution of quantum resonances over time scales which are small compared to the lifetime of the resonances. We consider three typical examples of resonances: The first one is that of shape resonances…
We show that geometric phases may be generated in a quantum system subject to noise by adiabatic manipulations of the fluctuating fields, e.g., by variation of the system-environment coupling. For a two-state quantum system we express this…
In this paper, we present a U(1)-invariant expansion theory of the adiabatic process. As its application, we propose and discuss new sufficient adiabatic approximation conditions. In the new conditions, we find a new invariant quantity…
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,…
Models of quantum computation are important because they change the physical requirements for achieving universal quantum computation (QC). For example, one-way QC requires the preparation of an entangled "cluster" state followed by…
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…
In this review we consider the performance of the quantum adiabatic algorithm for the solution of decision problems. We divide the possible failure mechanisms into two sets: small gaps due to quantum phase transitions and small gaps due to…
We present how the formalism of geometric phases in adiabatic quantum dynamics provides geometric realisations permitting to ``embody'' the Everett's many-worlds interpretation of quantum mechanics, including interferences between the…
Quantum computing for machine learning attracts increasing attention and recent technological developments suggest that especially adiabatic quantum computing may soon be of practical interest. In this paper, we therefore consider this…
We propose a new variant of the controlled-NOT quantum logic gate based on adiabatic level-crossing dynamics of the q-bits. The gate has a natural implementation in terms of the Cooper pair transport in arrays of small Josephson tunnel…
Geometric Quantum Mechanics is a novel and prospecting approach motivated by the belief that our world is ultimately geometrical. At the heart of that is a quantity called Quantum Geometric Tensor (or Fubini-Study metric), which is a…
In this paper we present a survey of the use of differential geometric formalisms to describe Quantum Mechanics. We analyze Schr\"odinger framework from this perspective and provide a description of the Weyl-Wigner construction. Finally,…
Several misprints and small mistakes were in the initial version. They have been corrected. Following the recent experimental realization of synthetic gauge magnetic forces, Jean Dalibard adressed the question whether the adiabatic ansatz…
We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed universal quantum gates can be realized by using non-Abelian geometric phases. We show how a set of non-adiabatic holonomic one- and two-qubit…
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,…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…
Holonomic quantum computation exploits the geometric evolution of eigenspaces of a degenerate Hamiltonian to implement unitary evolution of computational states. In this work we introduce a framework for performing scalable quantum…