aiqbench analysis
This study establishes exact thresholds proving that simultaneous quantum typicality fails for three parties in mixed states and four in pure states, thereby disproving a conjecture from 2011. By demonstrating an exponential obstruction via polynomial concentration on $\mathbb{CP}^1$, the research defines the minimal system sizes where these statistical assumptions break down. These findings refine the theoretical boundaries for multiparty quantum state discrimination and smoothing protocols.
The Failure of Simultaneous Quantum Typicality
arXiv:2609.25726v1 Announce Type: new Abstract: We establish exact thresholds for the failure of simultaneous quantum typicality: three parties for mixed states and four for pure states. For the four-qubit Higuchi--Sudbery state, every sequence satisfying the expected purity bounds on three overlapping marginals, with sufficiently small fixed positive entropy slack, is asymptotically perfectly distinguishable from the tensor powers of the input: its trace distance from them tends to the maximum value $2$. This maximal separation persists, with a common positive slack, throughout an open neighborhood in the full four-qubit state space. Tracing out one party yields a mixed tripartite example. The proof connects simultaneous quantum smoothing with polynomial concentration on $\CP^1$. Symmetry reduces the problem to a frame inequality on $\Sym^n(\mathbb C^2)$, where a linear entropy deficit competes with a quadratic cost of polynomial concentration. Bernstein--Markov estimates and a subharmonic barrier control this cost, yielding an exponential obstruction to simultaneous typicality. These results disprove Dutil's multiparty quantum typicality conjecture, formulated in 2011, and the one-shot simultaneous min-entropy-smoothing conjectures of Drescher--Fawzi and Colomer--Winter. Together with the positive results for smaller systems, they determine the smallest numbers of parties at which simultaneous typicality can fail.
Abstract:We establish exact thresholds for the failure of simultaneous quantum typicality: three parties for mixed states and four for pure states. For the four-qubit Higuchi--Sudbery state, every sequence satisfying the expected purity bounds on three overlapping marginals, with sufficiently small fixed positive entropy slack, is asymptotically perfectly distinguishable from the tensor powers of the input: its trace distance from them tends to the maximum value $2$. This maximal separation persists, with a common positive slack, throughout an open neighborhood in the full four-qubit state space. Tracing out one party yields a mixed tripartite example. The proof connects simultaneous quantum smoothing with polynomial concentration on $\CP^1$. Symmetry reduces the problem to a frame inequality on $\Sym^n(\mathbb C^2)$, where a linear entropy deficit competes with a quadratic cost of polynomial concentration. Bernstein--Markov estimates and a subharmonic barrier control this cost, yielding an exponential obstruction to simultaneous typicality. These results disprove Dutil's multiparty quantum typicality conjecture, formulated in 2011, and the one-shot simultaneous min-entropy-smoothing conjectures of Drescher--Fawzi and Colomer--Winter. Together with the positive results for smaller systems, they determine the smallest numbers of parties at which simultaneous typicality can fail.
Quantum Physics (quant-ph); Mathematical Physics (math-ph); Functional Analysis (math.FA)
arXiv:2609.25726 [quant-ph]
(or arXiv:2609.25726v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2609.25726 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 · 287 words
Related coverage

Game Design Creativity evals
LessWrong · Oct 12, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026

Qubit error correction blocked by common measurement shortcut
Quantum Zeitgeist · Oct 1, 2026

IBM Quantum Integrates Bivariate Bicycle Formulations with Algebraic Outer Concatenation
Quantum Computing Report · Jun 6, 2026