Related papers: Testing quantum adiabaticity with quench echo
Adiabatic quantum control protocols have been of wide interest to quantum computation due to their robustness and insensitivity to their actual duration of execution. As an extension of previous quantum learning algorithms, this work…
The quantum Ising chain has shortcuts to adiabaticity when operated with weak processes. However, when exactly do the non-equilibrium effects of the Kibble-Zurek mechanism, inherent to the system, appear in the optimal protocols in such a…
Kibble-Zurek mechanism (KZM) is a universal framework which could in principle describe phase transition phenomenon in any system with required symmetry properties. However, a conflicting observation termed anti-KZ behavior has been…
Quantum adiabatic dynamics is the crucial element of adiabatic quantum computing and quantum annealing. Shortcuts to adiabaticity enable acceleration of the computational time by suppressing unwanted non-adiabatic processes with designed…
We argue that in a second order quantum phase transition driven by an inhomogeneous quench density of quasiparticle excitations is suppressed when velocity at which a critical point propagates across a system falls below a threshold…
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al.,…
Quantum adiabatic computation is a novel paradigm for the design of quantum algorithms, which is usually used to find the minimum of a classical function. In this paper, we show that if the initial hamiltonian of a quantum adiabatic…
A major drawback of adiabatic quantum computing (AQC) is fulfilling the energy gap constraint, which requires the total evolution time to scale inversely with the square of the minimum energy gap. Failure to satisfy this condition violates…
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…
Quantum adiabatic evolutions find a broad range of applications in quantum physics and quantum technologies. The traditional form of the quantum adiabatic theorem limits the speed of adiabatic evolution by the minimum energy gaps of the…
Quantum phase estimation (QPE) is a central algorithmic primitive that estimates eigenvalues of a Hamiltonian up to precision $\epsilon$ in Heisenberg-limited time $T=\Theta(1/\epsilon)$. Standard gate-based implementations of QPE require…
When an external parameter drives a system across a quantum phase transition at a finite rate, work is performed on the system and entropy is dissipated, due to the creation of excitations via the Kibble-Zurek mechanism. Although both 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…
The quantitative adiabatic condition (QAC), or quantitative condition, is a convenient (a priori) tool for estimating the adiabaticity of quantum evolutions. However, the range of the applicability of QAC is not well understood. It has been…
A condition on the Hamiltonian of a time-dependent quantum mechanical system is derived which, if satisfied, implies optimal adiabaticity (defined below). The condition is expressed in terms of the Hamiltonian and in terms of the evolution…
In this thesis, it is presented a set of results in adiabatic dynamics (closed and open system) and transitionless quantum driving that promote some advances in our understanding on quantum control and Hamiltonian inverse engineering. In…
We introduce an algorithm to perform an optimal adiabatic evolution that operates without an apriori knowledge of the system spectrum. By probing the system gap locally, the algorithm maximizes the evolution speed, thus minimizing the total…
Geometric quantum speed limits quantify the trade-off between the rate with which quantum states can change and the resources that are expended during the evolution. Counterdiabatic driving is a unique tool from shortcuts to adiabaticity to…
We outline an algorithm for the Quantum Counting problem using Adiabatic Quantum Computation (AQC). We show that using local adiabatic evolution, a process in which the adiabatic procedure is performed at a variable rate, the problem is…
In this paper we address the question how the Kibble-Zurek mechanism, which describes the formation of topological defects in quantum systems subjected to a quench across a critical point, is generalized to the same scenario but for…