Hietarinta's classification of $4\times 4$ constant Yang-Baxter operators using algebraic approach
- URL: http://arxiv.org/abs/2409.05375v1
- Date: Mon, 9 Sep 2024 07:16:16 GMT
- Title: Hietarinta's classification of $4\times 4$ constant Yang-Baxter operators using algebraic approach
- Authors: Somnath Maity, Vivek Kumar Singh, Pramod Padmanabhan, Vladimir Korepin,
- Abstract summary: Classifying Yang-Baxter operators is an essential first step in the study of integrable quantum systems on quantum computers.
We use four different algebraic structures that reproduce 10 of the 11 Hietarinta families when the qubit representation is chosen.
- Score: 1.429979512794144
- License: http://creativecommons.org/licenses/by-nc-nd/4.0/
- Abstract: Classifying Yang-Baxter operators is an essential first step in the study of the simulation of integrable quantum systems on quantum computers. One of the earliest initiatives was taken by Hietarinta in classifying constant Yang-Baxter solutions for a two-dimensional local Hilbert space (qubit representation). He obtained 11 families of invertible solutions, including the one generated by the permutation operator. While these methods work well for 4 by 4 solutions, they become cumbersome for higher dimensional representations. In this work, we overcome this restriction by constructing the constant Yang-Baxter solutions in a representation independent manner by using ans\"{a}tze from algebraic structures. We use four different algebraic structures that reproduce 10 of the 11 Hietarinta families when the qubit representation is chosen. The methods include a set of commuting operators, Clifford algebras, Temperley-Lieb algebras, and partition algebras. We do not obtain the $(2,2)$ Hietarinta class with these methods.
Related papers
- Unitary tetrahedron quantum gates [3.117417023918577]
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.
Finding them amounts to identifying unitary solutions of the $n$-simplex equations, the building blocks of higher dimensional integrable systems.
arXiv Detail & Related papers (2024-07-15T13:58:33Z) - A Pedestrian's Way to Baxter's Bethe Ansatz for the Periodic XYZ Chain [2.1797546092115803]
We construct a set of chiral vectors with fixed number of kinks.
Under roots of unity conditions, the Hilbert space has an invariant subspace.
We propose a Bethe ansatz based on the action of the Hamiltonian on the chiral vectors.
arXiv Detail & Related papers (2023-11-30T19:48:23Z) - Enriching Diagrams with Algebraic Operations [49.1574468325115]
We extend diagrammatic reasoning in monoidal categories with algebraic operations and equations.
We show how this construction can be used for diagrammatic reasoning of noise in quantum systems.
arXiv Detail & Related papers (2023-10-17T14:12:39Z) - The tilted CHSH games: an operator algebraic classification [77.34726150561087]
This article introduces a general systematic procedure for solving any binary-input binary-output game.
We then illustrate on the prominent class of tilted CHSH games.
We derive for those an entire characterisation on the region exhibiting some quantum advantage.
arXiv Detail & Related papers (2023-02-16T18:33:59Z) - Discovering Sparse Representations of Lie Groups with Machine Learning [55.41644538483948]
We show that our method reproduces the canonical representations of the generators of the Lorentz group.
This approach is completely general and can be used to find the infinitesimal generators for any Lie group.
arXiv Detail & Related papers (2023-02-10T17:12:05Z) - Deep Learning Symmetries and Their Lie Groups, Algebras, and Subalgebras
from First Principles [55.41644538483948]
We design a deep-learning algorithm for the discovery and identification of the continuous group of symmetries present in a labeled dataset.
We use fully connected neural networks to model the transformations symmetry and the corresponding generators.
Our study also opens the door for using a machine learning approach in the mathematical study of Lie groups and their properties.
arXiv Detail & Related papers (2023-01-13T16:25:25Z) - Algebraic Bethe Circuits [58.720142291102135]
We bring the Algebraic Bethe Ansatz (ABA) into unitary form, for its direct implementation on a quantum computer.
Our algorithm is deterministic and works for both real and complex roots of the Bethe equations.
We derive a new form of the Yang-Baxter equation using unitary matrices, and also verify it on a quantum computer.
arXiv Detail & Related papers (2022-02-09T19:00:21Z) - Hilbert Spaces of Entire Functions and Toeplitz Quantization of
Euclidean Planes [0.0]
We extend the theory of Toeplitz quantization to include diverse and interesting non-commutative realizations of the classical Euclidean plane.
The Toeplitz operators are geometrically constructed as special elements from this algebra.
Various illustrative examples are computed.
arXiv Detail & Related papers (2021-05-18T09:52:48Z) - Abelian Neural Networks [48.52497085313911]
We first construct a neural network architecture for Abelian group operations and derive a universal approximation property.
We extend it to Abelian semigroup operations using the characterization of associative symmetrics.
We train our models over fixed word embeddings and demonstrate improved performance over the original word2vec.
arXiv Detail & Related papers (2021-02-24T11:52:21Z) - Polynomial algebras from $su(3)$ and the generic model on the two sphere [0.0]
Construction of superintegrable systems based on Lie algebras have been introduced over the years.
This is also the case for the construction of their related symmetry algebra which take usually the form of a finitely generated quadratic algebra.
We develop a new approach reexamining the case of the generic superintegrable systems on the 2-sphere.
arXiv Detail & Related papers (2020-07-22T02:20:10Z) - Braiding quantum gates from partition algebras [0.0]
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.
Explicit examples are given for a 2-, 3-, and 4-qubit system.
arXiv Detail & Related papers (2020-02-29T11:53:08Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.