English
Related papers

Related papers: Topological quantum compilation of metaplectic any…

200 papers

The common approach to topological quantum computation is to implement quantum gates by adiabatically moving non-Abelian anyons around each other. Here we present an alternative perspective based on the possibility of realizing the exchange…

Quantum Physics · Physics 2013-04-23 M. Burrello , B. van Heck , A. R. Akhmerov

A class of anyonic models for universal quantum computation based on weakly-integral anyons has been recently proposed. While universal set of gates cannot be obtained in this context by anyon braiding alone, designing a certain type of…

Quantum Physics · Physics 2016-06-13 Alex Bocharov , Shawn X. Cui , Vadym Kliuchnikov , Zhenghan Wang

Topological quantum computation has recently emerged as one of the most exciting approaches to constructing a fault-tolerant quantum computer. The proposal relies on the existence of topological states of matter whose quasiparticle…

Strongly Correlated Electrons · Physics 2009-11-13 Chetan Nayak , Steven H. Simon , Ady Stern , Michael Freedman , Sankar Das Sarma

In topologically-protected quantum computation, quantum gates can be carried out by adiabatically braiding two-dimensional quasiparticles, reminiscent of entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)], as well…

Quantum Physics · Physics 2013-02-14 Ross B. McDonald , Helmut G. Katzgraber

Topological quantum computation based on anyons is a promising approach to achieve fault-tolerant quantum computing. The Majorana zero modes in the Kitaev chain are an example of non-Abelian anyons where braiding operations can be used to…

Non-semisimple extensions of the Ising anyon model developed in our previous work enable universal topological quantum computation via braiding alone, overcoming the Clifford-only limitation of semisimple theories. The non-semisimple theory…

Quantum Physics · Physics 2026-04-23 Filippo Iulianelli , Sung Kim , Joshua Sussan , Aaron D. Lauda

We examine how best to design qubits for use in topological quantum computation. These qubits are topological Hilbert spaces associated with small groups of anyons. Op- erations are performed on these by exchanging the anyons. One might…

Mathematical Physics · Physics 2011-07-06 R. Ainsworth , J. K. Slingerland

We describe the mathematical theory of topological quantum computing with symmetry defects in the language of fusion categories and unitary representations. Symmetry defects together with anyons are modeled by G-crossed braided extensions…

Quantum Algebra · Mathematics 2018-11-07 Colleen Delaney , Zhenghan Wang

We first give a brief exposition of our recent realization of anyonic quantum states on single M5-brane probes in 11D super-gravity backgrounds, by non-perturbative quantization of the topological sector of the self-dual tensor field on the…

High Energy Physics - Theory · Physics 2025-10-07 Hisham Sati , Urs Schreiber

We discuss how to significantly reduce leakage errors in topological quantum computation by introducing an irrelevant error in phase, using the construction of a CNOT gate in the Fibonacci anyon model as a concrete example. To be specific,…

Mesoscale and Nanoscale Physics · Physics 2008-12-13 Haitan Xu , Xin Wan

We study the emergence of topological matter in two-dimensional systems of neutral Rydberg atoms in Ruby lattices. While Abelian anyons have been predicted in such systems, non-Abelian anyons, which would form a substrate for fault-tolerant…

Quantum Physics · Physics 2023-06-21 Nora M. Bauer , Elias Kokkas , Victor Ale , George Siopsis

We consider a two-dimensional spin system that exhibits abelian anyonic excitations. Manipulations of these excitations enable the construction of a quantum computational model. While the one-qubit gates are performed dynamically the model…

Quantum Physics · Physics 2007-08-28 Jiannis K. Pachos

Quantum gates in topological quantum computation are performed by braiding non-Abelian anyons. These braiding processes can presumably be performed with very low error rates. However, to make a topological quantum computation architecture…

Quantum Physics · Physics 2016-04-22 Adrian Hutter , James R. Wootton

We show that braidings of the metaplectic anyons $X_\epsilon$ in $SO(3)_2=SU(2)_4$ with their total charge equal to the metaplectic mode $Y$ supplemented with measurements of the total charge of two metaplectic anyons are universal for…

Quantum Physics · Physics 2015-11-20 Shawn X. Cui , Zhenghan Wang

In this paper we present a hybrid scheme for topological quantum computation in a system of cold atoms trapped in an atomic lattice. A topological qubit subspace is defined using Majorana fermions which emerge in a network of atomic Kitaev…

Quantum Physics · Physics 2014-02-19 C. Laflamme , M. A. Baranov , P. Zoller , C. V. Kraus

Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We…

Quantum Physics · Physics 2020-08-11 Paul Webster , Stephen D. Bartlett

Despite the evident necessity of topological protection for realizing scalable quantum computers, the conceptual underpinnings of topological quantum logic gates had arguably remained shaky, both regarding their physical realization as well…

Quantum Physics · Physics 2024-07-12 David Jaz Myers , Hisham Sati , Urs Schreiber

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons…

Quantum Physics · Physics 2007-05-23 Michael H. Freedman , Alexei Kitaev , Michael J. Larsen , Zhenghan Wang

The topological model for quantum computation is an inherently fault-tolerant model built on anyons in topological phases of matter. A key role is played by the braid group, and in this survey we focus on a selection of ways that the…

Quantum Physics · Physics 2022-08-26 Eric C. Rowell

We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…

Quantum Physics · Physics 2015-03-13 Michele Burrello , Haitan Xu , Giuseppe Mussardo , Xin Wan