Related papers: Systematically generated two-qubit anyon braids
In this paper we find a Clifford algebra associated to generalized Fibonacci quaternions. In this way, we provide a nice algorithm to obtain a division quaternion algebra starting from a quaternion non-division algebra and vice-versa.
We propose a framework for topological quantum computation using newly discovered non-semisimple analogs of topological quantum field theories in 2+1 dimensions. These enhanced theories offer more powerful models for quantum computation.…
In this paper we describe connections among extraspecial 2-groups, unitary representations of the braid group and multi-qubit braiding quantum gates. We first construct new representations of extraspecial 2-groups. Extending the latter by…
Currently, the mainstream approach to quantum computing is through surface codes. One way to store and manipulate quantum information with these to create defects in the codes which can be moved and used as if they were particles.…
Boundary conformal field theory is brought to bear on the study of topological insulating phases of non-abelian anyonic chains. These topologically non-trivial phases display protected anyonic end modes. We consider antiferromagnetically…
Optimal construction of quantum operations is a fundamental problem in the realization of quantum computation. We here introduce a newly discovered quantum gate, B, that can implement any arbitrary two-qubit quantum operation with minimal…
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…
We demonstrate that in a coupled two-qubit system any single-qubit gate can be decomposed into two conditional two-qubit gates and that any conditional two-qubit gate can be implemented by a manipulation analogous to that used for a…
The structure of quantum mechanics forbids a bipartite scenario for masking quantum information, however, it allows multipartite maskers. The Latin squares are found to be closely related to a series of tripartite maskers. This adds another…
Topological quantum computation relies on control of non-Abelian anyons for inherently fault-tolerant storage and processing of quantum information. By now, blueprints for topological qubits are well developed for electrically active…
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…
We propose an encoding for topological quantum computation utilizing quantum representations of mapping class groups. Leakage into a non-computational subspace seems to be unavoidable for universality in general. We are interested in the…
Recent work suggests that topological features of certain quantum gravity theories can be interpreted as particles, matching the known fermions and bosons of the first generation in the Standard Model. This is achieved by identifying…
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
We generalize an algorithm established in earlier work \cite{algebrapaper} to compute finitely many generators for a subgroup of finite index of an arithmetic group acting properly discontinuously on hyperbolic space of dimension $2$ and…
We review the topological quantum computation scheme of Das Sarma et al. from the perspective of the conformal field theory for the two-dimensional critical Ising model. This scheme originally used the monodromy properties of the…
We find exact solutions for a universal set of quantum gates on a scalable candidate for quantum computers, namely an array of two level systems. The gates are constructed by a combination of dynamical and geometrical (non-Abelian) phases.…
Any unitary transformation of quantum computational networks is explicitly decomposed, in an exact and unified form, into a sequence of a limited number of one-qubit quantum gates and the two-qubit diagonal gates that have diagonal unitary…
We construct a braiding operator in terms of the quantum dilogarithm function based on the quantum cluster algebra. We show that it is a q-deformation of the R-operator for which hyperbolic octrahedron is assigned. Also shown is that, by…
This is a tutorial review of methods to braid the world lines of non-Abelian anyons (Majorana zero-modes) in topological superconductors. That "Holy Grail" of topological quantum information processing has not yet been reached in the…