Practical challenges in simulating quantum systems on classical computers have been
widely recognized in the quantum physics and quantum chemistry communities over the …

Shortcuts to adiabaticity (STA) are fast routes to the final results of slow, adiabatic changes
of the controlling parameters of a system. The shortcuts are designed by a set of analytical …

Here we explore which heuristic quantum algorithms for combinatorial optimization might be
most practical to try out on a small fault-tolerant quantum computer. We compile circuits for …

We introduce a shortcut to the adiabatic gate teleportation model of quantum computation.
More specifically, we determine fast local counterdiabatic Hamiltonians able to implement …

The state of an open quantum system undergoing an adiabatic process evolves by following
the instantaneous stationary state of its time-dependent generator. This observation allows …

Shortcuts to adiabaticity let a system reach the results of a slow adiabatic process in a
shorter time. We propose to quantify the “energy cost” of the shortcut by the energy …

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 …

It is known that high intensity fields are usually required to implement shortcuts to
adiabaticity via transitionless quantum driving (TQD). Here, we show that this requirement …

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 …

We discuss the energetic cost of superadiabatic models of quantum computation.
Specifically, we investigate the energy–time complementarity in general transitionless …