The magic of universal quantum computing with permutations

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...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Authors Planat, Michel, Rukhsan-Ul-Haq
Format Paper Journal Article
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 06.04.2017
Subjects
Computation
Eigenvectors
Mathematics - Group Theory
Mathematics - Mathematical Physics
Permutations
Physics - Mathematical Physics
Physics - Quantum Physics
Quantum computing
Online AccessGet full text
ISSN2331-8422
DOI10.48550/arxiv.1701.06443

Cover

More Information
Summary: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.
Bibliography:SourceType-Working Papers-1
ObjectType-Working Paper/Pre-Print-1
content type line 50
ISSN:2331-8422
DOI:10.48550/arxiv.1701.06443