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:1903.03397 · Physical Review A

Noncyclic geometric quantum computation with shortcut to adiabaticity

Qing-Xian Lv, Zhen-Tao Liang, Hongzhi Liu, Jia-Hao Liang, Kai-Yu Liao, Yan-Xiong Du

Published Feb 24, 2020• 26 citations
arXivHTMLPDF

Abstract

Fast and robust quantum gates are the cornerstones of fault-tolerance quantum computation. In this paper, as opposed to the previous proposals which use cyclic geometric phases, we propose to realize quantum computation based on noncyclic geometric evolution. The superiority of the noncyclic scheme is that the operation time is proportional to the rotation angle of the quantum state. Therefore, the noncyclic scheme becomes fairly fast in the case of quantum gates with small rotation angle, which will be more insensitive to the decoherence and the leakage to the states outside the computational basis. Similar to the cyclic version of geometric quantum computation, dynamical phases here during the evolution are canceled by spin-echo process and the adiabatic control can be sped up through shortcut to adiabaticity. The proposed scheme is robust against random noise due to the geometric characteristic of projective Hilbert space. Since the proposed scheme is fast and robust, it is a particularly suitable way to manipulate the physical systems with weak nonlinearity, such as superconducting systems.

DOI
10.1103/physreva.101.022330

Related papers

Experimental realization of noncyclic geometric gates with shortcut to adiabaticity in a superconducting circuit

Luqing Qiu, Hao Li, Zhikun Han +7 more

Possessing the noise-resilience feature, geometric phases have become important in robust quantum computation. Gates based on the Abelian and non-Abelian geometric phases have been experimentally demonstrated in different physical systems. However, previous proposals require cyclic evolution with a constant operation time even for small rotation angles, which set a limit to the gate operation time. Here, we experimentally realize noncyclic geometric gates, where the cyclic condition is removed and the operation time is proportional to the rotation angle. With the adiabatic process sped up by shortcut to adiabaticity, the fidelities of a noncyclic geometric gate characterized by randomized benchmarking are above 99.5%. Comparing with the dynamic scheme, we demonstrate the robustness of our gate against control instability in the experiment. Moreover, our results indicate that the noncyclic geometric gate with a smaller rotation angle corresponds to a shorter evolution time and higher fidelity. As small rotation angles are essential in the quantum algorithm, the superiority of noncyclic geometric gates makes them promising candidates in fast and robust quantum computation.

Applied Physics Letters•Jun 21, 2021•13 citations

Noncyclic nonadiabatic holonomic quantum gates via shortcuts to adiabaticity

Sai Li, Pu Shen, Tao Chen +1 more

High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum task. Therefore, implementing high-fidelity, robust and fast quantum gates is highly desired. Here, we propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum computation based on resonant interaction of three-level quantum systems via shortcuts to adiabaticity. In our proposal, the target Hamiltonian to induce noncyclic non-Abelian geometric phases can be inversely engineered with less evolution time and demanding experimentally, leading to high-fidelity quantum gates in a simple setup. Besides, our scheme is readily realizable in physical system currently pursued for implementation of quantum computation. Therefore, our proposal represents a promising way towards fault-tolerant geometric quantum computation.

arXiv:2105.13912•Frontiers of Physics•Jun 5, 2021•11 citations

Geometric Quantum Computation with Shortcuts to Adiabaticity (Adv. Quantum Technol. 9/2019)

Yan-Xiong Du, Zhen-Tao Liang, Hui Yan +1 more

Quantum control that is robust against control errors and dephasing process is a key ingredient of quantum computation. In article no. 1900013, Yanxiong Du and co-workers review the recent progresses on the geometric quantum computation with shortcut to adiabaticity. Geometric phase, as acquired in the evolution of Hilbert space, can be used to realize geometric quantum computation that is robust against random noise and systematic errors. Through optimizing the control waveform with shortcut to adiabatic manner, the operation will consolidate the virtues of being fast and robust. Theoretical and experimental results have proven the effectiveness of combining the geometric phase and shortcut to adiabaticity.

Advanced Quantum Technologies•Sep 1, 2019•1 citation

