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:1509.04215 · Scientific Reports

Superadiabatic Controlled Evolutions and Universal Quantum Computation

Alan C. Santos, M. S. Sarandy

Published Oct 29, 2015• 125 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1038/srep15775

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

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

Quantum gates by adiabatic and superadiabatic probabilistic controlled evolutions

Abderrahim Benmachiche, Alan C. Santos, Azeddine Messikh +1 more

\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

Europhysics Letters (EPL)•Jun 1, 2021•0 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

Superadiabatic holonomic quantum computation in cavity QED

Bao-Jie Liu, Zhenhua Huang, Zheng‐Yuan Xue +1 more

Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition requires that the process be very slow and thus limits its application in quantum computation, where quantum gates are preferred to be fast due to the limited coherent times of the quantum systems. Here, we propose a feasible scheme to implement universal holonomic quantum computation based on non-Abelian geometric phases with superadiabatic quantum control, where the adiabatic manipulation is sped up while retaining its robustness against errors in the timing control. Consolidating the advantages of both strategies, our proposal is thus both robust and fast. The cavity QED system is adopted as a typical example to illustrate the merits where the proposed scheme can be realized in a tripod configuration by appropriately controlling the pulse shapes and their relative strength. To demonstrate the distinct performance of our proposal, we also compare our scheme with the conventional adiabatic strategy.

arXiv:1610.03661•Physical Review A•Jun 5, 2017•57 citations

Fast implementation of controlled $$\pi $$ phase gate using superadiabatic shortcuts with Rydberg superatoms

Ruobing Zhao, Wei Li, 计彦强 +3 more

Abstract Quantum phase gates serve as core fundamental resources for quantum information processing, and their preparation effciency and structural stability directly determine the overall performance of quantum computing and quantum communication. The traditional adiabatic preparation method is prone to the influence of decoherence due to its excessive time consumption, while superadiabatic shortcut technology can significantly shorten the evolution time while retaining the advantages of the adiabatic process. In this paper, we propose a scheme for rapidly implementing a quantum phase gate by combining superadiabatic scheme and quantum Zeno dynamics to construct shortcuts to adiabatic passage. We demonstrate the superadiabatic shortcut by using Rydberg superatoms in distant-atom-cavity system. Furthermore, we utilize the controlled π phase gate to achieve the preparation of N-particles cluster states. Additionally, the impact of decoherence and operational imperfections are discussed. Numerical simulation demonstrates the proposed scheme has high fidelities and robustness against both cavity leakage and atomic spontaneous emission.

Quantum Information Processing•Oct 29, 2026•0 citations
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.
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.
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.
\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
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 quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition requires that the process be very slow and thus limits its application in quantum computation, where quantum gates are preferred to be fast due to the limited coherent times of the quantum systems. Here, we propose a feasible scheme to implement universal holonomic quantum computation based on non-Abelian geometric phases with superadiabatic quantum control, where the adiabatic manipulation is sped up while retaining its robustness against errors in the timing control. Consolidating the advantages of both strategies, our proposal is thus both robust and fast. The cavity QED system is adopted as a typical example to illustrate the merits where the proposed scheme can be realized in a tripod configuration by appropriately controlling the pulse shapes and their relative strength. To demonstrate the distinct performance of our proposal, we also compare our scheme with the conventional adiabatic strategy.
Fast implementation of controlled π\pi π phase gate using superadiabatic shortcuts with Rydberg superatoms
Abstract Quantum phase gates serve as core fundamental resources for quantum information processing, and their preparation effciency and structural stability directly determine the overall performance of quantum computing and quantum communication. The traditional adiabatic preparation method is prone to the influence of decoherence due to its excessive time consumption, while superadiabatic shortcut technology can significantly shorten the evolution time while retaining the advantages of the adiabatic process. In this paper, we propose a scheme for rapidly implementing a quantum phase gate by combining superadiabatic scheme and quantum Zeno dynamics to construct shortcuts to adiabatic passage. We demonstrate the superadiabatic shortcut by using Rydberg superatoms in distant-atom-cavity system. Furthermore, we utilize the controlled π phase gate to achieve the preparation of N-particles cluster states. Additionally, the impact of decoherence and operational imperfections are discussed. Numerical simulation demonstrates the proposed scheme has high fidelities and robustness against both cavity leakage and atomic spontaneous emission.