Related papers: Quantum Computing with Parafermions
Higher braiding gates, a new kind of quantum gate, are introduced. These are matrix solutions of the polyadic braid equations (which differ from the generalized Yang-Baxter equations). Such gates support a special kind of multi-qubit…
We propose an experiment to directly probe the non-Abelian statistics of Majorana fermions by braiding them in an s-wave superfluid of ultracold atoms. We show different orders of braiding operations give orthogonal output states that can…
Topological superconductors (TSCs) provide a promising route to fault-tolerant quantum information processing. However, the canonical Majorana platform based on $2e$ TSCs remains computationally constrained. In this work, we find a $4e$ TSC…
Parafermions are emergent excitations which generalize Majorana fermions and are potentially relevant to topological quantum computation. Using the concept of Fock parafermions, we present a mapping between lattice $\mathbb{Z}_4$…
When the local dimension $d$ is an odd prime, the qudit Clifford group is only a 2-design, but not a 3-design, unlike the qubit counterpart. This distinction and its extension to Clifford orbits have profound implications for many…
Majorana-based topological qubits are expected to exploit the nonabelian braiding statistics of Majorana modes in topological superconductors to realize fault-tolerant topological quantum computation. Scalable qubit designs require several…
The paper is devoted to projective Clifford groups of quantum $N$-dimensional systems. Clearly, Clifford gates allow only the simplest quantum computations which can be simulated on a classical computer (Gottesmann-Knill theorem). However,…
We propose models of quantum neural networks through Clifford algebras, which are capable of capturing geometric features of systems and to produce entanglement. Due to their representations in terms of Pauli matrices, the Clifford algebras…
We propose to use residual parafermions of the overscreened Kondo effect for topological quantum computation. A superconducting proximity gap of $\Delta<T_K$ can be utilized to isolate the parafermion from the continuum of excitations and…
Even-denominator quantum Hall states can host several types of anyons with distinct exchange statistics. Depending on the anyon type, exchanging two quasiparticles can impart a phase to the many-body wave function or even transform it into…
Clifford algebras are used for constructing spin groups, and are therefore of particular importance in the theory of quantum mechanics. But the spin group is not the only subgroup of the Clifford algebra. An algebraist's perspective on…
We study the implementation of a universal quantum gate set via multiple-braiding within $SU(2)_k$ ($k > 2$, $k \neq 4$) anyon models. The multiple elementary braiding matrices (MEBMs) are derived from the $q$-deformed representation theory…
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…
Braid theories are applied to quantum computation processes, where to each crossing in the Braid diagram a unitary Yang-Baxter operator R is associated, representing either a Braiding matrix or a universal quantum gate. By operating with…
The discussions in the present paper arise from exploring intrinsically the structure nature of the quantum $n$-space. A kind of braided category $\Cal {GB}$ of $\La$-graded $\th$-commutative associative algebras over a field $k$ is…
An effective quantum field theory description of graphene in the ultra-relativistic regime is given by reduced QED aka. pseudo QED aka. mixed-dimensional QED. It has been speculated in the literature that reduced QED constitutes an example…
Qubits in topological quantum computation are built from non-Abelian anyons. Adiabatic braiding of anyons is exploited as topologically protected logical gate operations. Thus, the adiabaticity upon which the notion of quantum statistics is…
Robust quantum computation with d-level quantum systems (qudits) poses two requirements: fast, parallel quantum gates and high fidelity two-qudit gates. We first describe how to implement parallel single qudit operations. It is by now well…
Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…
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…