Noncyclic Geometric Quantum Gates with Smooth Paths via Invariant‐Based Shortcuts

Li‐Na Ji, Cheng‐Yun Ding, Tao Chen +1 more

Abstract Nonadiabatic geometric quantum computation is dedicated to the realization of high‐fidelity and robust quantum gates, which are necessary for fault‐tolerant quantum computation. However, it is limited by cyclic and mutative evolution path, which usually requires longer gate‐time and abrupt pulse control, weakening the gate performance. Here, a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant‐based shortcuts is proposed, where universal quantum gates can be induced in one step without path mutation and the gate time is also effectively shortened. Our numerical simulations show that, comparing with the conventional dynamical gates, the constructed geometric gates have stronger resistance not only to systematic errors, induced by both qubit‐frequency drift and the deviation of the amplitude of the driving fields, but also to environment‐induced decoherence effect. In addition, this scheme can also be implemented on a superconducting circuit platform, with the fidelities of single‐qubit and two‐qubit gates higher than 99.97% and 99.84%, respectively. Therefore, this scheme provides a promising way to realize high‐fidelity fault‐tolerant quantum gates for scalable quantum computation.

arXiv:2102.00893•Advanced Quantum Technologies•Apr 29, 2021•21 citations

Robust nonadiabatic geometric quantum computation by dynamical correction

Ming-Jie Liang, Zheng‐Yuan Xue

Besides the intrinsic noise resilience property, nonadiabatic geometric phases are of the fast evolution nature, and thus can naturally be used in constructing quantum gates with excellent performance, i.e., the so-called nonadiabatic geometric quantum computation (NGQC). However, previous single-loop NGQC schemes are sensitive to the operational control error, i.e., the $X$ error, due to the limitations of the implementation. Here, we propose a robust scheme for NGQC combining with the dynamical correction technique, which still uses only simplified pulses, and thus being experimental friendly. We numerically show that our scheme can greatly improve the gate robustness in previous protocols, retaining the intrinsic merit of geometric phases. Furthermore, to fight against the dephasing noise, due to the $Z$ error, we can incorporate the decoherence-free subspace encoding strategy. In this way, our scheme can be robust against both types of errors. Finally, we also propose how to implement the scheme with encoding on superconducting quantum circuits with experimentally demonstrated technology. Therefore, due to the intrinsic robustness, our scheme provides a promising alternation for the future scalable fault-tolerant quantum computation.

arXiv:2208.01472•Physical Review A•Jul 6, 2022•8 citations

Noncyclic geometric quantum computation

Axel Friedenauer, Erik Sjöqvist

Geometric quantum computation is extended to the noncyclic case. Adiabatic nuclear magnetic resonance implementations of geometric phase-shift gates at any precession angle and their concomitant fault tolerance with respect to the amplitude of the oscillating field are analyzed. Nonadiabatic one-qubit geometric quantum computation is considered from the noncyclic perspective, with particular emphasis on errors in precession angles.

Physical Review A•Feb 28, 2003•32 citations
Fast and robust quantum gates are the cornerstones of fault-tolerance quantum computation. In this paper, as opposed to the previous proposals which use cyclic geometric phases, we propose to realize quantum computation based on noncyclic geometric evolution. The superiority of the noncyclic scheme is that the operation time is proportional to the rotation angle of the quantum state. Therefore, the noncyclic scheme becomes fairly fast in the case of quantum gates with small rotation angle, which will be more insensitive to the decoherence and the leakage to the states outside the computational basis. Similar to the cyclic version of geometric quantum computation, dynamical phases here during the evolution are canceled by spin-echo process and the adiabatic control can be sped up through shortcut to adiabaticity. The proposed scheme is robust against random noise due to the geometric characteristic of projective Hilbert space. Since the proposed scheme is fast and robust, it is a particularly suitable way to manipulate the physical systems with weak nonlinearity, such as superconducting systems.
Possessing the noise-resilience feature, geometric phases have become important in robust quantum computation. Gates based on the Abelian and non-Abelian geometric phases have been experimentally demonstrated in different physical systems. However, previous proposals require cyclic evolution with a constant operation time even for small rotation angles, which set a limit to the gate operation time. Here, we experimentally realize noncyclic geometric gates, where the cyclic condition is removed and the operation time is proportional to the rotation angle. With the adiabatic process sped up by shortcut to adiabaticity, the fidelities of a noncyclic geometric gate characterized by randomized benchmarking are above 99.5%. Comparing with the dynamic scheme, we demonstrate the robustness of our gate against control instability in the experiment. Moreover, our results indicate that the noncyclic geometric gate with a smaller rotation angle corresponds to a shorter evolution time and higher fidelity. As small rotation angles are essential in the quantum algorithm, the superiority of noncyclic geometric gates makes them promising candidates in fast and robust quantum computation.
High-fidelity quantum gates are essential for large-scale quantum computation. However, any quantum manipulation will inevitably affected by noises, systematic errors and decoherence effects, which lead to infidelity of a target quantum task. Therefore, implementing high-fidelity, robust and fast quantum gates is highly desired. Here, we propose a fast and robust scheme to construct high-fidelity holonomic quantum gates for universal quantum computation based on resonant interaction of three-level quantum systems via shortcuts to adiabaticity. In our proposal, the target Hamiltonian to induce noncyclic non-Abelian geometric phases can be inversely engineered with less evolution time and demanding experimentally, leading to high-fidelity quantum gates in a simple setup. Besides, our scheme is readily realizable in physical system currently pursued for implementation of quantum computation. Therefore, our proposal represents a promising way towards fault-tolerant geometric quantum computation.
Quantum control that is robust against control errors and dephasing process is a key ingredient of quantum computation. In article no. 1900013, Yanxiong Du and co-workers review the recent progresses on the geometric quantum computation with shortcut to adiabaticity. Geometric phase, as acquired in the evolution of Hilbert space, can be used to realize geometric quantum computation that is robust against random noise and systematic errors. Through optimizing the control waveform with shortcut to adiabatic manner, the operation will consolidate the virtues of being fast and robust. Theoretical and experimental results have proven the effectiveness of combining the geometric phase and shortcut to adiabaticity.
Abstract Nonadiabatic geometric quantum computation is dedicated to the realization of high‐fidelity and robust quantum gates, which are necessary for fault‐tolerant quantum computation. However, it is limited by cyclic and mutative evolution path, which usually requires longer gate‐time and abrupt pulse control, weakening the gate performance. Here, a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant‐based shortcuts is proposed, where universal quantum gates can be induced in one step without path mutation and the gate time is also effectively shortened. Our numerical simulations show that, comparing with the conventional dynamical gates, the constructed geometric gates have stronger resistance not only to systematic errors, induced by both qubit‐frequency drift and the deviation of the amplitude of the driving fields, but also to environment‐induced decoherence effect. In addition, this scheme can also be implemented on a superconducting circuit platform, with the fidelities of single‐qubit and two‐qubit gates higher than 99.97% and 99.84%, respectively. Therefore, this scheme provides a promising way to realize high‐fidelity fault‐tolerant quantum gates for scalable quantum computation.
Besides the intrinsic noise resilience property, nonadiabatic geometric phases are of the fast evolution nature, and thus can naturally be used in constructing quantum gates with excellent performance, i.e., the so-called nonadiabatic geometric quantum computation (NGQC). However, previous single-loop NGQC schemes are sensitive to the operational control error, i.e., the XXX error, due to the limitations of the implementation. Here, we propose a robust scheme for NGQC combining with the dynamical correction technique, which still uses only simplified pulses, and thus being experimental friendly. We numerically show that our scheme can greatly improve the gate robustness in previous protocols, retaining the intrinsic merit of geometric phases. Furthermore, to fight against the dephasing noise, due to the ZZZ error, we can incorporate the decoherence-free subspace encoding strategy. In this way, our scheme can be robust against both types of errors. Finally, we also propose how to implement the scheme with encoding on superconducting quantum circuits with experimentally demonstrated technology. Therefore, due to the intrinsic robustness, our scheme provides a promising alternation for the future scalable fault-tolerant quantum computation.