Mathematical foundations of holonomic quantum computer

2000/04/27 by Kazuyuki Fujii · 1 citation
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum optics and atomic interactions #quant-ph

paper · pdf · doi:10.1016/s0034-4877(01)80066-5

published as Rep.Math.Phys. 48(2001) 75-82 · Latex file, 11 pages

arxiv created 2000/04/27 · openalex publication_date 2001/08/01 · arxiv updated 2009/12/01 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28

Abstract

We make a brief review of (optical) Holonomic Quantum Computer (or Computation) proposed by Zanardi and Rasetti (quant-ph/9904011) and Pachos and Chountasis (quant-ph/9912093), and give a mathematical reinforcement to their works.

Citations

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum computing

Cited by

• Exact solutions of holonomic quantum computation