Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper investigates the growth of operator entanglement in one-dimensional brickwork circuits utilizing Yang--Baxter gates, establishing rigorous bounds on Schmidt rank for specific gate classes. The study reveals that while certain structured gates limit entanglement to constant or logarithmic levels, others can exhibit exponential growth, highlighting fundamental constraints in quantum circuit dynamics. Notably, the research credits an AI model (ChatGPT 5.6 Sol) with constructing the proofs and examples, marking a significant step toward autonomous discovery in theoretical quantum physics.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

On the growth of operator entanglement in brickwork circuits with Yang--Baxter gates

arXiv2 min read

arXiv:2609.05121v1 Announce Type: cross Abstract: We study the operator entanglement of local operators in one-dimensional brickwork circuits whose two-site gate satisfies the braid relation; throughout this work, we call such a gate a Yang--Baxter gate. We establish upper bounds for several structured, overlapping classes of Yang--Baxter gates. We show that the operator Schmidt rank remains uniformly bounded in time for all qubit Yang--Baxter gates and, in arbitrary local dimension, for permutation gates obtained from non-degenerate Yang--Baxter maps. We also show that it grows at most polynomially for involutive dual-unitary Yang--Baxter gates and for arbitrary phase dressings of permutation gates obtained from non-degenerate Yang--Baxter maps. These results imply, respectively, constant and logarithmic upper bounds on the operator entanglement. Conversely, we construct a seven-state involutive Yang--Baxter gate without dual unitarity and a one-site operator whose exact operator Schmidt rank grows exponentially, although the corresponding operator entropies remain undetermined. Entanglement growth in the general Yang--Baxter case remains open. All proofs and selected examples were constructed by ChatGPT 5.6 Sol.

Abstract:We study the operator entanglement of local operators in one-dimensional brickwork circuits whose two-site gate satisfies the braid relation; throughout this work, we call such a gate a Yang--Baxter gate. We establish upper bounds for several structured, overlapping classes of Yang--Baxter gates. We show that the operator Schmidt rank remains uniformly bounded in time for all qubit Yang--Baxter gates and, in arbitrary local dimension, for permutation gates obtained from non-degenerate Yang--Baxter maps. We also show that it grows at most polynomially for involutive dual-unitary Yang--Baxter gates and for arbitrary phase dressings of permutation gates obtained from non-degenerate Yang--Baxter maps. These results imply, respectively, constant and logarithmic upper bounds on the operator entanglement. Conversely, we construct a seven-state involutive Yang--Baxter gate without dual unitarity and a one-site operator whose exact operator Schmidt rank grows exponentially, although the corresponding operator entropies remain undetermined. Entanglement growth in the general Yang--Baxter case remains open. All proofs and selected examples were constructed by ChatGPT 5.6 Sol.

Statistical Mechanics (cond-mat.stat-mech); Exactly Solvable and Integrable Systems (nlin.SI); Quantum Physics (quant-ph)

arXiv:2609.05121 [cond-mat.stat-mech]

(or arXiv:2609.05121v1 [cond-mat.stat-mech] for this version)

https://doi.org/10.48550/arXiv.2609.05121 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 264 words

Related coverage