Related papers: Systematically generated two-qubit anyon braids
If g is a quasitriangular Lie bialgebra, one can asks what is the geometrical meaning of its r-matrix. A first answer was given in a paper by Weinstein and Xu, using purely geometrical means: roughly, one has that the formal Poisson group…
Anyons, quasiparticles living in two-dimensional spaces with exotic exchange statistics, can serve as the fundamental units for fault-tolerant quantum computation. However, experimentally demonstrating anyonic statistics is a challenge due…
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…
Majorana fermions and their generalizations to $\mathbb{Z}_n$ parafermions are considered promising building blocks of fault-tolerant quantum computers for their ability to encode quantum information nonlocally. In such topological quantum…
Quantum operations by utilizing the underlying geometric phases produced in physical systems are favoured due to its potential robustness. When a system in a non-degenerate eigenstate undergoes an adiabatically cyclic evolution dominated by…
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…
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…
We describe rational knots with any of the possible combinations of the properties (a)chirality, (non-)positivity, (non-)fiberedness, and unknotting number one (or higher), and determine exactly their number for a given number of crossings…
Reliable manipulation of non-Abelian Ising anyons supported by Kitaev spin liquids may enable intrinsically fault-tolerant quantum computation. Here, we introduce a standalone scheme for both generating and detecting individual Ising anyons…
Fully braided analog of Faddeev-Reshetikhin-Takhtajan construction of quasitriangular bialgebra $A(X,R)$ is proposed. For given pairing $C$ factor-algebra $A(X,R;C)$ is a dual quantum braided group. Corresponding inhomogeneous quantum group…
Quantum $\mathcal{R}$-matrices are the building blocks for the colored HOMFLY polynomials. In the case of three-strand braids with an identical finite-dimensional irreducible representation $T$ of $SU_q(N)$ associated with each strand one…
We extend the topological quantum computation scheme using the Pfaffian quantum Hall state, which has been recently proposed by Das Sarma et al., in a way that might potentially allow for the topologically protected construction of a…
Topological quantum computing promises error-resistant quantum computation without active error correction. However, there is a worry that during the process of executing quantum gates by braiding anyons around each other, extra anyonic…
These extended lecture notes survey a novel derivation of anyonic topological order (as seen in fractional quantum Hall systems) on single magnetized M5-branes probing Seifert orbi-singularities ("geometric engineering" of anyons), which we…
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…
Non-Abelian anyons are fractional excitations of gapped topological models believed to describe certain topological superconductors or quantum Hall states. Here, we provide the first numerical evidence that they emerge as independent…
We present some deterministic schemes to construct universal quantum gates, that is, controlled- NOT, three-qubit Toffoli, and Fredkin gates, between flying photon qubits and stationary electron-spin qubits assisted by quantum dots inside…
Exact synthesis is a tool used in algorithms for approximating an arbitrary qubit unitary with a sequence of quantum gates from some finite set. These approximation algorithms find asymptotically optimal approximations in probabilistic…
Coherent control and braiding of anyons remain central challenges in realizing topologically protected quantum operations. We propose a Ramsey interferometry protocol to directly access the geometric phases associated with anyons in…
We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated…