Realization of arbitrary gates in holonomic quantum computation

Journal Article · Wed Jan 01 00:00:00 EST 2003 · Physical Review. A

DOI:https://doi.org/10.1103/PhysRevA.67.012319· OSTI ID:20634097

Niskanen, Antti O; Nakahara, Mikio; Salomaa, Martti M ^[1]

---

1. Materials Physics Laboratory, Helsinki University of Technology, POB 2200 (Technical Physics), FIN-02015 HUT (Finland)

Among the many proposals for the realization of a quantum computer, holonomic quantum computation is distinguished from the rest as it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze the realization of various quantum gates by solving the inverse problem: Given a unitary matrix, we develop a formalism by which we find loops in the parameter space generating this matrix as a holonomy. We demonstrate that such a one-qubit gate as the Hadamard gate and such two-qubit gates as the controlled-NOT gate and the SWAP gate, and the discrete Fourier transformation can be obtained with a single loop.

• OSTI ID: 20634097
• Journal Information: Physical Review. A, Vol. 67, Issue 1; Other Information: DOI: 10.1103/PhysRevA.67.012319; (c) 2003 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
• Country of Publication: United States
• Language: English

Related Subjects

74 ATOMIC AND MOLECULAR PHYSICS
CORRELATIONS
ENERGY LEVELS
FOURIER TRANSFORMATION
GATING CIRCUITS
INFORMATION THEORY
OPTIMIZATION
QUANTUM MECHANICS
SPACE