English
Related papers

Related papers: Robust Universal Braiding with Non-semisimple Isin…

200 papers

Quantum computation provides a unique opportunity to explore new regimes of physical systems through the creation of non-trivial quantum states far outside of the classical limit. However, such computation is remarkably sensitive to noise…

Strongly Correlated Electrons · Physics 2011-04-04 Haitan Xu , J. M. Taylor

Topological quantum states of matter, both Abelian and non-Abelian, are characterized by excitations whose wavefunctions undergo non-trivial statistical transformations as one excitation is moved (braided) around another. Topological…

Quantum Physics · Physics 2009-11-13 Chuanwei Zhang , V. W. Scarola , Sumanta Tewari , S. Das Sarma

We show that the braid-group extension of the monodromy-based topological quantum computation scheme of Das Sarma et al. can be understood in terms of the universal R matrix for the Ising model giving similar results to those obtained by…

Mathematical Physics · Physics 2008-12-15 Lachezar S. Georgiev

A fundamental problem in fault-tolerant quantum computation is the tradeoff between universality and dimensionality, exemplified by the the Bravyi-K\"onig bound for $n$-dimensional topological stabilizer codes. In this work, we extend…

Quantum Physics · Physics 2026-05-21 Ryohei Kobayashi , Guanyu Zhu , Po-Shen Hsin

In category-theoretic models for the anyon systems proposed for topological quantum computing, the essential ingredients are two monoidal structures, $\oplus$ and $\otimes$. The former is symmetric but the latter is only braided, and…

Category Theory · Mathematics 2020-03-03 Andreas Blass , Yuri Gurevich

Qubits in topological quantum computation are built from non-Abelian anyons. Adiabatic braiding of anyons is exploited as topologically protected logical gate operations. Thus, the adiabaticity upon which the notion of quantum statistics is…

Superconductivity · Physics 2011-10-06 Meng Cheng , Victor Galitski , Sankar Das Sarma

The emergence of non-Abelian anyons from large collections of interacting elementary particles is a conceptually beautiful phenomenon with important ramifications for fault-tolerant quantum computing. Over the last few decades the field has…

Strongly Correlated Electrons · Physics 2015-09-08 Jason Alicea , Ady Stern

Color-code quantum computation seamlessly combines Majorana-based hardware with topological error correction. Specifically, as Clifford gates are transversal in two-dimensional color codes, they enable the use of the Majoranas' nonabelian…

Mesoscale and Nanoscale Physics · Physics 2017-11-09 Daniel Litinski , Felix von Oppen

In seminal work (arxiv:quant-ph/9707021) Alexei Kitaev proposed topological quantum computing (arXiv:cond-mat/0010440, arxiv:quant-ph/9707021, arXiv:quant-ph/0001108, arXiv:0707.1889), whereby logic gates of a quantum computer are conducted…

Quantum Physics · Physics 2026-02-13 Anasuya Lyons , Benjamin J. Brown

In a topological quantum computer, braids of non-Abelian anyons in a (2+1)-dimensional space-time form quantum gates, whose fault tolerance relies on the topological, rather than geometric, properties of the braids. Here we propose to…

Mesoscale and Nanoscale Physics · Physics 2013-05-29 Haitan Xu , Xin Wan

Majorana-based quantum computation seeks to encode information non-locally in pairs of Majorana zero modes, thereby isolating qubit states from a local noisy environment. In addition to long coherence times, the attractiveness of…

Mesoscale and Nanoscale Physics · Physics 2020-03-18 Christina Knapp , Jukka I. Väyrynen , Roman M. Lutchyn

In topological quantum computation, quantum information is stored in states which are intrinsically protected from decoherence, and quantum gates are carried out by dragging particle-like excitations (quasiparticles) around one another in…

Quantum Physics · Physics 2009-11-11 N. E. Bonesteel , Layla Hormozi , Georgios Zikos , Steven H. Simon

Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…

Quantum Physics · Physics 2014-12-10 Roberto Santana , Ross B. McDonald , Helmut G. Katzgraber

We remove the need to physically transport computational anyons around each other from the implementation of computational gates in topological quantum computing. By using an anyonic analog of quantum state teleportation, we show how the…

Quantum Physics · Physics 2009-09-21 Parsa Bonderson , Michael Freedman , Chetan Nayak

We present a systematic numerical construction of a universal quantum gate set for topological quantum computation based on the non-semisimple Ising anyons model. By employing a Genetic Algorithm-enhanced Solovay-Kitaev Algorithm…

Quantum Physics · Physics 2026-01-21 Jiangwei Long , Zihui Liu , Yizhi Li , Jianxin Zhong , Lijun Meng

The advancement of information processing into the realm of quantum mechanics promises a transcendence in computational power that will enable problems to be solved which are completely beyond the known abilities of any "classical"…

Quantum Physics · Physics 2010-03-16 Parsa Bonderson , Sankar Das Sarma , Michael Freedman , Chetan Nayak

The possibility of quantum computation using non-Abelian anyons has been considered for over a decade. However the question of how to obtain and process information about what errors have occurred in order to negate their effects has not…

Quantum Physics · Physics 2014-04-02 James R. Wootton , Jan Burri , Sofyan Iblisdir , Daniel Loss

We study the non-abelian statistics characterizing systems where counter-propagating gapless modes on the edges of fractional quantum Hall states are gapped by proximity-coupling to superconductors and ferromagnets. The most transparent…

Mesoscale and Nanoscale Physics · Physics 2012-11-27 Netanel H. Lindner , Erez Berg , Gil Refael , Ady Stern

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

Rig groupoids provide a semantic model of \PiLang, a universal classical reversible programming language over finite types. We prove that extending rig groupoids with just two maps and three equations about them results in a model of…

Programming Languages · Computer Science 2024-06-17 Jacques Carette , Chris Heunen , Robin Kaarsgaard , Amr Sabry
‹ Prev 1 3 4 5 6 7 10 Next ›