Related papers: Quantum Speed-Up at Zero Temperature via Coherent …
One of the distinct features of quantum mechanics is that the probability amplitude can have both positive and negative signs, which has no classical counterpart as the classical probability must be positive. Consequently, one possible way…
Quantum adiabatic transfer is widely used in quantum computation and quantum simulation. However, the transfer speed is limited by the quantum adiabatic approximation condition, which hinders its application in quantum systems with a short…
It is generally believed that a generic system can be reversibly transformed from one state into another by sufficiently slow change of parameters. A standard argument favoring this assertion is based on a possibility to expand the energy…
We propose a protocol for quantum adiabatic optimization, whereby an intermediary Hamiltonian that is diagonal in the computational basis is turned on and off during the interpolation. This `diagonal catalyst' serves to bias the energy…
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…
Adiabatic processes can keep the quantum system in its instantaneous eigenstate, which is robust to noises and dissipation. However, it is limited by sufficiently slow evolution. Here, we experimentally demonstrate the transitionless…
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…
When parameters are varied periodically, charge can be pumped through a mesoscopic conductor without applied bias. Here, we consider the inverse effect in which a transport current drives a periodic variation of an adiabatic degree of…
Adiabatic quantum computation is based on the adiabatic evolution of quantum systems. We analyse a particular class of qauntum adiabatic evolutions where either the initial or final Hamiltonian is a one-dimensional projector Hamiltonian on…
In quantum information and computation, a central challenge is to determine which quantum states can be transformed into one another under restricted sets of free operations. While many transformations are impossible directly, catalytic…
We solve a model that has basic features that are desired for quantum annealing computations: entanglement in the ground state, controllable annealing speed, ground state energy separated by a gap during the whole evolution, and a…
Universal speeded-up adiabatic geometric quantum computation~(SAGQC) is studied in $\Lambda$-type three-level system with different coupling cases, i.e., time-dependent detuning, large detuning and one-photon resonance couplings,…
Estimating transition rates in open quantum systems is hampered by computing-resource demands that grow rapidly with system size. We present a quantum-simulation framework that enables efficient estimation by recasting the transition rate,…
The traditional quantum speed limits are not attainable for many physical processes, as they tend to be loose and fail to determine the exact time taken by quantum systems to evolve. To address this, we derive exact quantum speed limits for…
Introducing a nonstoquastic catalyst is a promising avenue to improve quantum annealing with the transverse field. In the present paper, we propose a nonstoquastic catalyst for bifurcation-based quantum annealing described by the spin-1…
Catalytic coherence transformations allow the otherwise impossible state transformations using only incoherent operations with the aid of an auxiliary system with finite coherence which is not being consumed in anyway. Here we find the…
We present a scheme for speeding up quantum measurement. The scheme builds on previous protocols that entangle the system to be measured with ancillary systems. In the idealised situation of perfect entangling operations and no decoherence,…
State preparation plays a pivotal role in numerous quantum algorithms, including quantum phase estimation. This paper extends and benchmarks counterdiabatic driving protocols across three one-dimensional spin systems characterized by phase…
We extend the concept of superadiabatic dynamics, or transitionless quantum driving, to quantum open systems whose evolution is governed by a master equation in the Lindblad form. We provide the general framework needed to determine the…
The high-speed implementation and robustness against of non-adiabatic holonomic quantum computation provide a new idea for overcoming the difficulty of quantum system interacting with the environment easily decoherence, which realizing…