Algebraic classification of Hietarinta's solutions of Yang-Baxter equations~:~invertible $4\times 4$ operators

• URL: http://arxiv.org/abs/2409.05375v2
• Date: Thu, 02 Jan 2025 06:24:59 GMT
• Title: Algebraic classification of Hietarinta's solutions of Yang-Baxter equations~:~invertible $4\times 4$ operators
• Authors: Somnath Maity, Vivek Kumar Singh, Pramod Padmanabhan, Vladimir Korepin,
• Abstract summary: Hietarinta was among the first to classify constant Yang-Baxter solutions for a two-dimensional local Hilbert space. We employ four distinct algebraic structures that, depending on the qubit representation, replicate 10 of the 11 Hietarinta families.
• Score: 1.429979512794144
• License:
• Abstract: In order to examine the simulation of integrable quantum systems using quantum computers, it is crucial to first classify Yang-Baxter operators. Hietarinta was among the first to classify constant Yang-Baxter solutions for a two-dimensional local Hilbert space (qubit representation). Including the one produced by the permutation operator, he was able to construct eleven families of invertible solutions. These techniques are effective for 4 by 4 solutions, but they become difficult to use for representations with more dimensions. To get over this limitation, we use algebraic ans\"{a}tze to generate the constant Yang-Baxter solutions in a representation independent way. We employ four distinct algebraic structures that, depending on the qubit representation, replicate 10 of the 11 Hietarinta families. Among the techniques are partition algebras, Clifford algebras, Temperley-Lieb algebras, and a collection of commuting operators. Using these techniques, we do not obtain the $(2,2)$ Hietarinta class.

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)
• Solving the Yang-Baxter, tetrahedron and higher simplex equations using Clifford algebras [0.0]
  Yang-Baxter equation, Zamalodchikov's tetrahedron equation and Bazhanov-Stroganov equation are special cases. We describe a universal method to solve these equations using Clifford algebras.
  arXiv  Detail & Related papers  (2024-04-17T15:56:16Z)
• 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)
• The quantum commuting model (Ia): The CHSH game and other examples: Uniqueness of optimal states [91.3755431537592]
  We use the universal description of quantum commuting correlations as state space on the universal algebra for two player games. We find that the CHSH game leaves a single optimal state on this common algebra.
  arXiv  Detail & Related papers  (2022-10-07T17:38:31Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• 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)
• A Graphical Calculus for Quantum Computing with Multiple Qudits using Generalized Clifford Algebras [0.0]
  We show that it is feasible to envision implementing the braid operators for quantum computation, by showing that they are 2-local operators. We derive several new identities for the braid elements, which are key to our proofs. In terms of quantum computation, we show that it is feasible to envision implementing the braid operators for quantum computation.
  arXiv  Detail & Related papers  (2021-03-30T05:19:49Z)
• 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)
• A refinement of Reznick's Positivstellensatz with applications to quantum information theory [72.8349503901712]
  In Hilbert's 17th problem Artin showed that any positive definite in several variables can be written as the quotient of two sums of squares. Reznick showed that the denominator in Artin's result can always be chosen as an $N$-th power of the squared norm of the variables.
  arXiv  Detail & Related papers  (2019-09-04T11:46:26Z)

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.