Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1511.03301 · Physical Review A

Shortcut to adiabatic gate teleportation

Alan C. Santos, Raphael D. Silva, M. S. Sarandy

Published Jan 8, 2016• 80 citations
arXivHTMLPDF

Abstract

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 this scenario, we provide the counterdiabatic driving for arbitrary $n$-qubit gates, which allows to achieve universality through a variety of gate sets. Remarkably, our approach maps the superadiabatic Hamiltonian ${H}_{\text{SA}}$ for an arbitrary $n$-qubit gate teleportation into the implementation of a rotated superadiabatic dynamics of an $n$-qubit state teleportation. This result is rather general, with the speed of the evolution only dictated by the quantum speed limit. In particular, we analyze the energetic cost for different Hamiltonian interpolations in the context of the energy-time complementarity.

DOI
10.1103/physreva.93.012311

Related papers

Shortcuts to adiabaticity and applications to Quantum Computation

Alan C. Santos

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 superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. In this dissertation we introduce two different models to perform universal superadiabatic quantum computing, which are based on the use of shortcuts to adiabaticity by counter-diabatic Hamiltonians. The first model is based on the use of superadiabatic quantum teleportation, introduced in this dissertation, as a primitive to quantum computing. Thus, we provide the counter-diabatic driving for arbitrary $n$-qubit gates. In addition, our approach maps the counter-diabatic Hamiltonian for an arbitrary $n$-qubit {\it gate} teleportation into the implementation of a rotated counter-diabatic Hamiltonian for an $n$-qubit {\it state} teleportation. In the second model we use the concept of controlled superadiabatic evolutions to show how we can implement arbitrary $n$-controlled quantum gates. Remarkably, this task can be performed by simple time-independent counter-diabatic Hamiltonians. These two models can be used to design different sets of universal quantum gates. We show that the use of the quantum speed limit suggests that the superadiabatic time evolution is compatible with arbitrarily small time intervals, where this arbitrariness is constrained to the energetic cost necessary to perform the superadiabatic evolution.

arXiv:1603.05071•Mar 16, 2016•0 citations

Superadiabatic Controlled Evolutions and Universal Quantum Computation

Alan C. Santos, M. S. Sarandy

Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. Here, we propose a superadiabatic route to implement universal quantum computation. Our method is based on the realization of piecewise controlled superadiabatic evolutions. Remarkably, they can be obtained by simple time-independent counter-diabatic Hamiltonians. In particular, we discuss the implementation of fast rotation gates and arbitrary n-qubit controlled gates, which can be used to design different sets of universal quantum gates. Concerning the energy cost of the superadiabatic implementation, we show that it is dictated by the quantum speed limit, providing an upper bound for the corresponding adiabatic counterparts.

arXiv:1509.04215•Scientific Reports•Oct 29, 2015•125 citations

Energetic Cost of Superadiabatic Quantum Computation

Ivan B. Coulamy, Alan C. Santos, Itay Hen +1 more

We discuss the energetic cost of superadiabatic models of quantum computation. Specifically, we investigate the energy-time complementarity in general transitionless controlled evolutions and in shortcuts to the adiabatic quantum search over an unstructured list. We show that the additional energy resources required by superadiabaticity for arbitrary controlled evolutions can be minimized by using probabilistic dynamics, so that the optimal success probability is fixed by the choice of the evolution time. In the case of analog quantum search, we show that the superadiabatic approach induces a non-oracular counter-diabatic Hamiltonian, with the same energy-time complexity as equivalent adiabatic implementations.

arXiv:1603.07778•Frontiers in ICT•Sep 15, 2016•38 citations

Parallelizable adiabatic gate teleportation

Kosuke Nakago, Michal Hajdušek, Shojun Nakayama +1 more

