Related papers: Shortcuts to nonabelian braiding
When a quantum system is driven adiabatically through a parametric cycle in a degenerate Hilbert space, the state would acquire a non-Abelian geometric phase, which is stable and forms the foundation for holonomic quantum computation (HQC).…
Low-energy Hamiltonians with a linear crossing in their energy dispersion (dubbed Dirac Hamiltonians) have recently been the subject of intense investigations. The linear dispersion is often the result of an approximation in the energy…
Non-Abelian topological phases (NATPs) are highly sought-after candidate states for quantum computing and communication while lacking straightforward configuration and manipulation, especially for classical waves. In this work, we exploit…
We present a general approach to speed up the adiabatic process without adding the traditional counterdiabatic driving (CD) Hamiltonian. The strategy is to design an easy-to-get intermediate Hamiltonian to connect the original Hamiltonian…
Adiabatic process has found many important applications in modern physics, the distinct merit of which is that it does not need accurate control over the timing of the process. However, it is a slow process, which limits the application in…
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a…
Application of the adiabatic model of quantum computation requires efficient encoding of the solution to computational problems into the lowest eigenstate of a Hamiltonian that supports universal adiabatic quantum computation. Experimental…
Shortcuts to adiabaticity provide fast protocols for quantum state preparation in which the use of auxiliary counterdiabatic controls circumvents the requirement of slow driving in adiabatic strategies. While their development is well…
Many trial wavefunctions for fractional quantum Hall states in a single Landau level are given by functions called conformal blocks, taken from some conformal field theory. Also, wavefunctions for certain paired states of fermions in two…
This paper is devoted to a generalisation of the quantum adiabatic theorem to a nonlinear setting. We consider a Hamiltonian operator which depends on the time variable and on a finite number of parameters and acts on a separable Hilbert…
Optimal truncations of asymptotic expansions are known to yield approximations to adiabatic quantum evolutions that are accurate up to exponentially small errors. In this paper, we rigorously determine the leading order non--adiabatic…
We introduce a simple framework for estimating lower bounds on the runtime of a broad class of adiabatic quantum algorithms. The central formula consists of calculating the variance of the final Hamiltonian with respect to the initial…
For an electrically driven electron confined in a nanowire quantum dot with spin-orbit coupling (SOC), we find a SOC-magnetism phase-locked condition under which we derive a complete set of Schr\"odinger kitten states which contains some…
Most investigations devoted to the conditions for adiabatic quantum computing are based on the first-order correction ${\bra{\Psi_{\rm ground}(t)}\dot H(t)\ket{\Psi_{\rm excited}(t)} /\Delta E^2(t)\ll1}$. However, it is demonstrated that…
By stating the adiabatic theorem of quantum mechanics in a clear and rigorous way, we establish a necessary condition and a sufficient condition for its validity, where the latter is obtained employing our recently developed adiabatic…
We formulate the non-Abelian Berry connection (tensor $\mathbb R$) and phase (matrix $\boldsymbol \Gamma$) for a multiband system and apply them to semiconductor holes under the coexistence of Rashba and Dresselhaus spin-orbit interactions.…
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 describe a general methodology for enhancing the efficiency of adiabatic quantum computations (AQC). It consists of homotopically deforming the original "Hamiltonian surface" in a way that the redistribution of the Gaussian curvature…
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…
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…