Related papers: Fighting Exponentially Small Gaps by Counterdiabat…
Motivated by the recent growing interest about the thermodynamic cost of Shortcuts to Adiabaticity (STA), we consider the cost of driving a classical system by the so-called Counterdiabatic Driving (CD). To do so, we proceed in three steps:…
Shortcuts to adiabaticity provide a general approach to mimic adiabatic quantum processes via arbitrarily fast evolutions in Hilbert space. For these counter-diabatic evolutions, higher speed comes at higher energy cost. Here, the…
We numerically study the fast spatial transport of a trapped Bose-Einstein condensate (BEC) using shortcuts-to-adiabaticity (STA) by counterdiabatic driving (CD). The trapping potential and the required auxiliary potential were simulated as…
Coherent control of complex many-body systems is critical to the development of useful quantum devices. Fast perfect state transfer can be exactly achieved through additional counterdiabatic fields. We show that the additional energetic…
The biochemical reaction networks that regulate living systems are all stochastic to varying degrees. The resulting randomness affects biological outcomes at multiple scales, from the functional states of single proteins in a cell to the…
We propose digitized-counterdiabatic quantum optimization (DCQO) to achieve polynomial enhancement over adiabatic quantum optimization for the general Ising spin-glass model, which includes the whole class of combinatorial optimization…
The quantum approximate optimization algorithm (QAOA) has proved to be an effective classical-quantum algorithm serving multiple purposes, from solving combinatorial optimization problems to finding the ground state of many-body quantum…
It is believed that the presence of anticrossings with exponentially small gaps between the lowest two energy levels of the system Hamiltonian, can render adiabatic quantum optimization inefficient. Here, we present a simple adiabatic…
We present a general approach to speed up the adiabatic process without adding the traditional counterdiabatic driving (CD) Hamiltonian. The strategy is to design an easy-to-get intermediate Hamiltonian to connect the original Hamiltonian…
Finding the exact counterdiabatic potential is, in principle, particularly demanding. Following recent progresses about variational strategies to approximate the counterdiabatic operator, in this paper we apply this technique to the quantum…
We develop a scheme of fast forward of adiabatic spin dynamics of quantum entangled states. We settle the quasi-adiabatic dynamics by adding the regularization terms to the original Hamiltonian and then accelerate it with use of a large…
In recent quantum algorithmic developments, a feedback-based approach has shown promise for preparing quantum many-body system ground states and solving combinatorial optimization problems. This method utilizes quantum Lyapunov control to…
We study the typical (median) value of the minimum gap in the quantum version of the Exact Cover problem using Quantum Monte Carlo simulations, in order to understand the complexity of the quantum adiabatic algorithm (QAA) for much larger…
We discuss dynamics of periodically-driven open quantum systems. The time evolution of the quantum state is described by the quantum master equation and the form of the dissipator is chosen so that the instantaneous stationary state is…
Resonant transverse driving of a two-level system as viewed in the rotating frame couples two degenerate states at the Rabi frequency, an amazing equivalence that emerges in quantum mechanics. While spectacularly successful at controlling…
Coordinate descent algorithms are widely used in machine learning and large-scale data analysis due to their strong optimality guarantees and impressive empirical performance in solving non-convex problems. In this work, we introduce Block…
Quantum computing holds the potential for quantum advantage in optimization problems, which requires advances in quantum algorithms and hardware specifications. Adiabatic quantum optimization is conceptually a valid solution that suffers…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
Quantum state preparation by adiabatic evolution is currently rendered ineffective by the long implementation times of the underlying quantum circuits, comparable to the decoherence time of present and near-term quantum devices. These…
Achieving high-fidelity direct two-qubit gates over meter-scale long quantum interconnects is challenging in part due to the multimode nature of such systems. One alternative scheme is to combine local operations with remote quantum state…