The magic of universal quantum computing with permutations

  title={The magic of universal quantum computing with permutations},
  author={Michel Planat and Rukhsan-Ul-Haq},
  journal={Advances in Mathematical Physics},
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 is performed. 

Figures and Tables from this paper

Representation Matching For Remote Quantum Computing

It is shown that the representation matching protocol is capable of reducing the communication or memory cost to almost minimum in various tasks, including delegated execution of unitary gate arrays, permutation gates, and unitary conjugation, as well as the storage and retrieval ofunitary gates.

Magic informationally complete POVMs with permutations

It is shown that a subset of such magic states, when acting on the generalized Pauli group, define (asymmetric) informationally complete POVMs, investigated in dimensions 2–12, and exhibit simple finite geometries in their projector products.

Study on Actual Developments in the Field of Quantum Computing in Terms of Cyber Security and Physical Systems

The concept of quantum computer is described, which describes the quantum algorithms, areas of use and weaknesses or strengths of quantum computing, cyber security and circuits.

Quantum Fourier Operators and Their Application

  • E. Sakk
  • Computer Science
    Real Perspective of Fourier Transforms and Current Developments in Superconductivity
  • 2021
This work reviews the structure of the quantum Fourier transform and its implementation, and provides a permutation structure for putting the QFT within the context of universal computation.

Faster quantum computation with permutations and resonant couplings

Quantum computing thanks to Bianchi groups

It has been shown that the concept of a magic state (in universal quantum computing: uqc) and that of a minimal informationally complete positive operator valued measure: MIC-POVMs (in quantum

Quantum Computing, Seifert Surfaces, and Singular Fibers

The fundamental group π 1 ( L ) of a knot or link L may be used to generate magic states appropriate for performing universal quantum computation and simultaneously for retrieving complete

Universal Quantum Computing and Three-Manifolds

This paper investigates quantum information on a few ‘universal’ knots and links such as the figure-of-eight knot, the Whitehead link and Borromean rings, making use of the catalog of platonic manifolds available on the software SnapPy.

Qutrit and ququint magic states

Non-stabilizer eigenstates of Clifford operators are natural candidates for endpoints of magic state distillation routines. We provide an explicit bestiary of all inequivalent non-stabilizer Clifford

Topological Quantum Computing and 3-Manifolds

In this paper, we will present some ideas to use 3D topology for quantum computing. Topological quantum computing in the usual sense works with an encoding of information as knotted quantum states of



Quantum computation and quantum information

  • T. Paul
  • Physics
    Mathematical Structures in Computer Science
  • 2007
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal

Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)

We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis.

The resource theory of stabilizer quantum computation

A resource theory, analogous to the theory of entanglement, is developed that is relevant for fault-tolerant stabilizer computation and introduces two quantitative measures for the amount of non-stabilizer resource, including the sum of the negative entries of the discrete Wigner representation of a quantum state.

Negative quasi-probability as a resource for quantum computation

A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speed-up and, in particular, for fault-tolerant quantum

Quantum Universality from Magic States Distillation Applied to CSS Codes

A sharp threshold is shown in the Hadamard “magic” direction of the Bloch sphere between those ρ allowing universal quantum computation, and those for which any calculation can be efficiently classically simulated.

Contextuality supplies the ‘magic’ for quantum computation

This work proves a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via ‘magic state’ distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer.

Magic-state distillation with the four-qubit code

A routine for magic-state distillation that reduces the required overhead for a range of parameters of practical interest and use of this routine in combination with the 15-to-1 distillation routine described by Bravyi and Kitaev allows for further improvements in overhead.

Improved magic states distillation for quantum universality

Given stabilizer operations and the ability to repeatedly prepare a single-qubit mixed state ρ , can we do universal quantum computation? As motivation for this question, “magic state” distillation

Quasi-probability representations of quantum theory with applications to quantum information science

This paper comprises a review of both the quasi-probability representations of infinite-dimensional quantum theory (including the Wigner function) and the more recently defined quasi-probability

Computational speed-up with a single qudit

It is shown that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm.