June 2, 2012
Similar papers 4
April 3, 2019
It is an open question if there are leakage-free entangling Fibonacci braiding gates. We provide evidence to the conjecture for the negative in this paper. We also found a much simpler protocol to generate approximately leakage-free entangling Fibonacci braiding gates than existing algorithms in the literature.
August 24, 2022
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 mathematical study of braids is crucial for the theory. We provide some brief historical context as well, emphasizing ways that braiding appears in physical contexts. We also briefly discuss the 3-dimensional generalization of braiding: motions...
April 9, 2020
Quantum compiling, a process that decomposes the quantum algorithm into a series of hardware-compatible commands or elementary gates, is of fundamental importance for quantum computing. We introduce an efficient algorithm based on deep reinforcement learning that compiles an arbitrary single-qubit gate into a sequence of elementary gates from a finite universal set. It generates near-optimal gate sequences with given accuracy and is generally applicable to various scenarios, ...
July 16, 2013
Non-Abelian anyons promise to reveal spectacular features of quantum mechanics that could ultimately provide the foundation for a decoherence-free quantum computer. A key breakthrough in the pursuit of these exotic particles originated from Read and Green's observation that the Moore-Read quantum Hall state and a (relatively simple) two-dimensional p+ip superconductor both support so-called Ising non-Abelian anyons. Here we establish a similar correspondence between the Z_3 R...
August 17, 2015
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 truly scalable, even rare errors need to be corrected. Error correction for non-Abelian anyons is complicated by the fact that it needs to be performed on a continuous basis and further errors may occur while we are correcting existing ones....
January 22, 2010
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 sparse representations of quantum information (qubits) and a simple construction of multi-qubit gates, for all anyon models from Chern-Simons-Witten SU(2)$_k$ theory that support universal quantum computation by braiding ($k\geq 3,\ k \neq 4$). ...
November 7, 2022
Unitary fusion categories formalise the algebraic theory of topological quantum computation. These categories come naturally enriched in a subcategory of the category of Hilbert spaces, and by looking at this subcategory, one can identify a collection of generators for implementing quantum computation. We represent such generators for the Fibonacci and Ising models, namely the encoding of qubits and the associated braid group representations, with the ZX-calculus and show tha...
July 27, 2020
Fibonacci anyon, an exotic quasi-particle excitation, plays a pivotal role in realization of a quantum computer. Starting from a $SU(2)_4$ topological phase, in this paper we demonstrate a way to construct a Fibonacci topological phase which has only one non-trivial excitation described by the Fibonacci anyon. We show that arrays of anyonic chains created by excitations of the $SU(2)_4$ phase leads to the Fibonacci phase. We further demonstrate that our theoretical propositio...
January 28, 2014
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, accessible anyons with current technology all belong to a class that is called weakly integral---anyons whose squared quantum dimensions are integers. We analyze the computational power of the first non-abelian anyon system with only integral quantu...
September 13, 2006
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 computation proposes to use the topological protection and the braiding statistics of a non-Abelian topological state to perform quantum computation. The enormous technological prospect of topological quantum computation provides new moti...