The magic of universal quantum computing with permutations
classification
🪐 quant-ph
math-phmath.GRmath.MP
keywords
magiccomputinggatespermutationquantumuniversalclarifiedclassification
read the original abstract
The role of permutation gates for universal quantum computing is investigated. The \lq magic' of computation is clarified in the permutation gates, their eigenstates, the Wootters discrete Wigner function and state-dependent contextuality (following many contributions on this subject). A first classification of main types of resulting magic states in low dimensions $d \le 9$ is performed.
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.