Unitary braiding operators can be used as robust entangling quantum gates. We introduce a solution-generating technique to solve the $(d,m,l)$-generalized Yang-Baxter equation, for $m/2\leq l \leq m$, which allows to systematically construct such braiding operators. This is achieved by using partition algebras, a generalization of the Temperley-Lieb algebra encountered in statistical mechanics. We obtain families of unitary and non-unitary braiding operators that generate the full braid group. Explicit examples are given for a 2-, 3-, and 4-qubit system, including the classification of the entangled states generated by these operators based on Stochastic Local Operations and Classical Communication.
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 the symmetric group, we construct new unitary braid representations, which are solutions to generalized Yang-Baxter equations and use them to realize new braiding quantum gates. These gates generate the GHZ (Greenberger-Horne-Zeilinger) states, for an arbitrary (particularly an \emph{odd}) number of qubits, from the product basis. We also discuss the Yang-Bax…
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 entanglement which can speed up key distribution and accelerate the execution of algorithms. Ternary braiding gates acting on three qubit states are studied in detail. We also consider exotic non-invertible gates which can be related to qubit loss, and define partial identities (which can be orthogonal), partial unitarity, and partially bounded operators (which ca…
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.
We give a general proof for the existence and realizability of Clifford gates in the Ising topological quantum computer. We show that all quantum gates that can be implemented by braiding of Ising anyons are Clifford gates. We find that the braiding gates for two qubits exhaust the entire two-qubit Clifford group. Analyzing the structure of the Clifford group for n \geq 3 qubits we prove that the the image of the braid group is a non-trivial subgroup of the Clifford group so that not all Clifford gates could be implemented by braiding in the Ising topological quantum computation scheme. We als…
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 qubit built with three Fibonacci anyons might be adopted to achieve leakage free braiding gate by exchanging the anyons …
For a generic $n$-qubit system, local invariants under the action of $SL(2,\mathbb{C})^{\otimes n}$ characterize non-local properties of entanglement. In general, such properties are not immediately apparent and hard to construct. Here we consider certain two-qubit Yang-Baxter operators, which we dub of the `X-type', and show that their eigenvalues completely determine the non-local properties of the system. Moreover, we apply the Turaev procedure to these operators and obtain their associated link/knot polynomials. We also compute their entangling power and compare it with that of a generic t…
It is fundamental to view unitary braiding operators describing topological entanglements as universal quantum gates for quantum computation. This paper derives a unitary solution of the Quantum Yang--Baxter equation via Yang--Baxterization and constructs the Hamiltonian responsible for the time-evolution of the unitary braiding operator.
This paper explores of the role of unitary braiding operators in quantum computing. We show that a single specific solution R (the Bell basis change matrix) of the Yang-Baxter Equation is a universal gate for quantum computing, in the presence of local unitary transformations. We show that this same R generates a new non-trivial invariant of braids, knots, and links. Other solutions of the Yang-Baxter Equation are also shown to be universal for quantum computation. The paper discusses these results in the context of comparing quantum and topological points of view. In particular, we discuss qu…
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 alone braiding the non-Abelian anyons. Here, we propose a disk model that can realize the Fibonacci anyon system, and c…
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 statistics for gate operations at the code level. Here, we discuss the implementation of color codes in arrays of Majorana nanowires that avoid branched networks such as T-junctions, thereby simplifying their realization. We show that, in such implementations, nonabelian statistics can be exploited without ever performing physical braiding operations. Physica…
We simulate the dynamics of braiding Majorana zero modes on an IBM Quantum computer. We find the native quantum gates introduce too much noise to observe braiding. Instead, we use Qiskit Pulse to develop scaled two-qubit quantum gates that better match the unitary time evolution operator and enable us to observe braiding. This work demonstrates that quantum computers can be used for simulation, and highlights the use of pulse-level control for programming quantum computers and constitutes the first experimental evidence of braiding via dynamical Hamiltonian evolution.
Braiding operators can be used to create entangled states out of product states, thus establishing a correspondence between topological and quantum entanglement. This is well-known for maximally entangled Bell and GHZ states and their equivalent states under Stochastic Local Operations and Classical Communication, but so far a similar result for W states was missing. Here we use generators of extraspecial 2-groups to obtain the W state in a four-qubit space and partition algebras to generate the W state in a three-qubit space. We also present a unitary generalized Yang-Baxter operator that emb…
Universal Quantum Gate Compilation in $SU(2)_k$ Anyon Models via Multiple-Braiding
School of Physics and Optoelectronics, Xiangtan University（湘潭大学物理与光电工程学院）；School of Physics and Electronic Science, Hunan Institute of Science and Technology（湖南理工学院物理与电子科学学部）
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 operations in order to produce an exact controlled rotation gate on two qubits.
The unitary braiding operators describing topological entanglements can be viewed as universal quantum gates for quantum computation. With the help of the Brylinskis's theorem, the unitary solutions of the quantum Yang--Baxter equation can be also related to universal quantum gates. This paper derives the unitary solutions of the quantum Yang--Baxter equation via Yang--Baxterization from the solutions of the braided relation. We study Yang--Baxterizations of the non-standard and standard representations of the six-vertex model and the complete solutions of the non-vanishing eight-vertex model.…
We propose and analyze a physical system capable of performing topological quantum computation with Majorana zero modes (MZM) in a one-dimensional topological superconductor (1DTS). One of the leading methods to realize quantum gates in 1DTS is to use T-junctions, which allows one to maneuver MZMs such as to achieve braiding. In this paper, we propose a scheme that is in a purely one-dimensional geometry and does not require T-junctions, instead replacing it with an auxiliary qubit. We show that this allows one to perform one and two logical qubit $ Z $ rotations. We first design a topological…
Important developments in fault-tolerant quantum computation using the braiding of anyons have placed the theory of braid groups at the very foundation of topological quantum computing. Furthermore, the realization by Kauffman and Lomonaco that a specific braiding operator from the solution of the Yang-Baxter equation, namely the Bell matrix, is universal implies that in principle all quantum gates can be constructed from braiding operators together with single qubit gates. In this paper we present a new class of braiding operators from the Temperley-Lieb algebra that generalizes the Bell matr…
Universal Gates from Braiding and Fusing Anyons on Quantum Hardware
Harvard University（哈佛大学）；Quantinuum；Stony Brook University（石溪大学）；C. N. Yang Institute for Theoretical Physics, Stony Brook University（石溪大学杨振宁理论物理研究所）；University of Chicago（芝加哥大学）
Braiding defects in topological stabiliser codes has been widely studied as a promising approach to fault-tolerant quantum computing. Here, we explore the potential and limitations of such schemes in codes of all spatial dimensions. We prove that a universal gate set for quantum computing cannot be realised by supplementing locality-preserving logical operators with defect braiding, even in more than two dimensions. However, notwithstanding this no-go theorem, we demonstrate that higher dimensional defect-braiding schemes have the potential to play an important role in realising fault-tolerant…
We show that universal quantum computation can be performed within the ground state of a topologically ordered quantum system, which is a naturally protected quantum memory. In particular, we show how this can be achieved using brane-net condensates in 3-colexes. The universal set of gates is implemented without selective addressing of physical qubits and, being fully topologically protected, it does not rely on quasiparticle excitations or their braiding.
Braiding of non-Abelian Majorana anyons is a first step towards using them in quantum computing. We propose a protocol for braiding Majorana zero modes formed at the edges of nanowires with strong spin orbit coupling and proximity induced superconductivity. Our protocol uses high frequency virtual tunneling between the ends of the nanowires in a tri-junction, which leads to an effective low frequency coarse grained dynamics for the system, to perform the braid. The braiding operation is immune to amplitude noise in the drives, and depends only on relative phase between the drives, which can be…
Fourier transform is an essential ingredient in Shor's factoring algorithm. In the standard quantum circuit model with the gate set $\{\U(2), \textrm{CNOT}\}$, the discrete Fourier transforms $F_N=(ω^{ij})_{N\times N},i,j=0,1,..., N-1, ω=e^{\frac{2πi}{N}}$, can be realized exactly by quantum circuits of size $O(n^2), n=\textrm{log}N$, and so can the discrete sine/cosine transforms. In topological quantum computing, the simplest universal topological quantum computer is based on the Fibonacci (2+1)-topological quantum field theory (TQFT), where the standard quantum circuits are replaced by unit…
Topologically Protected Learning from Exceptional Point Braiding: Toward Braid Programming
University of Bamenda（班达马大学）；Higher Teachers Training College, University of Bamenda（班达马大学高等教师培训学院）；Department of Physics, Faculty of Science, University of Dschang（杜尚格大学理学院物理系）；Unité de Recherche de Matière Condensée, d’Électronique et de Traitement de Signal (URMACETS)（凝聚态物质、电子与信号处理研究组）；Promotion Centre of Research for Technological Advancement and Sustainable Development (PCR-TASD)（促进技术进步与可持续发展研究中心）；Quantum Materials and Computing Group (QMaCG)（量子材料与计算小组）；Université des Sciences et Techniques de Masuku（马苏库科学技术大学）；Laboratoire d’Optique, Laser et Applications（光学、激光与应用实验室）
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 universal set of quantum gates. We construct, for the first time, a topologically protected Controlled-NOT gate which is entirely based on quasihole braidings of Pfaffian qubits. All single-qubit gates, except for the pi/8 gate, are also explicitly implemented by quasihole braidings. Instead of the pi/8 gate we try to construct a topologically protected Toffoli ga…
The common approach to topological quantum computation is to implement quantum gates by adiabatically moving non-Abelian anyons around each other. Here we present an alternative perspective based on the possibility of realizing the exchange (braiding) operators of anyons by adiabatically varying pairwise interactions between them rather than their positions. We analyze a system composed by four anyons whose couplings define a T-junction and we show that the braiding operator of two of them can be obtained through a particular adiabatic cycle in the space of the coupling parameters. We also dis…
Majorana-based quantum computation seeks to encode information non-locally in pairs of Majorana zero modes, thereby isolating qubit states from a local noisy environment. In addition to long coherence times, the attractiveness of Majorana-based quantum computing relies on achieving topologically protected Clifford gates from braiding operations. Recent works have conjectured that mean-field BCS calculations may fail to account for non-universal corrections to the Majorana braiding operations. Such errors would be detrimental to Majorana-based topological quantum computing schemes. In this work…
We report on a numerical experiment in which we use time-dependent potentials to braid non-abelian quasiparticles. We consider lattice bosons in a uniform magnetic field within the fractional quantum Hall regime, where $ν$, the ratio of particles to flux quanta, is near 1/2, 1 or 3/2. We introduce time-dependent potentials which move quasiparticle excitations around one another, explicitly simulating a braiding operation which could implement part of a gate in a quantum computation. We find that different braids do not commute for $ν$ near $1$ and $3/2$, with Berry matrices respectively consis…
The Sachdev-Ye-Kitaev (SYK) model is an all-to-all interacting Majorana fermion model for many-body quantum chaos and the holographic correspondence. Here we construct fermionic all-to-all Floquet quantum circuits of random four-body gates designed to capture key features of SYK dynamics. Our circuits can be built using local ingredients in Majorana devices, namely charging-mediated interactions and braiding Majorana zero modes. This offers an analog-digital route to SYK quantum simulations that reconciles all-to-all interactions with the topological protection of Majorana zero modes, a key fe…
Quantum information protected by the topology of the storage medium is expected to exhibit long coherence times. Another feature are topologically protected gates generated through braiding of Majorana bound states. However, braiding requires structures with branched topological segments which have inherent difficulties in the semiconductor-superconductor heterostructures now believed to host Majorana bound states. In this paper, we construct quantum bits taking advantage of the topological protection and non-local properties of Majorana bound states in a network of parallel wires, but without…
Parafermions are Zn generalisations of Majorana quasiparticles, with fractional non-Abelian statistics. They can be used to encode topological qudits and perform Clifford operations by their braiding. We study the simplest case of the Z3 parafermion chain and investigate the form of the non-topological gate that arises through direct short-range interaction of the parafermion edge modes. We show that such an interaction gives rise to a dynamical phase gate on the encoded ground space, with the strongest order of the interaction generating a non-Clifford gate which can be tuned to belong to eve…
In topologically-protected quantum computation, quantum gates can be carried out by adiabatically braiding two-dimensional quasiparticles, reminiscent of entangled world lines. Bonesteel et al. [Phys. Rev. Lett. 95, 140503 (2005)], as well as Leijnse and Flensberg [Phys. Rev. B 86, 104511 (2012)] recently provided schemes for computing quantum gates from quasiparticle braids. Mathematically, the problem of executing a gate becomes that of finding a product of the generators (matrices) in that set that approximates the gate best, up to an error. To date, efficient methods to compute these gates…
A fundamental question in the theory of quantum computation is to understand the ultimate space-time resource costs for performing a universal set of logical quantum gates to arbitrary precision. Here we demonstrate that non-Abelian anyons in Turaev-Viro quantum error correcting codes can be moved over a distance of order the code distance, and thus braided, by a constant depth local unitary quantum circuit followed by a permutation of qubits. Our gates are protected in the sense that the length of error strings do not grow by more than a constant factor. When applied to the Fibonacci code, ou…
Braiding of anyons such as Majoranas or parafermions provides only Clifford gates which do not form a universal set of quantum gates. We propose a robust and resource-efficient scheme to perform a non-Clifford gate on a logical qudit encoded in parafermionic zero modes via the Aharonov-Casher effect. This gate can be implemented by moving a half flux quantum around the pair of parafermionic zero modes. The parafermion modes can be realized in a two-dimensional set-up using existing proposals and a half fluxon carrying half flux quantum can be created as a part of a half fluxon/anti-half fluxon…
We theoretically demonstrate that non-Abelian braiding operation can be realized through the scattering between chiral Dirac edge modes (CDEMs) in quantum anomalous Hall insulators by analytically deriving its S-matrix. Based on the analytical model, we propose a viable device for the experimental realization and detection of the non-Abelian braiding operations. Through investigating the tunneling conductance in a discretized lattice model, the non-Abelian properties of CDEMs could also be verified in a numerical way. Our proposal for the CDEM-based braiding provides a new avenue for realizing…
Topological subsystem color codes add to the advantages of topological codes an important feature: error tracking only involves measuring 2-local operators in a two dimensional setting. Unfortunately, known methods to compute with them were highly unpractical. We give a mechanism to implement all Clifford gates by code deformation in a planar setting. In particular, we use twist braiding and express its effects in terms of certain colored Majorana operators.
High-Fidelity Universal Quantum Gate Compilation for Non-semisimple Ising Anyons via Genetic Algorithm-Optimized Solovay-Kitaev Decomposition
School of Physics and Optoelectronics, Xiangtan University（湘潭大学物理与光电工程学院）；School of Physics and Electronic Science, Hunan Institute of Science and Technology（湖南理工学院物理与电子科学学院）；Center for Quantum Science and Technology, Department of Physics, Shanghai University（上海大学物理学部量子科学与技术中心）
Majorana-based quantum gates are not complete for performing universal topological quantum computation while Fibonacci-based gates are difficult to be realized electronically and hardly coincide with the conventional quantum circuit models. In Ref. \cite{hukane}, it has been shown that a strongly correlated Majorana edge mode in a chiral topological superconductor can be decomposed into a Fibobacci anyon $τ$ and a thermal operator anyon $\varepsilon$ in the tricritical Ising model. The deconfinement of $τ$ and $\varepsilon$ via the interaction between the fermion modes yields the anyon {collis…
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 motivation for experimentally observing a topological state. Here we explicitly work out a realistic experimental scheme to …
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. Specifically, they simulate the behaviour of exotic particles known as Majoranas, which are a kind of non-Abelian anyon. By exchanging these particles, important gates for quantum computation can be implemented. Here we investigate the simplest possible exchange operation for two surface code Majoranas. This is found to act non-trivially on only five qubits. The syst…
