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

International Journal of Theoretical Physics

Holonomic Quantum Computation by Time dependent Decoherence Free Subspaces

Jun-You Lin, Yan Liang, H. D. Yang, J. Gui, S. L. Wu

Published Jan 17, 2017• 1 citation
Publisher
DOI
10.1007/s10773-016-3271-9

Related papers

Multi-qubit non-adiabatic holonomic controlled quantum gates in decoherence-free subspaces

Shi Hu, Wen‐Xue Cui, Qi Guo +3 more

arXiv:1601.02438•Quantum Information Processing•Jun 15, 2016•5 citations

Expedited Holonomic Quantum Computation in Decoherence-Free Subspace

P. V. Pyshkin, Da-Wei Luo, Jun Jing +2 more

Holonomic quantum computation (HQC) may not show its full potential in quantum speedup due to the prerequisite of a long coherent runtime imposed by the adiabatic condition. Here we show that the conventional HQC can be dramatically accelerated by using external control fields, of which the effectiveness is exclusively determined by the integral of the control fields in the time domain. Remarkably this control scheme can be realized with net zero energy cost and it is fault-tolerant against fluctuation and noise, significantly relaxing the experimental constraints. We demonstrate how to realize the scheme via decoherence-free subspaces. In this way we unify quantum robustness merits of this fault-tolerant control scheme, the conventional HQC and decoherence-free subspace, and propose an {\em expedited} holonomic quantum computation protocol.

arXiv:1507.00815•Jul 3, 2015•2 citations

Holonomic quantum computation

Paolo Zanardi A, Mario Rasetti

arXiv:quant-ph/9904011•Physics Letters A•Dec 1, 1999•1,006 citations

Nonadiabatic Holonomic Quantum Computation in Decoherence-Free Subspaces

Guofu Xu, Jiang Zhang, D. M. Tong +2 more

Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, nonadiabatic holonomic quantum computation in decoherence-free subspaces, which avoids a long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize nonadiabatic holonomic quantum computation in decoherence-free subspaces. By using only three neighboring physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of quantum gates.

arXiv:1210.6782•Physical Review Letters•Oct 24, 2012•301 citations

Exact solutions of holonomic quantum computation

Shogo Tanimura, Daisuke Hayashi, Mikio Nakahara

arXiv:quant-ph/0312079•Physics Letters A•Apr 9, 2004•17 citations

Geometric and holonomic quantum computation

Jiang Zhang, Thi Ha Kyaw, Stefan Filipp +3 more

•Jan 1, 2023•88 citations
Holonomic quantum computation (HQC) may not show its full potential in quantum speedup due to the prerequisite of a long coherent runtime imposed by the adiabatic condition. Here we show that the conventional HQC can be dramatically accelerated by using external control fields, of which the effectiveness is exclusively determined by the integral of the control fields in the time domain. Remarkably this control scheme can be realized with net zero energy cost and it is fault-tolerant against fluctuation and noise, significantly relaxing the experimental constraints. We demonstrate how to realize the scheme via decoherence-free subspaces. In this way we unify quantum robustness merits of this fault-tolerant control scheme, the conventional HQC and decoherence-free subspace, and propose an {\em expedited} holonomic quantum computation protocol.
Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, nonadiabatic holonomic quantum computation in decoherence-free subspaces, which avoids a long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize nonadiabatic holonomic quantum computation in decoherence-free subspaces. By using only three neighboring physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of quantum gates.