Related papers: Adiabatic Quantum Counting by Geometric Phase Esti…
We study the geometric curvature and phase of the Rabi model. Under the rotating-wave approximation (RWA), we apply the gauge independent Berry curvature over a surface integral to calculate the Berry phase of the eigenstates for both…
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 paper we show that the performance of the quantum adiabatic algorithm is determined by phase transitions in underlying problem in the presence of transverse magnetic field $\Gamma$. We show that the quantum version of random…
Many artificial intelligence (AI) problems naturally map to NP-hard optimization problems. This has the interesting consequence that enabling human-level capability in machines often requires systems that can handle formally intractable…
We look at the time dependent fluctuations of the electrical charge in an open 1D quantum system represented by a quantum dot experiencing random lateral motion. In essentially non-adiabatic settings we study both diffusive and ballistic…
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…
Most investigations devoted to the conditions for adiabatic quantum computing are based on the first-order correction ${\bra{\Psi_{\rm ground}(t)}\dot H(t)\ket{\Psi_{\rm excited}(t)} /\Delta E^2(t)\ll1}$. However, it is demonstrated that…
In a recent Letter [Phys. Rev. Lett. {\bf 95}, 080502 (2005)], an interesting scheme was proposed to implement a type of conditional quantum phase gates with built-in fault-tolerant feature via adiabatic evolution of dark eigenstates. In…
Quantum mechanical phases arising from a periodically varying Hamiltonian are considered. These phases are derived from the eigenvalues of a stationary, ``dressed'' Hamiltonian that is able to treat internal atomic or molecular structure in…
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…
This paper describes how to make the problem of binary classification amenable to quantum computing. A formulation is employed in which the binary classifier is constructed as a thresholded linear superposition of a set of weak classifiers.…
Computing using a continuous-time evolution, based on the natural interaction Hamiltonian of the quantum computer hardware, is a promising route to building useful quantum computers in the near-term. Adiabatic quantum computing, quantum…
Adiabatic quantum computation for performing quantum computations such as Shor's algorithm is protected against thermal errors by an energy gap of size $O(1/n)$, where $n$ is the length of the computation to be performed.
Counterdiabatic driving emerges as a valuable technique for implementing shortcuts to adiabaticity protocols, enhancing quantum technology applications. In this context, counterdiabatic quantum computing represents a new paradigm with the…
Symmetry protected quantization of the Berry phase is discussed in relation to edge states. Assuming an existence of some adiabatic process which protects quantization of the Berry phase, non trivial Berry phase $\gamma=\pm 2\pi\rho$…
Adiabatic quantum optimization offers a new method for solving hard optimization problems. In this paper we calculate median adiabatic times (in seconds) determined by the minimum gap during the adiabatic quantum optimization for an NP-hard…
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.…
A three-dimensional anisotropic quantum well placed in an adiabatically precessing uniform magnetic field is considered and an explicit formula for the Berry phase is obtained. To get the Berry phase, a purely algebraic algorithm of…
The quantum speed limit specifies a universal bound of the fidelity between the initial state and the time-evolved state. We apply this method to find a bound of the fidelity between the adiabatic state and the time-evolved state. The bound…
We numerically study quantum adiabatic algorithm for the propositional satisfiability. A new class of previously unknown hard instances is identified among random problems. We numerically find that the running time for such instances grows…