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:2407.10731

Unitary tetrahedron quantum gates

Vivek Kumar Singh, Akash Sinha, Pramod Padmanabhan, V. E. Korepin

Published Jul 15, 2024• 2 citations
arXivHTMLPDF

Abstract

Quantum simulations of many-body systems using 2-qubit Yang-Baxter gates offer a benchmark for quantum hardware. This can be extended to the higher dimensional case with $n$-qubit generalisations of Yang-Baxter gates called $n$-simplex operators. Such multi-qubit gates potentially lead to shallower and more efficient quantum circuits as well. Finding them amounts to identifying unitary solutions of the $n$-simplex equations, the building blocks of higher dimensional integrable systems. These are a set of highly non-linear and over determined system of equations making it notoriously hard to solve even when the local Hilbert spaces are spanned by qubits. We systematically overcome this for higher simplex operators constructed using two methods: from Clifford algebras and by lifting Yang-Baxter operators. The $n=3$ or the tetrahedron case is analyzed in detail. For the qubit case our methods produce 13 inequivalent families of unitary tetrahedron operators. 12 of these families are obtained by appending the 5 unitary families of 4 by 4 constant Yang-Baxter operators of Dye-Hietarinta, with a single qubit operator. As applications, universal sets of single, two and three qubit gates are realized using such unitary tetrahedron operators. The ideas presented in this work can be naturally extended to the higher simplex cases.

DOI
10.48550/arxiv.2407.10731

Related papers

Toffoli gates solve the tetrahedron equations

Akash Sinha, Pramod Padmanabhan, V. E. Korepin

The circuit model of quantum computation can be interpreted as a scattering process. In particular, factorised scattering operators result in integrable quantum circuits that provide universal quantum computation and are potentially less noisy. These are realized through Yang-Baxter or 2-simplex operators. A natural question is to extend this construction to higher qubit gates, like the Toffoli gates, which also lead to universal quantum computation but with shallower circuits. We show that unitary families of such operators are constructed by the 3-dimensional generalizations of the Yang-Baxter operators known as tetrahedron or 3-simplex operators. The latter satisfy a spectral parameter-dependent tetrahedron equation. This construction goes through for $n$-Toffoli gates realized using $n$-simplex operators.

arXiv:2405.16477•May 26, 2024•1 citation

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

Two qutrits universal quantum gates from the nine-dimensional unitary solutions of the Yang-Baxter equation

Mario E. Vélez, Juan Ospina

Using the Kauffman-Lomonaco method, some two-qutrits universal quantum gates are derived from the nine-dimensional unitary solutions of the Yang-Baxter equations associated with algebraic structures like the partial transpose operator and the dihedral group, which admit three dimensional representations. The Yang-Baxterization method given by Zhang-Kauffman-Ge is continuously used to obtain two-qutrits quantum gates and certain Hamiltonians for the evolution of the quantum gates are obtained, being such Hamiltonians interpreted as physical Hamiltonians of chain of particles of spin 1. Finally, the generalization for systems of two qudits is presented in the case of Yang-Baxterization of representations of braided monoidal algebra like the BH algebra and the bicolored Birman-Wenzl-Muraki algebra. For these algebras the corresponding two-qudits quantum gates are constructed jointly with the associated Hamiltonians interpreted like physical chains of particles with spin d. It is conjectured that the derived two-qdits quantum gates and the Hamiltonians may be implemented over bi-dimensional lattice systems like anyons systems or more generally over any physical systems ruled by the Yang-Baxter equations.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Apr 27, 2007•0 citations

Geometric representations of braid and Yang–Baxter gates

Kun Zhang, Kun Hao, Kwangmin Yu +2 more

Abstract Brick-wall circuits composed of the Yang–Baxter gates are integrable. It becomes an important tool to study the quantum many-body system out of equilibrium. To put the Yang–Baxter gate on quantum computers, it has to be decomposed into the native gates of quantum computers. It is favorable to apply the least number of native two-qubit gates to construct the Yang–Baxter gate. We study the geometric representations of all X-type braid gates and their corresponding Yang–Baxter gates via the Yang–Baxterization. We find that the braid and Yang–Baxter gates can only exist on certain edges and faces of the two-qubit tetrahedron. We identify the parameters by which the braid and Yang–Baxter gates are the Clifford gate, the matchgate, and the dual-unitary gate. The geometric representations provide the optimal decompositions of the braid and Yang–Baxter gates in terms of other two-qubit gates. We also find that the entangling powers of the Yang–Baxter gates are determined by the spectral parameters. Our results provide the necessary conditions to construct the braid and Yang–Baxter gates on quantum computers.

arXiv:2406.08320•Journal of Physics A Mathematical and Theoretical•Oct 10, 2024•3 citations

Universal Braiding Quantum Gates

David Lovitz

The Yang-Baxter equation and it's various forms have applications in many fields, including statistical mechanics, knot theory, and quantum information. Unitary solutions of the braided Yang-Baxter equation are of particular interest as quantum gates for topological quantum computers. We demonstrate a simple construction for solutions in any dimension, which are both unitary and universal for quantum computation. We also fully classify a family of solutions to certain generalized Yang-Baxter equations and prove that certain instances of the equation only have solutions that are scalar multiples of the identity.

arXiv:2304.00710•Apr 3, 2023•0 citations

Monomial Solutions to Generalized Yang-Baxter Equations in Low Dimensions

