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

Europhysics Letters (EPL)

Quantum gates by adiabatic and superadiabatic probabilistic controlled evolutions

Abderrahim Benmachiche, Alan C. Santos, Azeddine Messikh, Mohamed Ridza Wahiddin

Published Jun 1, 2021• 0 citations
Publisher

Abstract

\n\nAdiabatic and superadiabatic controlled evolutions are used as universal models for quantum computations, where an auxiliary system is used as the main resource in the theory. While the adiabatic case demands a slow dynamics (so that the adiabatic theorem is satisfied), the superadiabatic model can speed up such process by spending more energy than the adiabatic one. In this paper, we explore a hybrid scheme of controlled evolutions and measurement in order to optimize the thermodynamic cost of implementing quantum gates. By adjusting a free parameter of the theory of controlled evolutions, we show that we can improve the energy cost of the evolution. To this end, we used a model of computation based on adiabatic/superadiabatic evolution and post-selection measurement on the auxiliary qubit. In both cases, adiabatic and superadiabatic, the probabilistic model allows for optimizing the thermodynamics cost of implementing gates. When the system reservoir interaction is taken into account, we show that the superadiabatic probabilistic model is more robust than the adiabatic one.\n

DOI
10.1209/0295-5075/134/50005

Related papers

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

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

Implementation Of Quantum Rotation Gates Using Controlled Non-Adiabatic Evolutions

Abdelrahman A. H. Abdelrahim, Gharib S. Mahmoud, Sherzod Turaev +1 more

Quantum gates are the basic building blocks in the quantum circuits model. These gates can be implemented using adiabatic or non adiabatic processes. Adiabatic models can be controlled using auxiliary qubits, whereas non adiabatic models can be simplified by using one single-shot implementation. In this paper, the controlled adiabatic evolutions is combined with the single-shot implementation to obtain quantum gates with controlled non adiabatic evolutions. This is an important improvement which can speed the implementation of quantum gates and reduce the errors due to the long run in the adiabatic model. The robustness of our scheme to different types of errors is also investigated.

•Jan 29, 2018•0 citations

Superadiabatic control of quantum operations

Jonathan Vandermause, Chandrasekhar Ramanathan

Adiabatic pulses are used extensively to enable robust control of quantum operations. We introduce an approach to adiabatic control that uses the superadiabatic quality factor as a performance metric to design robust, high-fidelity pulses. This approach permits the systematic design of quantum control schemes to maximize the adiabaticity of a unitary operation in a particular time interval given the available control resources. The interplay between adiabaticity, fidelity, and robustness of the resulting pulses is examined for the case of single-qubit inversion, and superadiabatic pulses are demonstrated to have improved robustness to control errors. A numerical search strategy is developed to find a broader class of adiabatic operations, including multiqubit adiabatic unitaries. We illustrate the utility of this search strategy by designing control waveforms that adiabatically implement a two-qubit entangling gate for a model NMR system.

arXiv:1512.04642•Physical Review A•May 20, 2016•11 citations

Shortcut to adiabatic gate teleportation

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

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.

arXiv:1511.03301•Physical Review A•Jan 8, 2016•80 citations
\n\nAdiabatic and superadiabatic controlled evolutions are used as universal models for quantum computations, where an auxiliary system is used as the main resource in the theory. While the adiabatic case demands a slow dynamics (so that the adiabatic theorem is satisfied), the superadiabatic model can speed up such process by spending more energy than the adiabatic one. In this paper, we explore a hybrid scheme of controlled evolutions and measurement in order to optimize the thermodynamic cost of implementing quantum gates. By adjusting a free parameter of the theory of controlled evolutions, we show that we can improve the energy cost of the evolution. To this end, we used a model of computation based on adiabatic/superadiabatic evolution and post-selection measurement on the auxiliary qubit. In both cases, adiabatic and superadiabatic, the probabilistic model allows for optimizing the thermodynamics cost of implementing gates. When the system reservoir interaction is taken into account, we show that the superadiabatic probabilistic model is more robust than the adiabatic one.\n
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.
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.
Quantum gates are the basic building blocks in the quantum circuits model. These gates can be implemented using adiabatic or non adiabatic processes. Adiabatic models can be controlled using auxiliary qubits, whereas non adiabatic models can be simplified by using one single-shot implementation. In this paper, the controlled adiabatic evolutions is combined with the single-shot implementation to obtain quantum gates with controlled non adiabatic evolutions. This is an important improvement which can speed the implementation of quantum gates and reduce the errors due to the long run in the adiabatic model. The robustness of our scheme to different types of errors is also investigated.
Adiabatic pulses are used extensively to enable robust control of quantum operations. We introduce an approach to adiabatic control that uses the superadiabatic quality factor as a performance metric to design robust, high-fidelity pulses. This approach permits the systematic design of quantum control schemes to maximize the adiabaticity of a unitary operation in a particular time interval given the available control resources. The interplay between adiabaticity, fidelity, and robustness of the resulting pulses is examined for the case of single-qubit inversion, and superadiabatic pulses are demonstrated to have improved robustness to control errors. A numerical search strategy is developed to find a broader class of adiabatic operations, including multiqubit adiabatic unitaries. We illustrate the utility of this search strategy by designing control waveforms that adiabatically implement a two-qubit entangling gate for a model NMR system.
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.