English

Quantum computing with Bianchi groups

Geometric Topology 2019-02-20 v2 Mathematical Physics Group Theory math.MP Number Theory Quantum Physics

Abstract

It has been shown that non-stabilizer eigenstates of permutation gates are appropriate for allowing dd-dimensional universal quantum computing (uqc) based on minimal informationally complete POVMs. The relevant quantum gates may be built from subgroups of finite index of the modular group Γ=PSL(2,Z)\Gamma=PSL(2,\mathbb{Z}) [M. Planat, Entropy 20, 16 (2018)] or more generally from subgroups of fundamental groups of 33-manifolds [M. Planat, R. Aschheim, M.~M. Amaral and K. Irwin, arXiv 1802.04196(quant-ph)]. In this paper, previous work is encompassed by the use of torsion-free subgroups of Bianchi groups for deriving the quantum gate generators of uqc. A special role is played by a chain of Bianchi congruence nn-cusped links starting with Thurston's link.

Keywords

Cite

@article{arxiv.1808.06831,
  title  = {Quantum computing with Bianchi groups},
  author = {Michel Planat and Raymond Aschheim and Marcelo M. Amaral and Klee Irwin},
  journal= {arXiv preprint arXiv:1808.06831},
  year   = {2019}
}

Comments

10 pages, 14 figures, 3 tables a mistake occured in the fourth author name. arXiv admin note: text overlap with arXiv:1802.04196

R2 v1 2026-06-23T03:39:18.862Z