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

arXiv:2003.00244 · Quantum

Braiding quantum gates from partition algebras

Pramod Padmanabhan, Fumihiko Sugino, Diego Trancanelli

Published Aug 27, 2020• 15 citations
arXivHTMLPDF

Abstract

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.

DOI
10.22331/q-2020-08-27-311

Related papers

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•11 citations

Quantum entanglement, unitary braid representation and Temperley-Lieb algebra

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

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.

•Nov 1, 2010•16 citations

Generating W states with braiding operators

Pramod Padmanabhan, Fumihiko Sugino, Diego Trancanelli

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 embeds the W_n state in a (2n-1)-qubit space.

Quantum Information and Computation•Nov 1, 2020•4 citations

GENERALIZED YANG–BAXTER EQUATIONS AND BRAIDING QUANTUM GATES

REBECCA S. CHEN

Solutions to the Yang–Baxter equation — an important equation in mathematics and physics — and their afforded braid group representations have applications in fields such as knot theory, statistical mechanics, and, most recently, quantum information science. In particular, unitary representations of the braid group are desired because they generate braiding quantum gates. These are actively studied in the ongoing research into topological quantum computing. A generalized Yang–Baxter equation was proposed a few years ago by Eric Rowell et al. By finding solutions to the generalized Yang–Baxter equation, we obtain new unitary braid group representations. Our representations give rise to braiding quantum gates and thus have the potential to aid in the construction of useful quantum computers.

arXiv:1108.5215•Journal of Knot Theory and Its Ramifications•Jan 31, 2012•26 citations

Multi-qudit states generated by unitary braid quantum gates based on Temperley-Lieb algebra

C.-L. Ho, Tetsuo Deguchi

Using a braid group representation based on the Temperley-Lieb algebra, we construct braid quantum gates that could generate entangled n -partite D -level qudit states. D different sets of D n × D n unitary representation of the braid group generators are presented. With these generators the desired braid quantum gates are obtained. We show that the generalized GHZ states, which are maximally entangled states, can be obtained directly from these braid quantum gates without resorting to further local unitary transformations. We also point out an interesting observation, namely for a general multi-qudit state there exists a unitary braid quantum gate based on the Temperley-Lieb algebra that connects it from one of its component basis states, if the coefficient of the component state is such that the square of its norm is no less than 1/4.

arXiv:1611.06772•Europhysics Letters (EPL)•May 1, 2017•8 citations

Classical Simulation of Yang-Baxter Gates

Gorjan Alagic, Aniruddha Bapat, Stephen P. Jordan

A unitary operator that satisfies the constant Yang-Baxter equation immediately yields a unitary representation of the braid group B_n for every n >= 2. If we view such an operator as a quantum-computational gate, then topological braiding corresponds to a quantum circuit. A basic question is when such a representation affords universal quantum computation. In this work, we show how to classically simulate these circuits when the gate in question belongs to certain families of solutions to the Yang-Baxter equation. These include all of the qubit (i.e., d = 2) solutions, and some simple families that include solutions for arbitrary d >= 2. Our main tool is a probabilistic classical algorithm for efficient simulation of a more general class of quantum circuits. This algorithm may be of use outside the present setting.

arXiv:1407.1361•Leibniz international proceedings in informatics•Jan 1, 2014•4 citations
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.
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.
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.
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 embeds the W_n state in a (2n-1)-qubit space.
Solutions to the Yang–Baxter equation — an important equation in mathematics and physics — and their afforded braid group representations have applications in fields such as knot theory, statistical mechanics, and, most recently, quantum information science. In particular, unitary representations of the braid group are desired because they generate braiding quantum gates. These are actively studied in the ongoing research into topological quantum computing. A generalized Yang–Baxter equation was proposed a few years ago by Eric Rowell et al. By finding solutions to the generalized Yang–Baxter equation, we obtain new unitary braid group representations. Our representations give rise to braiding quantum gates and thus have the potential to aid in the construction of useful quantum computers.
Using a braid group representation based on the Temperley-Lieb algebra, we construct braid quantum gates that could generate entangled n -partite D -level qudit states. D different sets of D n × D n unitary representation of the braid group generators are presented. With these generators the desired braid quantum gates are obtained. We show that the generalized GHZ states, which are maximally entangled states, can be obtained directly from these braid quantum gates without resorting to further local unitary transformations. We also point out an interesting observation, namely for a general multi-qudit state there exists a unitary braid quantum gate based on the Temperley-Lieb algebra that connects it from one of its component basis states, if the coefficient of the component state is such that the square of its norm is no less than 1/4.
A unitary operator that satisfies the constant Yang-Baxter equation immediately yields a unitary representation of the braid group B_n for every n >= 2. If we view such an operator as a quantum-computational gate, then topological braiding corresponds to a quantum circuit. A basic question is when such a representation affords universal quantum computation. In this work, we show how to classically simulate these circuits when the gate in question belongs to certain families of solutions to the Yang-Baxter equation. These include all of the qubit (i.e., d = 2) solutions, and some simple families that include solutions for arbitrary d >= 2. Our main tool is a probabilistic classical algorithm for efficient simulation of a more general class of quantum circuits. This algorithm may be of use outside the present setting.