Related papers: Rotated ansatz for approximate counterdiabatic dri…
Adiabatic transformation can be approximated as alternating unitary operators of a Hamiltonian and its parameter derivative as proposed in a gate-based approach to counterdiabatic driving (van Vreumingen, arXiv:2406.08064). In this paper,…
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…
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…
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…
Robust and efficient eigenstate preparation is a central challenge in quantum simulation. The Rodeo Algorithm (RA) offers exponential convergence to a target eigenstate but suffers from poor performance when the initial state has low…
Local counterdiabatic driving is a method of improving the performance of adiabatic control and digital implementation of quantum annealing with local counterdiabatic driving has been discussed. In this paper, we propose a decomposition…
Counterdiabatic driving emerges as a valuable technique for implementing shortcuts to adiabaticity protocols, enhancing quantum technology applications. In this context, counterdiabatic quantum computing represents a new paradigm with the…
A shortcut to adiabaticity (STA) is concerned with the fast and robust manipulation of the dynamics of a quantum system that reproduces the effect of an adiabatic process. A recently proposed method enables the generation of shortcuts from…
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…
At present, several models for quantum computation have been proposed. Adiabatic quantum computation scheme particularly offers this possibility and is based on a slow enough time evolution of the system, where no transitions take place. In…
Shortcuts to Adiabaticity (STA) constitute driving schemes that provide an alternative to adiabatic protocols to control and guide the dynamics of classical and quantum systems without the requirement of slow driving. Research on STA…
Shortcuts to adiabaticity (STA) make the fast preparation of many-body states possible, circumventing the limitations of adiabatic strategies. We propose a fast STA protocol for generating interacting states in the Tomonaga-Luttinger liquid…
Quantum refrigerators pump heat from a cold to a hot reservoir. In the few-particle regime, counter-diabatic (CD) driving of, originally adiabatic, work-exchange strokes is a promising candidate to overcome the bottleneck of vanishing…
A shortcut-to-adiabaticity is compared with a numerically optimized protocol for implementing a high-fidelity quantum gate on Rydberg atoms. The counterdiabatic method offers an analytical framework for accelerating high-fidelity gates by…
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…
This thesis investigates quantum algorithms for eigenstate preparation, with a focus on solving eigenvalue problems such as the Schrodinger equation by utilizing near-term quantum computing devices. These problems are ubiquitous in several…
Counterdiabatic (CD) driving is a powerful technique for accelerating adiabatic quantum computing. However, it becomes self-limiting in complex optimizations like the Sherrington-Kirkpatrick model: long evolution times $T$ needed to…
The evolution of a system induced by counter-diabatic driving mimics the adiabatic dynamics without the requirement of slow driving. Engineering it involves diagonalizing the instantaneous Hamiltonian of the system and results in the need…
The quantum adiabatic method, which maintains populations in their instantaneous eigenstates throughout the state evolution, is an established and often a preferred choice for state preparation and manipulation. Though it minimizes the…
We present a quantum algorithm for adiabatic state preparation on a gate-based quantum computer, with complexity polylogarithmic in the inverse error. Our algorithm digitally simulates the adiabatic evolution between two self-adjoint…