Related papers: How to experimentally evaluate the adiabatic condi…
We experimentally demonstrate a quantum communication protocol that enables frequency conversion and routing of quantum optical information in an adiabatic and thus robust way. The protocol is based on electromagnetically-induced…
We revisit the complex time method for the application to quantum dynamics as an exceptional point is encircled in the parameter space of the Hamiltonian. The basic idea of the complex time method is using complex contour integration to…
Towards better understanding of how to design efficient adiabatic quantum algorithms, we study how the adiabatic gap depends on the spectra of the initial and final Hamiltonians in a natural family of test-bed examples. We show that perhaps…
With the increasing popularity of quantum computing and in particular quantum annealing, there has been growing research to evaluate the meta-heuristic for various problems in linear algebra: from linear least squares to matrix and tensor…
Quantum computation has emerged as a powerful computational medium of our time, having demonstrated the remarkable efficiency in factoring a positive integer and searching databases faster than any currently known classical computing…
The adiabatic theorem states that if we prepare a quantum system in one of the instantaneous eigenstates then the quantum number is an adiabatic invariant and the state at a later time is equivalent to the instantaneous eigenstate at that…
Exponentially small spectral gaps are known to be the crucial bottleneck for traditional Quantum Annealing (QA) based on interpolating between two Hamiltonians, a simple driving term and the complex problem to be solved, with a linear…
We investigate the connection between local minima in the problem Hamiltonian and first order quantum phase transitions during an adiabatic quantum computation. We demonstrate how some properties of the local minima can lead to an extremely…
In this work, we provide an answer to the question: how sudden or adiabatic is a change in the frequency of a quantum harmonic oscillator (HO)? To do this, we investigate the behavior of a HO, initially in its fundamental state, by making a…
Adiabatic process has found many important applications in modern physics, the distinct merit of which is that it does not need accurate control over the timing of the process. However, it is a slow process, which limits the application in…
We discuss a toy model for adiabatic quantum computation which displays some phenomenological properties expected in more realistic implementations. This model has two free parameters: the adiabatic evolution parameter $s$ and the $\alpha$…
An adiabatic quantum algorithm is essentially given by three elements: An initial Hamiltonian with known ground state, a problem Hamiltonian whose ground state corresponds to the solution of the given problem and an evolution schedule such…
For quantum annealing, as opposed to circuit based quantum computing, the solution to a computational problem is encoded in the ground state of a quantum system. Therefore its susceptibility to environmental effects is a different but not…
We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a…
The increasing scale and nonlinearity of modern energy and power system problems pose significant challenges to classical numerical solvers. In parallel, advances in quantum and quantum-inspired hardware are expected to improve scalability…
We develop an approach to machine learning and anomaly detection via quantum adiabatic evolution. In the training phase we identify an optimal set of weak classifiers, to form a single strong classifier. In the testing phase we…
Controllable adiabatic evolution of a multi-qubit system can be used for adiabatic quantum computation (AQC). This evolution ends at a configuration where the Hamiltonian of the system encodes the solution of the problem to be solved. As a…
The NP-complete problem of the travelling salesman (TSP) is considered in the framework of quantum adiabatic computation (QAC). We first derive a remarkable lower bound for the computation time for adiabatic algorithms in general as a…
In a time-orbiting-potential magnetic trap the neutral atoms are confined by means of an inhomogeneous magnetic field superimposed to an uniform rotating one. We perform an analytic study of the atomic motion by taking into account the…
Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition…