2000 character limit reached
Toponomic Quantum Computation (2202.01973v1)
Published 4 Feb 2022 in quant-ph, math-ph, and math.MP
Abstract: Holonomic quantum computation makes use of non-abelian geometric phases, associated to the evolution of a subspace of quantum states, to encode logical gates. We identify a special class of subspaces, for which a sequence of rotations results in a non-abelian holonomy of a topological nature, so that it is invariant under any $SO(3)$-perturbation. Making use of a Majorana-like stellar representation for subspaces, we give explicit examples of topological-holonomic (or toponomic) NOT and CNOT gates.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.