SearcharxivSearch

arXiv · 2303.02964

The Yang-Baxter equation, Quantum computing and Quantum entanglement

Abstract

We present a method to construct infinite families of entangling $2$-qudit gates, and amongst them entangling $2$-qudit gates which satisfy the Yang-Baxter equation. We show that, given $2$-qudit gates $c$ and $d$, if $c$ or $d$ is entangling, then their Tracy-Singh product $c \boxtimes d$ is also entangling and we can provide non-entangled states which become entangled after the application of $c \boxtimes d$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fabienne Chouraqui. 2023-03-06. The Yang-Baxter equation, Quantum computing and Quantum entanglement. https://doi.org/10.1088/1402-4896%2Fad7e57

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR