Related papers: Fighting Exponentially Small Gaps by Counterdiabat…
We study shortcuts to adiabaticity (STAs) through counterdiabatic driving in quantum critical systems in the presence of dissipation. We evaluate unitary as well as nonunitary controls, such that the system density matrix follows a…
The discrete variable local diabatic representation (LDR) provides a divergence-free framework for exact conical intersection dynamics simulation. In this work, we investigate the convergence with respect to the number of "nuclear" grid…
Adiabatic state preparation provides an analytical solution for generating the ground state of a target Hamiltonian, starting from an easily prepared ground state of the initial Hamiltonian. While effective for time-dependent Hamiltonians…
The quantum approximate optimization algorithm (QAOA) is a near-term hybrid algorithm intended to solve combinatorial optimization problems, such as MaxCut. QAOA can be made to mimic an adiabatic schedule, and in the $p\to\infty$ limit the…
Adiabatic quantum computing is a universal model for quantum computing whose implementation using a gate-based quantum computer requires depths that are unreachable in the early fault-tolerant era. To mitigate the limitations of near-term…
We propose here a counterdiabatic (CD) strategy for fast preparation of a state with long-range topological order by magnetic field tuning of an initial separable state. For concreteness, we consider the ground state of the honeycomb Kitaev…
Quantum annealing is a continuous-time heuristic quantum algorithm for solving or approximately solving classical optimization problems. The algorithm uses a schedule to interpolate between a driver Hamiltonian with an easy-to-prepare…
Cavity magnomechanics provides a readily-controllable hybrid system, that consisted of cavity mode, magnon mode, and phonon mode, for quantum state manipulation. To implement a fast-and-robust state transfer between the hybrid photon-magnon…
We consider a periodically driven system where the high-frequency driving protocol consists of a sequence of potentials switched on and off at different instants within a period. We explore the possibility of introducing an adiabatic…
We introduce a counterdiabatic (CD) extension of the Quantum Approximate Optimization Algorithm (QAOA) for constrained portfolio optimization. By incorporating approximate adiabatic gauge potentials generated from nested commutators of the…
Experiments on disordered alloys suggest that spin glasses can be brought into low-energy states faster by annealing quantum fluctuations than by conventional thermal annealing. Due to the importance of spin glasses as a paradigmatic…
According to the adiabatic theorem of quantum mechanics, a system initially in the ground state of a Hamiltonian remains in the ground state if one slowly changes the Hamiltonian. This can be used in principle to solve hard problems on…
We describe tensor network algorithms to optimize quantum circuits for adiabatic quantum computing. To suppress diabatic transitions, we include counterdiabatic driving in the optimization and utilize variational matrix product operators to…
Among variational quantum algorithms designed for NISQ devices, ADAPT-VQE stands out for its robustness against barren plateaus, particularly in estimating molecular ground states. On the other hand, counterdiabatic algorithms have shown…
By using transitionless quantum driving algorithm (TQDA), we present an efficient scheme for the shortcuts to the holonomic quantum computation (HQC). It works in decoherence-free subspace (DFS) and the adiabatic process can be speeded up…
Novel coordinate descent (CD) methods are proposed for minimizing nonconvex functions consisting of three terms: (i) a continuously differentiable term, (ii) a simple convex term, and (iii) a concave and continuous term. First, by extending…
Adiabatic or slowly varying gate operations are typically required in order to remain within the qubit subspace in an anharmonic oscillator. However significant speed ups are possible by using the two quadrature…
We study transitionless quantum driving in an infinite-range many-body system described by the Lipkin-Meshkov-Glick model. Despite the correlation length being always infinite the closing of the gap at the critical point makes the driving…
Excitonic transitions offer a possible route to ultrafast optical spin manipulation in coupled nanostructures. We perform here a detailed study of the three principal exciton-mediated decoherence channels for optically-controlled electron…
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…