2003/12/31 by Shogo Tanimura, Daisuke Hayashi, Mikio Nakahara · 1 citation
Computer Science · Physics and Astronomy · #Algorithm #Classical mechanics #Computation #Computer science #Controlled NOT gate #Hadamard transform #Holonomic #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Fourier transform #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum algorithm #Quantum computer #Quantum gate #Quantum mechanics #Qubit #Topology (electrical circuits) #Transformation (genetics) #Unitary state #Unitary transformation #quant-ph
paper · pdf · doi:10.1016/j.physleta.2004.03.057
published as Physics Letters A 325 (2004) 199-205 · 11 pages, re-organized to be more comprehensive, references added, style file of Physics Letters A is needed
arxiv created 2004/03/25 · openalex publication_date 2004/04/09 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
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.