The magic of universal quantum computing with permutations

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.

arXiv comment12 pages, 2 figures

References in corpus (18)

• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• A Theory of Fault-Tolerant Quantum Computation
• Contextuality supplies the magic for quantum computation
• A simple test for hidden variables in spin-1 system
• The Resource Theory of Stabilizer Computation
• Hudson's Theorem for finite-dimensional quantum systems
• Negativity and contextuality are equivalent notions of nonclassicality
• Quasi-probability representations of quantum theory with applications to quantum information science
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Improved magic states distillation for quantum universality
• Classicality in discrete Wigner functions
• Qudit versions of the qubit "pi-over-eight" gate
• Computational speed-up with a single qudit
• Computational speed-up in a single qudit NMR quantum information processor
• Quantum state-independent contextuality requires 13 rays
• Permutation Symmetry Determines the Discrete Wigner Function
• On small proofs of Bell-Kochen-Specker theorem for two, three and four qubits
• Geometry of contextuality from Grothendieck's coset space

Cited by in corpus (8)

• Qutrit and Ququint Magic States
• Magic informationally complete POVMs with permutations
• Faster quantum computation with permutations and resonant couplings
• Topological Quantum Computing and 3-Manifolds
• 3D Topological Quantum Computing
• Cosine series quantum sampling method with applications in signal and image processing
• Representation matching for delegated quantum computing
• Quantum computing with Bianchi groups