Related papers: Numerically Optimizing Shortcuts to Adiabaticity: …
Quantum annealing is guaranteed to find the ground state of optimization problems in the adiabatic limit. Recent work [Phys. Rev. X 6, 031010 (2016)] has found that for some barrier tunneling problems, quantum annealing can be run much…
Adiabatic quantum computers can solve difficult optimization problems (e.g., the quadratic unconstrained binary optimization problem), and they seem well suited to train machine learning models. In this paper, we describe an adiabatic…
A major challenge in quantum computing is to solve general problems with limited physical hardware. Here, we implement digitized adiabatic quantum computing, combining the generality of the adiabatic algorithm with the universality of the…
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 consumption of the system enlarged by including the control…
- In this paper we introduce a new method to solve fixed-delay optimal control problems which exploits numerical homotopy procedures. It is known that solving this kind of problems via indirect methods is complex and computationally…
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…
In this thesis, it is presented a set of results in adiabatic dynamics (closed and open system) and transitionless quantum driving that promote some advances in our understanding on quantum control and Hamiltonian inverse engineering. In…
Efficient control schemes that enable fast, high-fidelity operations are essential for any practical quantum computation. However, current optimization protocols are intractable due to stringent requirements imposed by the microscopic…
We propose a simple construction of shortcuts to adiabaticity tracking instantaneous stationary states in classical spin systems without knowing tracked stationary states. In our construction, control fields of counter-diabatic driving are…
Control of quantum operations is a crucial yet expensive construct for quantum computation. Efficient implementations of controlled operations often avoid applying control to certain subcircuits, which can significantly reduce the number of…
Quantum state transformations that are robust to experimental imperfections are important for applications in quantum information science and quantum sensing. Counterdiabatic (CD) approaches, which use knowledge of the underlying system…
Quantum optimization is the most mature quantum computing technology to date, providing a promising approach towards efficiently solving complex combinatorial problems. Methods such as adiabatic quantum computing (AQC) have been employed in…
We propose analog counterdiabatic quantum computing (ACQC) to tackle combinatorial optimization problems on neutral-atom quantum processors. While these devices allow for the use of hundreds of qubits, adiabatic quantum computing struggles…
Shortcuts to adiabaticity are strategies for conserving adiabatic invariants under non-adiabatic (i.e. fast-driving) conditions. Here, we show how to extend classical, Hamiltonian shortcuts to adiabaticity to allow the crossing of a…
The need for fast and robust quantum state transfer is an essential element in scalable quantum information processing, leading to widespread interest in shortcuts to adiabaticity for speeding up adiabatic quantum protocols. However,…
Suppressing unwanted transitions out of the instantaneous ground state is a major challenge in unitary adiabatic quantum computation. A recent approach consists in building counterdiabatic potentials approximated using variational…
Optimal control is a central problem in quantum thermodynamics. When minimizing dissipated work and work fluctuations defined via the two-point measurement scheme in open quantum systems, existing approaches largely focus on the rapid- and…
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…
Quantum adiabatic optimization seeks to solve combinatorial problems using quantum dynamics, requiring the Hamiltonian of the system to align with the problem of interest. However, these Hamiltonians are often incompatible with the native…
Shortcuts to adiabaticity have been proposed to speed up the "slow" adiabatic transport of an atom or a wave packet of atoms. However, the freedom of the inverse engineering approach with appropriate boundary conditions provides thousands…