Andrew Nemec

Unitary solutions to the Yang-Baxter equation are important to quantum information science because they lead to unitary representations of the braid group, which can be used to design quantum logic gates that make up topological quantum circuits. By finding new unitary solutions to the Generalized Yang-Baxter equation in low dimensions and classifying them, we will be able to find new representations of the braid group which may lead to new designs for quantum logic gates used in quantum computers. Because it is extremely difficult to find solutions to the Generalized Yang-Baxter equation, we will narrow our search to set-theoretical solutions, that is, solutions that are also permutation matrices.

•Sep 17, 2014•0 citations
Quantum simulations of many-body systems using 2-qubit Yang-Baxter gates offer a benchmark for quantum hardware. This can be extended to the higher dimensional case with nnn-qubit generalisations of Yang-Baxter gates called nnn-simplex operators. Such multi-qubit gates potentially lead to shallower and more efficient quantum circuits as well. Finding them amounts to identifying unitary solutions of the nnn-simplex equations, the building blocks of higher dimensional integrable systems. These are a set of highly non-linear and over determined system of equations making it notoriously hard to solve even when the local Hilbert spaces are spanned by qubits. We systematically overcome this for higher simplex operators constructed using two methods: from Clifford algebras and by lifting Yang-Baxter operators. The n=3n=3n=3 or the tetrahedron case is analyzed in detail. For the qubit case our methods produce 13 inequivalent families of unitary tetrahedron operators. 12 of these families are obtained by appending the 5 unitary families of 4 by 4 constant Yang-Baxter operators of Dye-Hietarinta, with a single qubit operator. As applications, universal sets of single, two and three qubit gates are realized using such unitary tetrahedron operators. The ideas presented in this work can be naturally extended to the higher simplex cases.
The circuit model of quantum computation can be interpreted as a scattering process. In particular, factorised scattering operators result in integrable quantum circuits that provide universal quantum computation and are potentially less noisy. These are realized through Yang-Baxter or 2-simplex operators. A natural question is to extend this construction to higher qubit gates, like the Toffoli gates, which also lead to universal quantum computation but with shallower circuits. We show that unitary families of such operators are constructed by the 3-dimensional generalizations of the Yang-Baxter operators known as tetrahedron or 3-simplex operators. The latter satisfy a spectral parameter-dependent tetrahedron equation. This construction goes through for nnn-Toffoli gates realized using nnn-simplex operators.
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.
Using the Kauffman-Lomonaco method, some two-qutrits universal quantum gates are derived from the nine-dimensional unitary solutions of the Yang-Baxter equations associated with algebraic structures like the partial transpose operator and the dihedral group, which admit three dimensional representations. The Yang-Baxterization method given by Zhang-Kauffman-Ge is continuously used to obtain two-qutrits quantum gates and certain Hamiltonians for the evolution of the quantum gates are obtained, being such Hamiltonians interpreted as physical Hamiltonians of chain of particles of spin 1. Finally, the generalization for systems of two qudits is presented in the case of Yang-Baxterization of representations of braided monoidal algebra like the BH algebra and the bicolored Birman-Wenzl-Muraki algebra. For these algebras the corresponding two-qudits quantum gates are constructed jointly with the associated Hamiltonians interpreted like physical chains of particles with spin d. It is conjectured that the derived two-qdits quantum gates and the Hamiltonians may be implemented over bi-dimensional lattice systems like anyons systems or more generally over any physical systems ruled by the Yang-Baxter equations.
Abstract Brick-wall circuits composed of the Yang–Baxter gates are integrable. It becomes an important tool to study the quantum many-body system out of equilibrium. To put the Yang–Baxter gate on quantum computers, it has to be decomposed into the native gates of quantum computers. It is favorable to apply the least number of native two-qubit gates to construct the Yang–Baxter gate. We study the geometric representations of all X-type braid gates and their corresponding Yang–Baxter gates via the Yang–Baxterization. We find that the braid and Yang–Baxter gates can only exist on certain edges and faces of the two-qubit tetrahedron. We identify the parameters by which the braid and Yang–Baxter gates are the Clifford gate, the matchgate, and the dual-unitary gate. The geometric representations provide the optimal decompositions of the braid and Yang–Baxter gates in terms of other two-qubit gates. We also find that the entangling powers of the Yang–Baxter gates are determined by the spectral parameters. Our results provide the necessary conditions to construct the braid and Yang–Baxter gates on quantum computers.
The Yang-Baxter equation and it's various forms have applications in many fields, including statistical mechanics, knot theory, and quantum information. Unitary solutions of the braided Yang-Baxter equation are of particular interest as quantum gates for topological quantum computers. We demonstrate a simple construction for solutions in any dimension, which are both unitary and universal for quantum computation. We also fully classify a family of solutions to certain generalized Yang-Baxter equations and prove that certain instances of the equation only have solutions that are scalar multiples of the identity.
Unitary solutions to the Yang-Baxter equation are important to quantum information science because they lead to unitary representations of the braid group, which can be used to design quantum logic gates that make up topological quantum circuits. By finding new unitary solutions to the Generalized Yang-Baxter equation in low dimensions and classifying them, we will be able to find new representations of the braid group which may lead to new designs for quantum logic gates used in quantum computers. Because it is extremely difficult to find solutions to the Generalized Yang-Baxter equation, we will narrow our search to set-theoretical solutions, that is, solutions that are also permutation matrices.