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

Mathematics and Computers in Simulation

A geometrical approach to quantum holonomic computing algorithms

А. М. Самойленко, Y. A. Prykarpatsky, Ufuk Taneri, Anatoliy K. Prykarpatsky, Denis Blackmore

Published Apr 29, 2004• 14 citations
Publisher
DOI
10.1016/j.matcom.2004.01.017

Related papers

Geometric and holonomic quantum computation

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

arXiv:2110.03602•Physics Reports•Jul 1, 2023•108 citations

Quantum mathematics: holonomic computing algorithms and their applications. Pt. 2

Anatoliy K. Prykarpatsky, Ufuk Taneri, Denis Blackmore

Automatyka / Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie•Jan 1, 2004•0 citations

Geometry of Grover Search : A Comparison between Geometric and Holonomic Quantum Computation

Rasmus Wallentin

Geometric quantum phases enable the construction geometric quantum gates, whose action only depend on the evolution path in state space. Geometric gates may offer increased robustness to control parameter noise. In this report, the conditions under which non-adiabatic geometric and holonomic quantum gates preserve their geometric character under sequential composition are analysed. Grover’s search algorithm requiring non-commuting operations is used as a representative example. The basic concepts of qubits, quantum gates and quantum circuits are explained. The concept of geometric phases is introduced and derivations of Abelian and non-Abelian non-adiabatic geometric phases are provided (Aharonov-Anandan and Anandan phase respectively). Construction of geometric and holonomic universal quantum gate sets with the aforementioned geometric phases are briefly described.Explicit calculation of two non-commuting Abelian and non-adiabatic geometric time evolutions show that the successively combined operation is not geometric. A proof of successive combinations of non-Abelian and non-adiabatic geometric time evolutions preserving their non-adiabatic Abelian and geometric properties is given. The report concludes that it is in general not possible to perform quantum circuits completely geometrically with a geometric universal quantum gate set. However, performing quantum computations with gates from a holonomic universal gate set is geometric and holonomic throughout the computation.

•Jan 1, 2026•0 citations

Mathematical foundations of holonomic quantum computer

Kazuyuki Fujii

arXiv:quant-ph/0004102•Reports on Mathematical Physics•Aug 1, 2001•23 citations

Searching nonadiabatic holonomic quantum gates via an optimization algorithm

Feihao Zhang, Jiang Zhang, Pan Gao +1 more

Nonadiabatic holonomic quantum computation (NHQC) offers a way to realize geometric quantum gates beyond the adiabatic regime. To extend the flexibility and control robustness, many NHQC schemes have been proposed. Here, we propose to use quantum optimal control theory to search control sequences that can realize holonomic gates. Given a target gate and the corresponding computational subspace, our optimization algorithm can find the control sequence automatically. Furthermore, by defining an averaged target function, our method can improve the robustness of the holonomic gates against the errors such as thermal noises and amplitude errors. As an application, we search the control sequences for the Hadamard, not, and cnot gates in a nitrogen-vacancy-center system.

Physical Review A•Jul 18, 2019•25 citations

Holonomic quantum computation

Paolo Zanardi, Mario Rasetti

arXiv:quant-ph/9904011•Physics Letters A•Dec 1, 1999•1,012 citations
Geometric quantum phases enable the construction geometric quantum gates, whose action only depend on the evolution path in state space. Geometric gates may offer increased robustness to control parameter noise. In this report, the conditions under which non-adiabatic geometric and holonomic quantum gates preserve their geometric character under sequential composition are analysed. Grover’s search algorithm requiring non-commuting operations is used as a representative example. The basic concepts of qubits, quantum gates and quantum circuits are explained. The concept of geometric phases is introduced and derivations of Abelian and non-Abelian non-adiabatic geometric phases are provided (Aharonov-Anandan and Anandan phase respectively). Construction of geometric and holonomic universal quantum gate sets with the aforementioned geometric phases are briefly described.Explicit calculation of two non-commuting Abelian and non-adiabatic geometric time evolutions show that the successively combined operation is not geometric. A proof of successive combinations of non-Abelian and non-adiabatic geometric time evolutions preserving their non-adiabatic Abelian and geometric properties is given. The report concludes that it is in general not possible to perform quantum circuits completely geometrically with a geometric universal quantum gate set. However, performing quantum computations with gates from a holonomic universal gate set is geometric and holonomic throughout the computation.
Nonadiabatic holonomic quantum computation (NHQC) offers a way to realize geometric quantum gates beyond the adiabatic regime. To extend the flexibility and control robustness, many NHQC schemes have been proposed. Here, we propose to use quantum optimal control theory to search control sequences that can realize holonomic gates. Given a target gate and the corresponding computational subspace, our optimization algorithm can find the control sequence automatically. Furthermore, by defining an averaged target function, our method can improve the robustness of the holonomic gates against the errors such as thermal noises and amplitude errors. As an application, we search the control sequences for the Hadamard, not, and cnot gates in a nitrogen-vacancy-center system.