The Magic of Universal Quantum Computing with Permutations

9Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The role of permutation gates for universal quantum computing is investigated. The "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 a few types of resulting magic states in low dimensions d≤9 is performed.

Cite

CITATION STYLE

APA

Planat, M., & Ul Haq, R. (2017). The Magic of Universal Quantum Computing with Permutations. Advances in Mathematical Physics, 2017. https://doi.org/10.1155/2017/5287862

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free