The magic of universal quantum computing with permutations

DOI10.1155/2017/5287862zbMath1400.81072arXiv1701.06443OpenAlexW2580923192WikidataQ61158793 ScholiaQ61158793MaRDI QIDQ1798435

Michel Planat, Rukhsan Ul Haq

Publication date: 23 October 2018

Published in: Advances in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.06443

Mathematics Subject Classification ID

Quantum computation (81P68) Phase-space methods including Wigner distributions, etc. applied to problems in quantum mechanics (81S30)

Related Items (3)

Faster quantum computation with permutations and resonant couplings ⋮ 3D topological quantum computing ⋮ Universal quantum computing and three-manifolds

Cites Work

• A family of Weyl-Wigner transforms for discrete variables defined in a finite-dimensional Hilbert space
• Geometry of contextuality from Grothendieck's coset space
• Quantum universality from magic states distillation applied to CSS codes
• Quantum state-independent contextuality requires 13 rays
• Permutation Symmetry Determines the Discrete Wigner Function
• Universal quantum computation with ideal Clifford gates and noisy ancillas
• Negativity and Contextuality are Equivalent Notions of Nonclassicality
• Simple Test for Hidden Variables in Spin-1 Systems
• The resource theory of stabilizer quantum computation
• Hudson’s theorem for finite-dimensional quantum systems
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Negative quasi-probability as a resource for quantum computation

This page was built for publication: The magic of universal quantum computing with permutations