Related papers: A numerical approach for calculating exact non-adi…
We clarify that the nonadiabatic scheme based on a parallel extension of the adiabatic scenario cannot realize the desired goal of quantum computation.
Adiabatic processes driven by non-Hermitian, time-dependent Hamiltonians may be sped up by generalizing inverse engineering techniques based on Berry's transitionless driving algorithm or on dynamical invariants. We work out the basic…
Quantum enhanced sensing provides a powerful tool for the precise measurement of physical parameters that is applicable in many areas of science and technology. The achievable gain in sensitivity is largely limited by the influence of noise…
Quantum fluctuations driven by non-stoquastic Hamiltonians have been conjectured to be an important and perhaps essential missing ingredient for achieving a quantum advantage with adiabatic optimization. We introduce a transformation that…
Adiabatic pumping is characterized by a geometric contribution to the pumped charge, which can be non-zero even in the absence of a bias. However, as the driving speed is increased, non-adiabatic excitations gradually reduce the pumped…
We present a new quantum adiabatic theorem that allows one to rigorously bound the adiabatic timescale for a variety of systems, including those described by unbounded Hamiltonians. Our bound is geared towards the qubit approximation of…
Quantum computation is an attractive front for many problems that are intractable for computers today. One such problem is nonadiabatic quantum molecular dynamics, where quantized internal states coupling to parameterized modes result in a…
Adiabatic evolution is a powerful technique in quantum information and computation. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the…
The quantum geometric tensor (QGT) fundamentally encodes the geometry and topology of quantum states in both Hermitian and non-Hermitian regimes. While adiabatic perturbation theory links its real part (quantum metric) and imaginary part…
The geometric phase stands as a foundational concept in quantum physics, revealing deep connections between geometric structures and quantum dynamical evolution. Unlike dynamical phases, geometric phases exhibit intrinsic resilience to…
Adiabatic quantum computing (AQC) is a promising approach for discrete and often NP-hard optimization problems. Current AQCs allow to implement problems of research interest, which has sparked the development of quantum representations for…
We consider slowly evolving, i.e. ADIABATIC, operational regime within a transmission level (continental scale) natural gas pipeline system. This allows us to introduce a set of nodal equations of reduced complexity describing gas…
Geometric phases, which are ubiquitous in quantum mechanics, are commonly more than only scalar quantities. Indeed, often they are matrix-valued objects that are connected with non-Abelian geometries. Here we show how generalized,…
Quantum technologies based on adiabatic techniques can be highly effective, but often at the cost of being very slow. Here we introduce a set of experimentally realistic, non-adiabatic protocols for spatial state preparation, which yield…
We discuss bounds for nonadiabatic transitions from the viewpoints of the adiabatic perturbation theory and the quantum speed limit. We show that the amount of nonadiabatic transitions from the $n$th level to the $m$th level is bounded by a…
The parametric deformations of quasienergies and eigenvectors of unitary operators are applied to the design of quantum adiabatic algorithms. The conventional, standard adiabatic quantum computation proceeds along eigenenergies of…
We design an adiabatic quantum algorithm for the counting problem, i.e., approximating the proportion, $\alpha$, of the marked items in a given database. As the quantum system undergoes a designed cyclic adiabatic evolution, it acquires a…
In Amin and Choi \cite{AC09}, we show that an adiabatic quantum algorithm for the NP-hard maximum independent set (MIS) problem on a set of special family of graphs in which there are exponentially many local maxima would have the…
We develop a non-adiabatic generalization of holonomic quantum computation in which high-speed universal quantum gates can be realized by using non-Abelian geometric phases. We show how a set of non-adiabatic holonomic one- and two-qubit…
We map adiabatic quantum evolution on the classical Hamiltonian dynamics of a 1D gas (Pechukas gas) and simulate the latter numerically. This approach turns out to be both insightful and numerically efficient, as seen from our example of a…