aiqbench analysis
This paper advances the Brown-Susskind conjecture by demonstrating that the dimension of achievable $n$-qubit unitaries strictly increases when additional two-qubit gate pairs are introduced, refining our understanding of quantum circuit expressibility and connectivity limits. The findings provide theoretical bounds on how efficiently complex quantum operations can be constructed from local gates, a critical consideration for scaling fault-tolerant quantum computers.
A remark on the Brown-Susskind conjecture
arXiv:2609.23221v1 Announce Type: new Abstract: In the spirit of the Brown-Susskind conjecture, proven in \cite{haf} and \cite{li}, we study the growth of the dimension of the set of $n$-qubit unitaries which can be obtained as a product of a fixed number of $2$-qubit gates from a fixed set of pairs of qubits. We show that this dimension increases strictly when one more pair is added, for at least some choice of the $2$-qubit pairs at each step.
Abstract:In the spirit of the Brown-Susskind conjecture, proven in \cite{haf} and \cite{li}, we study the growth of the dimension of the set of $n$-qubit unitaries which can be obtained as a product of a fixed number of $2$-qubit gates from a fixed set of pairs of qubits. We show that this dimension increases strictly when one more pair is added, for at least some choice of the $2$-qubit pairs at each step.
arXiv:2609.23221 [quant-ph]
(or arXiv:2609.23221v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.23221 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 · 163 words
Related coverage

Stuart Fails to Save the Universe Bets on a Conjecture Physicists Cannot Yet Disprove
techtimes.com · Jul 20, 2026

OpenAI Astra Solves Ten Decade - Old Math Problems With Machine - Checkable Lean Proofs
techtimes.com · Aug 2, 2026

Review of Fundamental Uncertainty.
LessWrong · Aug 1, 2026
The twisted convolution identity and ghost $r$-SICs from finite quantum dilogarithms
arXiv · Oct 1, 2026