Related papers: Adiabatic Approximation for weakly open systems
We generalize nonadiabatic holonomic quantum computation in a resonant $\Lambda$ configuration proposed in [New J. Phys. 14 (2012) 103035] to the case of off-resonant driving lasers. We show that any single-qubit holonomic gate can be…
The two-level quantum system (qubit) in a precessing magnetic field and in contact with a heat bath is investigated. The exact reduced dynamics for the qubit in question is obtained. We apply the approach based on the block operator…
In the circuit model of quantum computing, amplitude amplification techniques can be used to find solutions to NP-hard problems defined on $n$-bits in time $\text{poly}(n) 2^{n/2}$. In this work, we investigate whether such general…
The nonadiabatic holonomic quantum computation based on three-level systems has wide applicability experimentally due to its simpler energy level structure requirement and inherent robustness from the geometric phase. However, in previous…
The unitary operator corresponding to the classical canonical transformation that connects a general closed system to an open system under adiabatic conditions is found. The quantum invariant operator of the adiabatic open system is derived…
We revisit the adiabatic criterion in stimulated Raman adiabatic passage for the three-level $\Lambda$-system, and compare the situation with and without nonlinearity. In linear systems, the adiabatic condition is derived with the help of…
We introduce an algorithm to perform an optimal adiabatic evolution that operates without an apriori knowledge of the system spectrum. By probing the system gap locally, the algorithm maximizes the evolution speed, thus minimizing the total…
Marzlin and Sanders \cite{marzlin} have shown rigorously that the adiabatic approximation can be very inaccurate when applied to a Hamiltonian $H(t)$ that generates the evolution $U^{\dagger} (t)$ even if it gives an excellent approximation…
We summarize our results on decoherence for short- to intermediate-time dynamics of an externally controlled two-state quantum system - a qubit - interacting with thermal bosonic environment. The developed approximation schemes are…
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…
We formulate an adiabatic theorem adapted to models that present an instantaneous eigenvalue experiencing an infinite number of crossings with the rest of the spectrum. We give an upper bound on the leading correction terms with respect to…
Quantum algorithms are prominent in the pursuit of achieving quantum advantage in various computational tasks. However, addressing challenges, such as limited qubit coherence and high error rate in near-term devices, requires extensive…
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state which tends to the solution [Farhi et al.,…
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of steps growing only as the cube of the number of variables,…
We introduce a shortcut to the adiabatic gate teleportation model of quantum computation. More specifically, we determine fast local counterdiabatic Hamiltonians able to implement teleportation as a universal computational primitive. In…
In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator…
We present details and expand on the framework leading to the recently introduced degenerate adiabatic perturbation theory [Phys. Rev. Lett. 104, 170406 (2010)], and on the formulation of the degenerate adiabatic theorem, along with its…
The challenge in building high-fidelity quantum gates lies in overcoming control errors and decoherence effects caused by the coupling between the quantum system and the external environment. Nonadiabatic holonomic quantum computation uses…
We implement a non-adiabatic universal set of holonomic quantum gates based on abelian holonomies using dynamical invariants, by Lie-algebraic methods. Unlike previous implementations, presented scheme does not rely on secondary methods…
Quantum adiabatic evolution algorithm suggested by Farhi et al. was effective in solving instances of NP-complete problems. The algorithm is governed by the adiabatic theorem. Therefore, in order to reduce the running time, it is essential…