pith. sign in

arxiv: 1808.06831 · v2 · pith:KIEBOOFFnew · submitted 2018-08-21 · 🧮 math.GT · math-ph· math.GR· math.MP· math.NT· quant-ph

Quantum computing with Bianchi groups

classification 🧮 math.GT math-phmath.GRmath.MPmath.NTquant-ph
keywords quantumbianchigroupssubgroupscomputinggatesplanatallowing
0
0 comments X
read the original abstract

It has been shown that non-stabilizer eigenstates of permutation gates are appropriate for allowing $d$-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 $\Gamma=PSL(2,\mathbb{Z})$ [M. Planat, Entropy 20, 16 (2018)] or more generally from subgroups of fundamental groups of $3$-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 $n$-cusped links starting with Thurston's link.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.