To investigate how a temporally ordered gate sequence can be parallelized in adiabatic implementations of quantum computation, we modify adiabatic gate teleportation, a model of quantum computation proposed by Bacon and Flammia [Phys. Rev. Lett. 103, 120504 (2009)], to a form deterministically simulating parallelized gate teleportation, which is achievable only by postselection. We introduce a twisted Heisenberg-type interaction Hamiltonian, a Heisenberg-type spin interaction where the coordinates of the second qubit are twisted according to a unitary gate. We develop parallelizable adiabatic gate teleportation (PAGT) where a sequence of unitary gates is performed in a single step of the adiabatic process. In PAGT, numeric calculations suggest the necessary time for the adiabatic evolution implementing a sequence of $L$ unitary gates increases at most as $O({L}^{5})$. However, we show that it has the interesting property that it can map the temporal order of gates to the spatial order of interactions specified by the final Hamiltonian. Using this property, we present a controlled-PAGT scheme to manipulate the order of gates by a control qubit. In the controlled-PAGT scheme, two differently ordered sequential unitary gates $FG$ and $GF$ are coherently performed depending on the state of a control qubit by simultaneously applying the twisted Heisenberg-type interaction Hamiltonians implementing unitary gates $F$ and $G$. We investigate why the twisted Heisenberg-type interaction Hamiltonian allows PAGT. We show that the twisted Heisenberg-type interaction Hamiltonian has an ability to perform a transposed unitary gate by just modifying the space ordering of the final Hamiltonian implementing a unitary gate in adiabatic gate teleportation. The dynamics generated by the time-reversed Hamiltonian represented by the transposed unitary gate enables deterministic simulation of a postselected event of parallelized gate teleportation in adiabatic implementation.

arXiv:1310.4061•Physical Review A•Dec 8, 2015•5 citations

Shortcuts to Adiabaticity in Driven Open Quantum Systems: Balanced Gain and Loss and Non-Markovian Evolution

Sahar Alipour, Aurélia Chenu, Ali T. Rezakhani +1 more

A universal scheme is introduced to speed up the dynamics of a driven open quantum system along a prescribed trajectory of interest. This framework generalizes counterdiabatic driving to open quantum processes. Shortcuts to adiabaticity designed in this fashion can be implemented in two alternative physical scenarios: one characterized by the presence of balanced gain and loss, the other involves non-Markovian dynamics with time-dependent Lindblad operators. As an illustration, we engineer superadiabatic cooling, heating, and isothermal strokes for a two-level system, and provide a protocol for the fast thermalization of a quantum oscillator.

arXiv:1907.07460•Quantum•Sep 28, 2020•84 citations

Generalized shortcuts to adiabaticity and enhanced robustness against decoherence

Alan C. Santos, M. S. Sarandy

Abstract Shortcuts to adiabaticity provide a general approach to mimic adiabatic quantum processes via arbitrarily fast evolutions in Hilbert space. For these counter-diabatic evolutions, higher speed comes at higher energy cost. Here, the counter-diabatic theory is employed as a minimal energy demanding scheme for speeding up adiabatic tasks. As a by-product, we show that this approach can be used to obtain infinite classes of transitionless models, including time-independent Hamiltonians under certain conditions over the eigenstates of the original Hamiltonian. We apply these results to investigate shortcuts to adiabaticity in decohering environments by introducing the requirement of a fixed energy resource. In this scenario, we show that generalized transitionless evolutions can be more robust against decoherence than their adiabatic counterparts. We illustrate this enhanced robustness both for the Landau–Zener model and for quantum gate Hamiltonians.

