March 29, 2024
Similar papers 2
August 8, 2020
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 universal set of quantum gates can be constructed by braiding these anyons yielding to a topologically protected circuit model. In the present study we remind the basics of this emerging quantum computation scheme and illustrate how a topological ...
October 21, 2022
Topological quantum computation (TQC) is one of the most striking architectures that can realize fault-tolerant quantum computers. In TQC, the logical space and the quantum gates are topologically protected, i.e., robust against local disturbances. The topological protection, however, requires rather complicated lattice models and hard-to-manipulate dynamics; even the simplest system that can realize universal TQC--the Fibonacci anyon system--lacks a physical realization, let...
October 13, 2006
A method for compiling quantum algorithms into specific braiding patterns for non-Abelian quasiparticles described by the so-called Fibonacci anyon model is developed. The method is based on the observation that a universal set of quantum gates acting on qubits encoded using triplets of these quasiparticles can be built entirely out of three-stranded braids (three-braids). These three-braids can then be efficiently compiled and improved to any required accuracy using the Solo...
August 24, 2016
Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing device for special purposes, also offers a way of characterizing topological orders. Here, we show how to identify distinct topological orders via measuring their modular $S$ and $T$ matrices. In particular, we employ a nuclear magnetic resonan...
October 15, 2013
In a topological quantum computer, universality is achieved by braiding and quantum information is natively protected from small local errors. We address the problem of compiling single-qubit quantum operations into braid representations for non-abelian quasiparticles described by the Fibonacci anyon model. We develop a probabilistically polynomial algorithm that outputs a braid pattern to approximate a given single-qubit unitary to a desired precision. We also classify the s...
June 23, 2010
Topological quantum computation provides an elegant way around decoherence, as one encodes quantum information in a non-local fashion that the environment finds difficult to corrupt. Here we establish that one of the key operations---braiding of non-Abelian anyons---can be implemented in one-dimensional semiconductor wire networks. Previous work [Lutchyn et al., arXiv:1002.4033 and Oreg et al., arXiv:1003.1145] provided a recipe for driving semiconducting wires into a topolog...
March 5, 2010
We study various aspects of the topological quantum computation scheme based on the non-Abelian anyons corresponding to fractional quantum hall effect states at filling fraction 5/2 using the Temperley-Lieb recoupling theory. Unitary braiding matrices are obtained by a normalization of the degenerate ground states of a system of anyons, which is equivalent to a modification of the definition of the 3-vertices in the Temperley-Lieb recoupling theory as proposed by Kauffman and...
October 1, 2014
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 evolved from a highly theoretical subject to an active experimental area, particularly following proposals for trapping non-Abelian anyons in `engineered' structures built from well-understood components. In this short overview we briefly ...
February 3, 2018
Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two qubits without leaving the space spanned by the two qubits. In other words, there is no known "leakage-free" entangling gate made by braiding. In this paper, we provide a remedy to this problem by supplementing braiding with measurement opera...
December 12, 2008
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 create and exploit redundant geometric degrees of freedom to improve the theoretical accuracy of topological single- and two-qubit quantum gates. We demonstrate the power of the idea using explicit constructions in the Fibonacci model. We compar...