English
Related papers

Related papers: Quantum computing with anyons: an $F$-matrix and b…

200 papers

This expository article supplies the mathematical background underpinning the braid representation calculator introduced in arXiv:2212.00831; those representations describe the sets of logic gates available to a topological quantum computer…

Quantum Algebra · Mathematics 2022-12-07 Willie Aboumrad

Topological quantum computers promise a fault tolerant means to perform quantum computation. Topological quantum computers use particles with exotic exchange statistics called non-Abelian anyons, and the simplest anyon model which allows…

Quantum Physics · Physics 2018-06-08 Bernard Field , Tapio Simula

We investigate a promising conformal field theory realization scheme for topological quantum computation based on the Fibonacci anyons, which are believed to be realized as quasiparticle excitations in the $\mathbb{Z}_3$ parafermion…

Quantum Physics · Physics 2024-04-04 Lachezar S. Georgiev , Ludmil Hadjiivanov , Grigori Matein

Quantum gates built out of braid group elements form the building blocks of topological quantum computation. They have been extensively studied in $SU(2)_k$ quantum group theories, a rich source of examples of non-Abelian anyons such as the…

Quantum Physics · Physics 2023-03-01 Indrajit Jana , Filippo Montorsi , Pramod Padmanabhan , Diego Trancanelli

A great part of the mathematical foundations of topological quantum computation is given by the theory of modular categories which provides a description of the topological phases of matter such as anyon systems. In the near future the…

General Mathematics · Mathematics 2018-10-09 Juan Ospina

Unitary Ribbon Fusion Categories (URFC) formalize anyonic theories. It has been widely assumed that the same category formalizes a topological quantum computing model. However, in previous work, we addressed and resolved this confusion and…

Quantum Physics · Physics 2025-06-02 Fatimah Rita Ahmadi

Models for topological quantum computation are based on braiding and fusing anyons (quasiparticles of fractional statistics) in (2+1)-D. The anyons that can exist in a physical theory are determined by the symmetry group of the Hamiltonian.…

Quantum Physics · Physics 2015-03-17 Meagan B. Thompson

This review presents an entry-level introduction to topological quantum computation -- quantum computing with anyons. We introduce anyons at the system-independent level of anyon models and discuss the key concepts of protected fusion…

Mesoscale and Nanoscale Physics · Physics 2017-09-14 Ville Lahtinen , Jiannis K. Pachos

Topological quantum computation employs two-dimensional quasiparticles called anyons. The generally accepted mathematical basis for the theory of anyons is the framework of modular tensor categories. That framework involves a substantial…

Quantum Physics · Physics 2020-04-15 Andreas Blass , Yuri Gurevich

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 propose an encoding for topological quantum computation utilizing quantum representations of mapping class groups. Leakage into a non-computational subspace seems to be unavoidable for universality in general. We are interested in the…

Quantum Algebra · Mathematics 2018-12-26 Wade Bloomquist , Zhenghan Wang

We provide a comprehensive systematic method for the numerical computation of elementary braid operations in topological quantum computation (TQC). This {procedure} is systematically applicable to all anyon models, including $SU(2)_k$.…

Topological quantum computation encodes quantum information in the internal fusion space of non-Abelian anyonic quasiparticles, whose braiding implements logical gates. This goes beyond Abelian topological order (TO) such as the toric code,…

Topological quantum computing holding global anti-interference ability is realized by braiding some anyons, such as well-known Fibonacci anyons. Here, based on $SO(3)_2 $ theory we obtain a total of 6 anyon models utilizing…

Quantum Physics · Physics 2025-08-18 Jiangwei Long , Jianxin Zhong , Lijun Meng

Harnessing non-abelian statistics of anyons to perform quantum computational tasks is getting closer to reality. While the existence of universal anyons by braiding alone such as the Fibonacci anyon is theoretically a possibility,…

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

A quantum computer can perform exponentially faster than its classical counterpart. It works on the principle of superposition. But due to the decoherence effect, the superposition of a quantum state gets destroyed by the interaction with…

Quantum Physics · Physics 2022-08-23 Muhammad Ilyas

Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons and…

Quantum Physics · Physics 2020-08-11 Mohamed Taha Rouabah

Topological quantum computers provide a fault-tolerant method for performing quantum computation. Topological quantum computers manipulate topological defects with exotic exchange statistics called anyons. The simplest anyon model for…

Quantum Physics · Physics 2022-04-01 Yuanye Zhu

Topological quantum computation may provide a robust approach for encoding and manipulating information utilizing the topological properties of anyonic quasi-particle excitations. We develop an efficient means to map between dense and…

Quantum Physics · Physics 2011-08-02 Haitan Xu , J. M. Taylor

Fibonacci anyons provide the simplest possible model of non-Abelian fusion rules: [1] x [1] = [0] + [1]. We propose a conformal field theory construction of topological quantum registers based on Fibonacci anyons realized as quasiparticle…

High Energy Physics - Theory · Physics 2024-08-20 Ludmil Hadjiivanov , Lachezar S. Georgiev
‹ Prev 1 2 3 10 Next ›