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.
AI Summary
Simultaneous quantum typicality asks whether one state close to $\rho^{\otimes n}$ can simultaneously give every marginal collision- or min-entropy rate approaching its von Neumann entropy. The paper disproves this conjecture and related one-shot simultaneous min-entropy-smoothing conjectures. Combined with existing positive cases, it establishes the minimum party counts for failure: three for mixed inputs and four for pure inputs, already with qubit parties.
The pure counterexample is the four-qubit Higuchi–Sudbery state $\Omega$. Its $AB$, $AC$, and $BC$ marginals have spectrum $(1/2,1/6,1/6,1/6)$ and entropy $h=\log 2+\tfrac12\log 3$. For fixed $0<\delta\leq\delta_0\approx5.494\times10^{-5}$, any state $\sigma_n$ whose three pair purities are at most $e^{-n(h-\delta)}$ satisfies $\langle\Omega^{\otimes n},\sigma_n\Omega^{\otimes n}\rangle\leq3\sqrt{n+1}e^{-rn}$, with $r\approx2.607\times10^{-5}$, for sufficiently large $n$. Consequently, its unnormalized trace distance from the input tends to $2$. Tracing out one qubit gives the mixed tripartite example. Maximal separation also holds throughout an open neighborhood in the full four-qubit state space, with common positive slack.
The proof compresses arbitrary candidates to $\operatorname{Sym}^n(\mathbb C^2)$. Marginal purity bounds suppress three frequency caps with an exponent linear in their tolerance, while polynomial concentration on $\mathbb{CP}^1$, Bernstein–Markov estimates, a triangular subharmonic barrier, and binomial leakage give a quadratic-exponent frame lower bound.
The constants are not optimized. The Schatten-$p$ consequences cover $p\geq2$, not $1<p<2$. The obstruction invalidates simultaneous smoothing as a general proof route, not operational rate regions established independently.
Little sign of AI-generated text
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
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 \CP1. Symmetry reduces the problem to a frame inequality on \Symn(C2), 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.
Simultaneous quantum typicality asks whether one state close to ρ⊗n can simultaneously give every marginal collision- or min-entropy rate approaching its von Neumann entropy. The paper disproves this conjecture and related one-shot simultaneous min-entropy-smoothing conjectures. Combined with existing positive cases, it establishes the minimum party counts for failure: three for mixed inputs and four for pure inputs, already with qubit parties.
The pure counterexample is the four-qubit Higuchi–Sudbery state Ω. Its AB, AC, and BC marginals have spectrum (1/2,1/6,1/6,1/6) and entropy h=log2+21log3. For fixed 0<δ≤δ0≈5.494×10−5, any state σn whose three pair purities are at most e−n(h−δ) satisfies ⟨Ω⊗n,σnΩ⊗n⟩≤3n+1e−rn, with r≈2.607×10−5, for sufficiently large n. Consequently, its unnormalized trace distance from the input tends to 2. Tracing out one qubit gives the mixed tripartite example. Maximal separation also holds throughout an open neighborhood in the full four-qubit state space, with common positive slack.
The proof compresses arbitrary candidates to Symn(C2). Marginal purity bounds suppress three frequency caps with an exponent linear in their tolerance, while polynomial concentration on CP1, Bernstein–Markov estimates, a triangular subharmonic barrier, and binomial leakage give a quadratic-exponent frame lower bound.
The constants are not optimized. The Schatten-p consequences cover p≥2, not 1<p<2. The obstruction invalidates simultaneous smoothing as a general proof route, not operational rate regions established independently.
In the context of network information theory, one often needs a multiparty probability distribution to be typical in several ways simultaneously. When considering quantum states instead of classical ones, it is in general difficult to prove the existence of a state that is jointly typical. Such a difficulty was recently emphasized and conjectures on the existence of such states were formulated. In this paper, we consider a one-shot multiparty typicality conjecture. The question can then be stated easily: is it possible to smooth the largest eigenvalues of all the marginals of a multipartite state ρ simultaneously while staying close to ρ? We prove the answer is yes whenever the marginals of the state commute. In the general quantum case, we prove that simultaneous smoothing is possible if the number of parties is two or more generally if the marginals to optimize satisfy some non-overlap property.
We establish two results on the asymptotic equipartition property (AEP) for quantum channels. First, the AEP formulated using smoothing over completely positive trace-preserving maps fails in general. Second, the AEP with smoothing over subchannels (completely positive trace-nonincreasing maps) is equivalent to the strong converse for parallel quantum channel Stein's lemma, to a sharp threshold for the channel hockey-stick divergence, and to an AEP for the channel Lorenz divergence. The counterexample reveals a surprising separation between channel and subchannel smoothing. Although states and classical channels admit a sharp, dimension-independent completion bound, which we establish, the corresponding single-shot gap for quantum channels is unbounded already for qubits. This separation persists asymptotically: we construct qutrit channel pairs with finite max-relative entropy whose CPTP-smoothed rate strictly exceeds the regularized channel relative entropy. The asymptotic gap between channel and subchannel smoothing is unbounded across the family, even when the subchannel approximation error decays exponentially. To establish the equivalences, we develop a uniform filter that converts Lorenz smoothing into a single nearby subchannel. The four conjectured formulations thus share a common asymptotic threshold, whose validity for general channel pairs remains open. Together, these results separate this threshold question from the obstruction imposed by exact trace preservation.
Pure states of four and seven qubits cannot be maximally entangled across every balanced bipartition; we determine how entangled they can be on average. For four qubits we prove the conjecture of Higuchi and Sudbery: the mean von Neumann entropy of the three 2∣2 cuts is at most 1+21log23 bits, with equality exactly on the local-unitary orbits of their state M4 and its complex conjugate. For seven qubits the mean purity of the 35 balanced 3∣4 cuts is at least 121/917 and their mean entropy is at most 2.965356029… bits, each with a unique optimiser up to local unitaries and qubit permutations. The two optimisers are distinct members of one icosahedral family, so minimum purity and maximum entropy select different states. The proofs bound moments of the marginal spectra by positive identities on several copies of the state, some of them spin flipped, and bound the entropy by a polynomial in those moments. The four-qubit maximum has an analytic proof; the seven-qubit proofs, and some of the four-qubit refinements below, are computer-assisted, with exact arithmetic and rigorous error bounds. We also prove the Gour--Wallach conjecture for Rényi entropies of all orders, with the maximiser changing from M4 to cluster states at q∗≈1.588, and obtain sharp Tsallis bounds, mixed-state bounds and quantitative stability.
Absolutely maximally entangled states require every reduction of at most half of the parties to be maximally mixed, a condition that is both rigid and often impossible for qubit systems. Previous work introduced the quantum extremal number, which maximizes the number of exactly maximally mixed half-body marginals, and determined the exact value Qex(8,4)=56. The present work develops a robust extension of this extremal problem. For a subsystem A, the marginal maximal-mixing defect is defined by DA=2∣A∣Tr(ρA2)−1=2∣A∣ρA−2∣A∣IA22, and Qex,εD(n,k) is defined as the maximum number of k-body marginals satisfying DA≤ε in an n-qubit pure state. This counting problem differs from approximate k-uniformity, which requires all k-body marginals to obey a common error bound.
For pure states on 4m qubits, the following local stability inequality is established: ∑i∈TDT∖{i}≥1(∣T∣=2m+1). It follows that, whenever ε<1/(2m+1), the hypergraph of ε-good 2m-subsets is K2m+1(2m)-free. Combined with the known exact eight-qubit construction, this yields the stability plateau Qex,εD(8,4)=56,0≤ε<51. For odd systems of 2k+1 qubits, the exact forbidden hypergraph Hk is used to derive explicit finite-error stability radii. In particular, Qex,εD(9,4)≤120 for 0≤ε<1/17. These results turn exact quantum Turán obstructions into quantitative robustness statements and identify intervals on which quantum extremal numbers are stable under imperfect marginal mixedness.
Properties of random mixed states of dimension N distributed uniformly with respect to the Hilbert-Schmidt measure are investigated. We show that for large N, due to the concentration of measure, the trace distance between two random states tends to a fixed number $\stackrel{\ifmmode \tilde{}\else \~{}\fi{}}{D}=1/4+1/\ensuremath{\pi}$, which yields the Helstrom bound on their distinguishability. To arrive at this result, we apply free random calculus and derive the symmetrized Marchenko-Pastur distribution, which is shown to describe numerical data for the model of coupled quantum kicked tops. Asymptotic value for the root fidelity between two random states, F=43, can serve as a universal reference value for further theoretical and experimental studies. Analogous results for quantum relative entropy and Chernoff quantity provide other bounds on the distinguishablity of both states in a multiple measurement setup due to the quantum Sanov theorem. We study also mean entropy of coherence of random pure and mixed states and entanglement of a generic mixed state of a bipartite system.
Abstract We show that a simple telescoping sum trick, together with the triangle inequality and a tensorisation property of expected-contractive coefficients of random channels, allow us to achieve general simultaneous decoupling for multiple users via local actions. Employing both old (Dupuis et al. in Commun Math Phys 328:251–284, 2014) and new methods (Dupuis in IEEE Trans Inf Theory 69:7784–7792, 2023), we obtain bounds on the expected deviation from ideal decoupling either in the one-shot setting in terms of smooth min-entropies, or the finite block length setting in terms of Rényi entropies. These bounds are essentially optimal without the need to address the simultaneous smoothing conjecture, which remains unresolved. This leads to one-shot, finite block length, and asymptotic achievability results for several tasks in quantum Shannon theory, including local randomness extraction of multiple parties, multi-party assisted entanglement concentration, multi-party quantum state merging, and quantum coding for the quantum multiple access channel. Because of the one-shot nature of our protocols, we obtain achievability results without the need for time-sharing, which at the same time leads to easy proofs of the asymptotic coding theorems. We show that our one-shot decoupling bounds furthermore yield achievable rates (so far only conjectured) for all four tasks in compound settings, which are additionally optimal for entanglement of assistance and state merging.