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:quant-ph/0004102 · Reports on Mathematical Physics

Mathematical foundations of holonomic quantum computer

Kazuyuki Fujii

Published Aug 1, 2001• 23 citations
arXivHTMLPDF
DOI
10.1016/s0034-4877(01)80066-5

Related papers

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

Mathematical Foundations of Holonomic Quantum Computer

Kazuyuki Fujii

This is a sequel to the papers (quant-ph/9910063) and (quant-ph/0004102). The aim of this paper is to give mathematical foundations to Holonomic Quantum Computation (Computer) proposed by Zanardi and Rasetti (quant-ph/9904011) and Pachos and Chountasis (quant-ph/9912093). In 2-qubit case we give an explicit form to non-abelian Berry connection of quantum computational bundle which is associated with Holonomic Quantum Computation, on some parameter space. We also suggest a possibility that not only usual holonomy but also higherdimensional holonomies must be used to prove a universality of our Holonomic

•Apr 27, 2000•64 citations

Geometric and holonomic quantum computation

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

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

Mathematical Foundations of Holonomic Quantum Computer II

Kazuyuki Fujii

This is a sequel to the papers (quant-ph/9910063) and (quant-ph/0004102). The aim of this paper is to give mathematical foundations to Holonomic Quantum Computation (Computer) proposed by Zanardi and Rasetti (quant-ph/9904011) and Pachos and Chountasis (quant-ph/9912093). In 2-qubit case we give an explicit form to non-abelian Berry connection of quantum computational bundle which is associated with Holonomic Quantum Computation, on some parameter space. We also suggest a possibility that not only usual holonomy but also higher-dimensional holonomies must be used to prove a universality of our Holonomic Quantum Computation.

arXiv:quant-ph/0101102•Jan 22, 2001•8 citations

Holonomic quantum computation

Paolo Zanardi, Mario Rasetti

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

A geometrical approach to quantum holonomic computing algorithms

А. М. Самойленко, Y. A. Prykarpatsky, Ufuk Taneri +2 more

Mathematics and Computers in Simulation•Apr 29, 2004•14 citations
This is a sequel to the papers (quant-ph/9910063) and (quant-ph/0004102). The aim of this paper is to give mathematical foundations to Holonomic Quantum Computation (Computer) proposed by Zanardi and Rasetti (quant-ph/9904011) and Pachos and Chountasis (quant-ph/9912093). In 2-qubit case we give an explicit form to non-abelian Berry connection of quantum computational bundle which is associated with Holonomic Quantum Computation, on some parameter space. We also suggest a possibility that not only usual holonomy but also higherdimensional holonomies must be used to prove a universality of our Holonomic
This is a sequel to the papers (quant-ph/9910063) and (quant-ph/0004102). The aim of this paper is to give mathematical foundations to Holonomic Quantum Computation (Computer) proposed by Zanardi and Rasetti (quant-ph/9904011) and Pachos and Chountasis (quant-ph/9912093). In 2-qubit case we give an explicit form to non-abelian Berry connection of quantum computational bundle which is associated with Holonomic Quantum Computation, on some parameter space. We also suggest a possibility that not only usual holonomy but also higher-dimensional holonomies must be used to prove a universality of our Holonomic Quantum Computation.