Related papers: Optimal protocols for Hamiltonian and Schr\"odinge…
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 computers in the near-term. Adiabatic quantum computing, quantum…
We put forth a notion of optimality for extracting ergotropic work, derived from an energy constraint governing the necessary dynamics for work extraction in a quantum system. Within the traditional ergotropy framework, which predicts an…
In previous implementations of adiabatic quantum algorithms using spin systems, the average Hamiltonian method with Trotter's formula was conventionally adopted to generate an effective instantaneous Hamiltonian that simulates an adiabatic…
Statistical mechanics of the discrete nonlinear Schr\"odinger equation is studied by means of analytical and numerical techniques. The lower bound of the Hamiltonian permits the construction of standard Gibbsian equilibrium measures for…
Using a global optimization algorithm we obtain spin chains with site-dependent exchange coefficients which allow almost perfect quantum state transfer between the extremes of the chains without any further time-dependent external control.…
The development of sophisticated experimental means to control nanoscale systems has motivated efforts to design driving protocols which minimize the energy dissipated to the environment. Computational models are a crucial tool in this…
High control in the preparation and manipulation of states is an experimental and theoretical important task in many quantum protocols. Shortcuts to adiabaticity methods allow to obtain desirable states of a adiabatic dynamics but in short…
We study feedback control of classical Hamiltonian systems with the controlling parameter varying slowly in time. The control aims to change system's energy. We show that the control problems can be solved with help of an adiabatic…
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…
The adiabatic quantum algorithm has drawn intense interest as a potential approach to accelerating optimization tasks using quantum computation. The algorithm is most naturally realised in systems which support Hamiltonian evolution, rather…
In quantum information processing, the development of fast and robust control schemes remains a central challenge. Although quantum adiabatic evolution is inherently robust against control errors, it typically demands long evolution times.…
We apply the theory of optimal control to the dynamics of two "gmon" qubits, with the goal of preparing a desired entangled ground state from an initial unentangled one. Given an initial state, a target state, and a Hamiltonian with a set…
Towards better understanding of how to design efficient adiabatic quantum algorithms, we study how the adiabatic gap depends on the spectra of the initial and final Hamiltonians in a natural family of test-bed examples. We show that perhaps…
Transferring a physical system from an initial to a final state while minimizing energetic losses is an interdisciplinary control problem that bridges stochastic thermodynamics and optimal transport theory. Recent research typically…
Quantum Annealing (QA) and the Quantum Approximate Optimization Algorithm (QAOA) are two special cases of the following control problem: apply a combination of two Hamiltonians to minimize the energy of a quantum state. Which is more…
Whether one is interested in quantum state preparation or in the design of efficient heat engines, adiabatic (reversible) transformations play a pivotal role in minimizing computational complexity and energy losses. Understanding the…
We optimize finite-time stochastic heat engines with a periodically scaled Hamiltonian under experimentally motivated constraints on the bath temperature $T$ and the scaling parameter $\lambda$. We present a general geometric proof that…
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential…
It is known that for multi-level time-dependent quantum systems one can construct superadiabatic representations in which the coupling between separated levels is exponentially small in the adiabatic limit. For a family of two-state systems…
The proposal of the optical scheme for holonomic quantum computation is evaluated based on dynamical resolution to the system beyond adiabatic limitation. The time-dependent Schr\"{o}dinger equation is exactly solved by virtue of the…