Related papers: Non-Adiabatic Quantum Optimization for Crossing Qu…
In many quantum technologies adiabatic processes are used for coherent quantum state operations, offering inherent robustness to errors in the control parameters. The main limitation is the long operation time resulting from the requirement…
This paper presents a new hybrid Quantum Machine Learning (QML) model composed of three elements: a classical computer in charge of the data preparation and interpretation; a Gate-based Quantum Computer running the Variational Quantum…
Many years have passed since the conception of the quintessential method of shortcut to adiabaticity known as counterdiabatic driving (or transitionless quantum driving). Yet, this method appears to be energetically cost-free and thus…
A shortcut-to-adiabatic protocol for the realization of a fast and high-fidelity controlled-phase gate in Rydberg atoms is developed. The adiabatic state transfer, driven in the high-blockade limit, is sped up by compensating nonadiabatic…
Adiabatic limit is the presumption of the adiabatic geometric quantum computation and of the adiabatic quantum algorithm. But in reality, the variation speed of the Hamiltonian is finite. Here we develop a general formulation of adiabatic…
The Quantum Approximate Optimization Algorithm (QAOA) exhibits significant potential for tackling combinatorial optimization problems. Despite its promise for near-term quantum devices, a major challenge in applying QAOA lies in the cost of…
The superadiabatic quantum driving, producing a perfect adiabatic transfer on a given Hamitonian by introducing an additional Hamiltonian, is theoretically analysed for transfers within a three-level system. Our starting point is the…
The adiabatic quantum evolution of the Lipkin-Meshkov-Glick (LMG) model across its quantum critical point is studied. The dynamics is realized by linearly switching the transverse field from an initial large value towards zero and…
Quantum Annealing (QA) and QAOA are promising quantum optimisation algorithms used for finding approximate solutions to combinatorial problems on near-term NISQ systems. Many NP-hard problems can be reformulated as Quadratic Unconstrained…
Counter-diabatic driving protocols were proposed as a means to do fast changes in the Hamiltonian without exciting transitions. Such driving in principle allows one to realize arbitrarily fast annealing protocols or implement fast…
We introduce an inhomogeneous protocol to drive a weakly disordered quantum spin chain quasi-adiabatically across a quantum phase transition and minimize the residual energy of the final state. The number of spins that simultaneously reach…
To optimize the performance of a heat engine in finite-time cycle, it is important to understand the finite-time effect of thermodynamic processes. Previously, we have shown that extra work is needed to complete a quantum adiabatic process…
Adiabatic quantum algorithms must evolve slowly enough to suppress non-adiabatic transitions while remaining fast enough to be practical. In open systems, this trade-off is reshaped by decoherence. For Hamiltonians subject to dephasing…
The quantum-classical Liouville equation offers a rigorous approach to nonadiabatic quantum dynamics based on surface hopping type trajectories. However, in practice the applicability of this approach has been limited to short times owing…
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…
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…
On-the-fly quantum nonadiabatic dynamics for large systems greatly benefits from the adiabatic representation readily available from the electronic structure programs. However, frequently occurring in this representation conical…
We propose a nonadiabatic approach to quantum annealing, in which we repeat quantum annealing in nonadiabatic time scales, and collect the final states of many realizations to find the ground state among them. In this way, we replace the…
By the adiabatic theorem, the probability of non-adiabatic transitions in a time-dependent quantum system vanishes in the adiabatic limit. The Landau-Zener (LZ) formula gives the leading functional behavior of the probability close to this…
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…