English
Related papers

Related papers: Decoding non-Abelian topological quantum memories

200 papers

Identification of defects or anomalies in 3D objects is a crucial task to ensure correct functionality. In this work, we combine Bayesian learning with recent developments in quantum and quantum-inspired machine learning, specifically…

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

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

The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other…

Quantum Physics · Physics 2008-09-16 Stephen P. Jordan

Many proposals for quantum information processing are subject to detectable loss errors. In this paper, we give a detailed account of recent results in which we showed that topological quantum memories can simultaneously tolerate both loss…

Quantum Physics · Physics 2015-05-14 T. M. Stace , S. D. Barrett

Simulators can realise novel phenomena by separating them from the complexities of a full physical implementation. Here we put forward a scheme that can simulate the exotic statistics of $D(S_3)$ non-Abelian anyons with minimal resources.…

Anyons exhibit a non-trivial interplay between local exclusion rules and non-local braiding and exchange phases, making a consistent commutation algebra and second-quantized formulation challenging. We develop an algebraic framework for…

Strongly Correlated Electrons · Physics 2026-05-07 Priyanshi Bhasin , Diptiman Sen , Tanmoy Das

Topological quantum error correction codes are currently among the most promising candidates for efficiently dealing with the decoherence effects inherently present in quantum devices. Numerically, their theoretical error threshold can be…

Quantum Physics · Physics 2016-07-13 Ruben S. Andrist , Helmut G. Katzgraber , H. Bombin , M. A. Martin-Delgado

The efficient validation of quantum devices is critical for emerging technological applications. In a wide class of use-cases the precise engineering of a Hamiltonian is required both for the implementation of gate-based quantum information…

Quantum Physics · Physics 2019-11-20 Agnes Valenti , Evert van Nieuwenburg , Sebastian Huber , Eliska Greplova

A topological quantum computer should allow intrinsically fault-tolerant quantum computation, but there remains uncertainty about how such a computer can be implemented. It is known that topological quantum computation can be implemented…

Quantum Physics · Physics 2012-06-22 Ben W. Reichardt

An obstacle affecting any proposal for a topological quantum computer based on Ising anyons is that quasiparticle braiding can only implement a finite (non-universal) set of quantum operations. The computational power of this restricted set…

Quantum Physics · Physics 2012-02-08 Mark Howard , Jiri Vala

Quantum states are very delicate, so it is likely some sort of quantum error correction will be necessary to build reliable quantum computers. The theory of quantum error-correcting codes has some close ties to and some striking differences…

Quantum Physics · Physics 2009-04-17 Daniel Gottesman

Fault tolerant quantum computers will require efficient co-processors for real-time decoding of their adopted quantum error correction protocols. In this work we examine the possibility of using specialised Ising model hardware to perform…

Quantum Physics · Physics 2019-03-26 Joschka Roffe , Stefan Zohren , Dominic Horsman , Nicholas Chancellor

A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to…

Quantum Physics · Physics 2007-05-23 Michele Mosca , Artur Ekert

Quantum error correction allows for faulty quantum systems to behave in an effectively error free manner. One important class of techniques for quantum error correction is the class of quantum subsystem codes, which are relevant both to…

Quantum Physics · Physics 2013-05-29 Gregory M. Crosswhite , Dave Bacon

Quantum computational models can be approached via the lens of resources needed to perform computational tasks, where a computational advantage is achieved by consuming specific forms of quantum resources, or, conversely, resource-free…

Quantum Physics · Physics 2024-07-15 Allan Tosta , Antônio C. Lourenço , Daniel Brod , Fernando Iemini , Tiago Debarba

Anyons are exotic quasi-particles with fractional charge that can emerge as fundamental excitations of strongly interacting topological quantum phases of matter. Unlike ordinary fermions and bosons, they may obey non-abelian statistics--a…

Strongly Correlated Electrons · Physics 2018-03-14 Zlatko Papić , Roger S. K. Mong , Ali Yazdani , Michael P. Zaletel

Known quantum error correction schemes are typically able to take advantage of only a limited class of classical error-correcting codes. Entanglement-assisted quantum error correction is a partial solution which made it possible to exploit…

Quantum Physics · Physics 2013-04-24 Yuichiro Fujiwara

This paper serves as a bridge between quantum computing and analogical modeling (a general theory for predicting categories of behavior in varying contexts). Since its formulation in the early 1980s, analogical modeling has been…

Quantum Physics · Physics 2007-05-23 Royal Skousen

We discuss how to construct models of interacting anyons by generalizing quantum spin Hamiltonians to anyonic degrees of freedom. The simplest interactions energetically favor pairs of anyons to fuse into the trivial ("identity") channel,…

Statistical Mechanics · Physics 2009-02-20 Simon Trebst , Matthias Troyer , Zhenghan Wang , Andreas W. W. Ludwig
‹ Prev 1 4 5 6 7 8 10 Next ›