arXiv:1702.02239•Journal of Physics A Mathematical and Theoretical•Oct 30, 2017•45 citations
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 this scenario, we provide the counterdiabatic driving for arbitrary nnn-qubit gates, which allows to achieve universality through a variety of gate sets. Remarkably, our approach maps the superadiabatic Hamiltonian HSA{H}_{\text{SA}}HSA​ for an arbitrary nnn-qubit gate teleportation into the implementation of a rotated superadiabatic dynamics of an nnn-qubit state teleportation. This result is rather general, with the speed of the evolution only dictated by the quantum speed limit. In particular, we analyze the energetic cost for different Hamiltonian interpolations in the context of the energy-time complementarity.
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 superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. In this dissertation we introduce two different models to perform universal superadiabatic quantum computing, which are based on the use of shortcuts to adiabaticity by counter-diabatic Hamiltonians. The first model is based on the use of superadiabatic quantum teleportation, introduced in this dissertation, as a primitive to quantum computing. Thus, we provide the counter-diabatic driving for arbitrary nnn-qubit gates. In addition, our approach maps the counter-diabatic Hamiltonian for an arbitrary nnn-qubit {\it gate} teleportation into the implementation of a rotated counter-diabatic Hamiltonian for an nnn-qubit {\it state} teleportation. In the second model we use the concept of controlled superadiabatic evolutions to show how we can implement arbitrary nnn-controlled quantum gates. Remarkably, this task can be performed by simple time-independent counter-diabatic Hamiltonians. These two models can be used to design different sets of universal quantum gates. We show that the use of the quantum speed limit suggests that the superadiabatic time evolution is compatible with arbitrarily small time intervals, where this arbitrariness is constrained to the energetic cost necessary to perform the superadiabatic evolution.
Adiabatic state engineering is a powerful technique in quantum information and quantum control. However, its performance is limited by the adiabatic theorem of quantum mechanics. In this scenario, shortcuts to adiabaticity, such as provided by the superadiabatic theory, constitute a valuable tool to speed up the adiabatic quantum behavior. Here, we propose a superadiabatic route to implement universal quantum computation. Our method is based on the realization of piecewise controlled superadiabatic evolutions. Remarkably, they can be obtained by simple time-independent counter-diabatic Hamiltonians. In particular, we discuss the implementation of fast rotation gates and arbitrary n-qubit controlled gates, which can be used to design different sets of universal quantum gates. Concerning the energy cost of the superadiabatic implementation, we show that it is dictated by the quantum speed limit, providing an upper bound for the corresponding adiabatic counterparts.
We discuss the energetic cost of superadiabatic models of quantum computation. Specifically, we investigate the energy-time complementarity in general transitionless controlled evolutions and in shortcuts to the adiabatic quantum search over an unstructured list. We show that the additional energy resources required by superadiabaticity for arbitrary controlled evolutions can be minimized by using probabilistic dynamics, so that the optimal success probability is fixed by the choice of the evolution time. In the case of analog quantum search, we show that the superadiabatic approach induces a non-oracular counter-diabatic Hamiltonian, with the same energy-time complexity as equivalent adiabatic implementations.
To investigate how a temporally ordered gate sequence can be parallelized in adiabatic implementations of quantum computation, we modify adiabatic gate teleportation, a model of quantum computation proposed by Bacon and Flammia [Phys. Rev. Lett. 103, 120504 (2009)], to a form deterministically simulating parallelized gate teleportation, which is achievable only by postselection. We introduce a twisted Heisenberg-type interaction Hamiltonian, a Heisenberg-type spin interaction where the coordinates of the second qubit are twisted according to a unitary gate. We develop parallelizable adiabatic gate teleportation (PAGT) where a sequence of unitary gates is performed in a single step of the adiabatic process. In PAGT, numeric calculations suggest the necessary time for the adiabatic evolution implementing a sequence of LLL unitary gates increases at most as O(L5)O({L}^{5})O(L5). However, we show that it has the interesting property that it can map the temporal order of gates to the spatial order of interactions specified by the final Hamiltonian. Using this property, we present a controlled-PAGT scheme to manipulate the order of gates by a control qubit. In the controlled-PAGT scheme, two differently ordered sequential unitary gates FGFGFG and GFGFGF are coherently performed depending on the state of a control qubit by simultaneously applying the twisted Heisenberg-type interaction Hamiltonians implementing unitary gates FFF and GGG. We investigate why the twisted Heisenberg-type interaction Hamiltonian allows PAGT. We show that the twisted Heisenberg-type interaction Hamiltonian has an ability to perform a transposed unitary gate by just modifying the space ordering of the final Hamiltonian implementing a unitary gate in adiabatic gate teleportation. The dynamics generated by the time-reversed Hamiltonian represented by the transposed unitary gate enables deterministic simulation of a postselected event of parallelized gate teleportation in adiabatic implementation.
A universal scheme is introduced to speed up the dynamics of a driven open quantum system along a prescribed trajectory of interest. This framework generalizes counterdiabatic driving to open quantum processes. Shortcuts to adiabaticity designed in this fashion can be implemented in two alternative physical scenarios: one characterized by the presence of balanced gain and loss, the other involves non-Markovian dynamics with time-dependent Lindblad operators. As an illustration, we engineer superadiabatic cooling, heating, and isothermal strokes for a two-level system, and provide a protocol for the fast thermalization of a quantum oscillator.
Abstract Shortcuts to adiabaticity provide a general approach to mimic adiabatic quantum processes via arbitrarily fast evolutions in Hilbert space. For these counter-diabatic evolutions, higher speed comes at higher energy cost. Here, the counter-diabatic theory is employed as a minimal energy demanding scheme for speeding up adiabatic tasks. As a by-product, we show that this approach can be used to obtain infinite classes of transitionless models, including time-independent Hamiltonians under certain conditions over the eigenstates of the original Hamiltonian. We apply these results to investigate shortcuts to adiabaticity in decohering environments by introducing the requirement of a fixed energy resource. In this scenario, we show that generalized transitionless evolutions can be more robust against decoherence than their adiabatic counterparts. We illustrate this enhanced robustness both for the Landau–Zener model and for quantum gate Hamiltonians.