Related papers: Parallelizable adiabatic gate teleportation
Fast robust two-qubit gate operation with low susceptibility to crosstalk are the key to scalable quantum information processing. Parametrically driven gate is inherently insensitive to crosstalk while superadiabatic control can speed up…
We propose a technique for robust and efficient navigation in the Hilbert space of entangled symmetric states of a multiparticle system with externally controllable linear and nonlinear collective interactions. A linearly changing external…
Motivated by the quantum adiabatic algorithm (QAA), we consider the scaling of the Hamiltonian gap at quantum first order transitions, generally expected to be exponentially small in the size of the system. However, we show that a quantum…
We review a scheme for the systematic design of quantum control protocols based on shortcuts to adiabaticity in few-level quantum systems. The adiabatic dynamics is accelerated by introducing high-frequency modulations in the control…
High-fidelity quantum operations are a key requirement for fault-tolerant quantum information processing. In electron spin resonance, manipulation of the quantum spin is usually achieved with time-dependent microwave fields. In contrast to…
We introduce a modified model where h-dependent artificial interface conditions, occurring at the boundary of an interaction region, allow to obtain adiabatic approximations for the relevant resonant states connected to the quantum…
We propose a single-shot conditional displacement gate between a trapped atom as the control qubit and a traveling light pulse as the target oscillator, mediated by an optical cavity. Classical driving of the atom synchronized with the…
We introduce a perturbative approach to solving the time dependent Schroedinger equation, named adiabatic perturbation theory (APT), whose zeroth order term is the quantum adiabatic approximation. The small parameter in the power series…
Optimal-control techniques and a fast-approach scheme are used to implement a collisional control phase gate in a model of cold atoms in an optical lattice, significantly reducing the gate time as compared to adiabatic evolution while…
We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) $P$ on a graph with a set of unknown marked vertices, one can define a…
We provide a theoretical study of the quantum adiabatic evolution algorithm with different evolution paths proposed in [E. Farhi, et al., arXiv:quant-ph/0208135]. The algorithm is applied to a random binary optimization problem (a version…
Holonomic quantum computation exploits the geometric evolution of eigenspaces of a degenerate Hamiltonian to implement unitary evolution of computational states. In this work we introduce a framework for performing scalable quantum…
We introduce a scheme based on adiabatic passage that allows for long-range quantum communication through tight-binding chain with always-on interaction. By adiabatically varying the external gate voltage applied on the system, the electron…
Accurate, nontrivial quantum operations on many qubits are experimentally challenging. As opposed to the standard approach of compiling larger unitaries into sequences of 2-qubit gates, we propose a protocol on Hamiltonian control fields…
We present schemes for geometric phase compensation in adiabatic passage which can be used for the implementation of quantum logic gates with atomic ensembles consisting of an arbitrary number of strongly interacting atoms. Protocols using…
Reliable entangling gates for qubits encoded in single-photon states represent a major challenge on the road to scalable quantum computing architectures based on linear optics. In this work, we present two approaches to develop…
Nonadiabatic holonomic quantum gates are high-speed and robust. Nevertheless, they were found to be more fragile than the adiabatic gates when systematic errors become dominant. Inspired by the dark-path scheme that was used to partially…
Holonomic quantum computation (HQC) offers an inherently robust approach to quantum gate implementation by exploiting quantum holonomies. While adiabatic HQC benefits from robustness against certain control errors, its long runtime limits…
We present an optimized adiabatic quantum schedule for unstructured search building on the original approach of Roland and Cerf [Phys. Rev. A 65, 042308 (2002)]. Our schedule adiabatically varies the Hamiltonian even more rapidly at the…
The adiabatic gauge potential (AGP) is the generator of unitary transformations which preserve the eigenbasis of a quantum Hamiltonian under parametric variation. While its usefulness in quantum mechanics has been thoroughly demonstrated in…