Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Institute of Physics eBooks

Higher braid quantum gates

Steven Anatolievich Duplij, Raimund Vogl

Published Nov 1, 2023• 0 citations
Publisher

Abstract

A new kind of quantum gates, higher braiding gates, are introduced and studied. These are matrix solutions of the polyadic braid 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 can be non-invertible). The higher braid group and its representation by higher braid operators are given.

DOI
10.1088/978-0-7503-5281-9ch2

Related papers

Polyadic Braid Operators and Higher Braiding Gates

Steven Anatolievich Duplij, Raimund Vogl

A new kind of quantum gates, higher braiding gates, as matrix solutions of the polyadic braid equations (different from the generalized Yang–Baxter equations) is introduced. Such gates lead to another special multiqubit entanglement that can speed up key distribution and accelerate algorithms. Ternary braiding gates acting on three qubit states are studied in detail. We also consider exotic non-invertible gates, which can be related with qubit loss, and define partial identities (which can be orthogonal), partial unitarity, and partially bounded operators (which can be non-invertible). We define two classes of matrices, star and circle ones, such that the magic matrices (connected with the Cartan decomposition) belong to the star class. The general algebraic structure of the introduced classes is described in terms of semigroups, ternary and 5-ary groups and modules. The higher braid group and its representation by the higher braid operators are given. Finally, we show, that for each multiqubit state, there exist higher braiding gates that are not entangling, and the concrete conditions to be non-entangling are given for the obtained binary and ternary gates.

arXiv:2107.08789•Universe•Aug 15, 2021•3 citations

Quantum entanglement, unitary braid representation and Temperley-Lieb algebra

C.-L. Ho, A. I. Solomon, C.-H. Oh

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 matrix to multi-qubit systems, thus unifying the Hadamard and Bell matrices within the same framework. Unlike previous braiding operators, these new operators generate directly , from separable basis states, important entangled states such as the generalized Greenberger-Horne-Zeilinger states, cluster-like states, and other states with varying degrees of entanglement.

arXiv:1011.6229•Europhysics Letters (EPL)•Nov 1, 2010•19 citations

Extraspecial two-Groups, generalized Yang-Baxter equations and braiding quantum gates

Eric C. Rowell, Yong Zhang, Yong-Shi Wu +1 more

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-Baxterization of the new braid group representations, which describes unitary evolution of the GHZ states. Our study suggests that through their connection with braiding gates, extraspecial 2-groups and the GHZ states may play an important role in quantum error correction and topological quantum computing.

arXiv:0706.1761•Quantum Information and Computation•Jul 1, 2010•44 citations

Braiding quantum gates from partition algebras

Pramod Padmanabhan, Fumihiko Sugino, Diego Trancanelli

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≤l≤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.

arXiv:2003.00244•Quantum•Aug 27, 2020•16 citations

Topological quantum gate entanglers for a multi-qubit state

Hoshang Heydari

We establish a relation between topological and quantum entanglement for a multi-qubit state by considering the unitary representations of the Artin braid group. We construct topological operators that can entangle multi-qubit state. In particular we construct operators that create quantum entanglement for multi-qubit states based on the Segre ideal of complex multi-projective space. We also in detail discuss and construct these operators for two-qubit and three-qubit states.

arXiv:quant-ph/0702015•Journal of Physics A Mathematical and Theoretical•Jul 24, 2007•9 citations

Quantum computing with parafermions

Adrian Hutter, Daniel Loss

${\mathbb{Z}}_{d}$ parafermions are exotic non-Abelian quasiparticles generalizing Majorana fermions, which correspond to the case $d=2$. In contrast to Majorana fermions, braiding of parafermions with $d>2$ allows one to perform an entangling gate. This has spurred interest in parafermions, and a variety of condensed matter systems have been proposed as potential hosts for them. In this work, we study the computational power of braiding parafermions more systematically. We make no assumptions on the underlying physical model but derive all our results from the algebraical relations that define parafermions. We find a family of $2d$ representations of the braid group that are compatible with these relations. The braiding operators derived this way reproduce those derived previously from physical grounds as special cases. We show that if a $d$-level qudit is encoded in the fusion space of four parafermions, braiding of these four parafermions allows one to generate the entire single-qudit Clifford group (up to phases), for any $d$. If $d$ is odd, then we show that in fact the entire many-qudit Clifford group can be generated.

arXiv:1511.02704•Physical review. B./Physical review. B•Mar 2, 2016•75 citations
A new kind of quantum gates, higher braiding gates, are introduced and studied. These are matrix solutions of the polyadic braid 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 can be non-invertible). The higher braid group and its representation by higher braid operators are given.
A new kind of quantum gates, higher braiding gates, as matrix solutions of the polyadic braid equations (different from the generalized Yang–Baxter equations) is introduced. Such gates lead to another special multiqubit entanglement that can speed up key distribution and accelerate algorithms. Ternary braiding gates acting on three qubit states are studied in detail. We also consider exotic non-invertible gates, which can be related with qubit loss, and define partial identities (which can be orthogonal), partial unitarity, and partially bounded operators (which can be non-invertible). We define two classes of matrices, star and circle ones, such that the magic matrices (connected with the Cartan decomposition) belong to the star class. The general algebraic structure of the introduced classes is described in terms of semigroups, ternary and 5-ary groups and modules. The higher braid group and its representation by the higher braid operators are given. Finally, we show, that for each multiqubit state, there exist higher braiding gates that are not entangling, and the concrete conditions to be non-entangling are given for the obtained binary and ternary gates.
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 matrix to multi-qubit systems, thus unifying the Hadamard and Bell matrices within the same framework. Unlike previous braiding operators, these new operators generate directly , from separable basis states, important entangled states such as the generalized Greenberger-Horne-Zeilinger states, cluster-like states, and other states with varying degrees of entanglement.
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-Baxterization of the new braid group representations, which describes unitary evolution of the GHZ states. Our study suggests that through their connection with braiding gates, extraspecial 2-groups and the GHZ states may play an important role in quantum error correction and topological quantum computing.
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≤l≤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.
Zd{\mathbb{Z}}_{d}Zd​ parafermions are exotic non-Abelian quasiparticles generalizing Majorana fermions, which correspond to the case d=2d=2d=2. In contrast to Majorana fermions, braiding of parafermions with d>2d>2d>2 allows one to perform an entangling gate. This has spurred interest in parafermions, and a variety of condensed matter systems have been proposed as potential hosts for them. In this work, we study the computational power of braiding parafermions more systematically. We make no assumptions on the underlying physical model but derive all our results from the algebraical relations that define parafermions. We find a family of 2d2d2d representations of the braid group that are compatible with these relations. The braiding operators derived this way reproduce those derived previously from physical grounds as special cases. We show that if a ddd-level qudit is encoded in the fusion space of four parafermions, braiding of these four parafermions allows one to generate the entire single-qudit Clifford group (up to phases), for any ddd. If ddd is odd, then we show that in fact the entire many-qudit Clifford group can be generated.