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/9805083

Remarks on Universal Quantum Computer

Yu Shi

Published May 28, 1998• 0 citations
arXivHTMLPDF

Abstract

This paper has been superseded by quant-ph/9908074.
DOI
10.48550/arxiv.quant-ph/9805083

Related papers

Remarks on universal quantum computer

Yu Shi

arXiv:quant-ph/9908074•Physics Letters A•Feb 1, 2002•34 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•63 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•3 citations

1 Fundamental Problems for Universal Quantum Computers

Tien D. Kieu, M. Danos

Springer eBooks•Nov 28, 2007•0 citations

On Efficient Universal Quantum Circuits (システム数理と応用)

Satoshi Tayu, Tomoki Yamada, Shuichi Ueno

電子情報通信学会技術研究報告. MSS, システム数理と応用•Nov 10, 2011•0 citations

Optimal Control of High-Fidelity Quantum Gates in the Presence of Decoherence

Matthew Grace, Constantin Brif, HERSCHEL A. RABITZ +3 more

This paper has been withdrawn as it has been superseded by postings arXiv:quant-ph/0702147 and arXiv:0712.2935

arXiv:quant-ph/0611189•Nov 17, 2006•1 citation
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.