Skip to main content

NOTICE: Due to a lapse in annual appropriations, most of this website is not being updated. Learn more.

Form submissions will still be accepted but will not receive responses at this time. Sections of this site for programs using non-appropriated funds (such as NVLAP) or those that are excepted from the shutdown (such as CHIPS and NVD) will continue to be updated.

U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Unification of universal and non-universal topological quantum computation

Published

Author(s)

Haitan Xu, Jacob Taylor

Abstract

Approaches for implementing primitives for quantum computation using Read-Reyazi anyons remain computational difficult to find. We demonstrate how recently discovered approaches, including composition of anyons and deconstruction of many-qubit operations into effective single-qubit gates can be used for both effective mapping between dense and sparse representations of qubits, the construction of two- qubit gate, and the construction of the Toffoli gate (CCPHASE) for the universal class of Read-Reyazi anyons, k=3, k > 4. In the process, we show how the constructions for quantum memory in non-universal anyon classes connect naturally to the construction of quantum bits for computation in the universal class, unifying these two concepts in a simple framework.
Citation
Physical Review Letters

Keywords

Quantum computation, Read-Reyazi anyons, Topological gates, Two-dimensional heterostructures

Citation

Xu, H. and Taylor, J. (2011), Unification of universal and non-universal topological quantum computation, Physical Review Letters, [online], https://doi.org/10.1103/PhysRevA.84.012332 (Accessed October 16, 2025)

Issues

If you have any questions about this publication or are having problems accessing it, please contact [email protected].

Created July 25, 2011, Updated October 12, 2021
Was this page helpful?