Related papers: Nonadiabatic quantum state engineering driven by f…
We introduce two methods for speeding up adiabatic quantum computations by increasing the energy between the ground and first excited states. Our methods are even more general. They can be used to shift a Hamiltonian's density of states…
Speeding up adiabatic method has attracted much attention with the wide applications in quantum information processing. In this paper, two kinds of methods, Lewis-Riesenfeld invariant-based inverse engineering and transitionless quantum…
The main challenge in deterministic quantum state transfer in long-distance quantum communications is the transmission losses in the communication channel. To overcome this limitation, here we use the adiabatic theorem and find a lossless…
We propose a quantum Monte Carlo (QMC) algorithm for non-equilibrium dynamics in a system with a parameter varying as a function of time. The method is based on successive applications of an evolving Hamiltonian to an initial state and…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
For adiabatic controls of quantum systems, the non-adiabatic transitions are reduced by increasing the operation time of processes. Perfect quantum adiabaticity usually requires the infinitely slow variation of control parameters. In this…
Preparing the ground state of a Hamiltonian is a problem of great significance in physics with deep implications in the field of combinatorial optimization. The adiabatic algorithm is known to return the ground state for sufficiently long…
The propagation of errors severely compromises the reliability of quantum computations. The quantum adiabatic algorithm is a physically motivated method to prepare ground states of classical and quantum Hamiltonians. Here, we analyze the…
Classical optimization problems can be solved by adiabatically preparing the ground state of a quantum Hamiltonian that encodes the problem. The performance of this approach is determined by the smallest gap encountered during the…
We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state $\vert x \rangle$ that is proportional to the solution of the system of linear equations $A…
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…
Adiabatic transport provides a powerful way to manipulate quantum states. By preparing a system in a readily initialised state and then slowly changing its Hamiltonian, one may achieve quantum states that would otherwise be inaccessible.…
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 propose a variational principle to compute a quantum adiabatic brachistochrone (QAB) for open systems. Using the notion of "adiabatic speed" based on the energy gaps, we derive a Lagrangian associated to the functional measuring the time…
Adiabatic quantum computing enables the preparation of many-body ground states. This is key for applications in chemistry, materials science, and beyond. Realisation poses major experimental challenges: Direct analog implementation requires…
Crossing a quantum critical point in finite time challenges the adiabatic condition due to the closing of the energy gap, which ultimately results in the formation of excitations. Such non-adiabatic excitations are typically deemed…
Achieving effectively adiabatic dynamics is a ubiquitous goal in almost all areas of quantum physics. Here, we study the speed with which a quantum system can be driven when employing transitionless quantum driving. As a main result, we…
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quantum state generation'. This approach provides intriguing links…
Ultrastrongly coupled quantum hardware may increase the speed of quantum state processing in distributed architectures, allowing to approach fault-tolerant threshold. We show that circuit QED architectures in the ultrastrong coupling…
Understanding heat transfer between a quantum system and its environment is of undisputed importance if reliable quantum devices are to be constructed. Here, we investigate the heat transfer between system and bath in non-Markovian open…