Exact Solutions of Holonomic Quantum Computation

Shogo Tanimura; Daisuke Hayashi; Mikio Nakahara

doi:10.1016/j.physleta.2004.03.057

Exact Solutions of Holonomic Quantum Computation

Quantum Physics 2009-11-10 v4

Authors: Shogo Tanimura , Daisuke Hayashi , Mikio Nakahara

View on arXiv ↗ PDF ↗ DOI ↗

Abstract

Holonomic quantum computation is analyzed from geometrical viewpoint. We develop an optimization scheme in which an arbitrary unitary gate is implemented with a small circle in a complex projective space. Exact solutions for the Hadamard, CNOT and 2-qubit discrete Fourier transform gates are explicitly constructed.

Keywords

holonomic quantum computation quantum circuit compilation quantum computing

Cite

@article{arxiv.quant-ph/0312079,
  title  = {Exact Solutions of Holonomic Quantum Computation},
  author = {Shogo Tanimura and Daisuke Hayashi and Mikio Nakahara},
  journal= {arXiv preprint arXiv:quant-ph/0312079},
  year   = {2009}
}

Comments

11 pages, re-organized to be more comprehensive, references added, style file of Physics Letters A is needed

Related papers

View all related →