ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let ϵ>0\epsilon>0, let S⊂U(d)\mathcal{S}\subset U(d) be a symmetric Haar random gate-set containing at least 33 elements, and let λ\lambda be an irreducible representation with dimension dλd_\lambda. Let δ(νS,λ)\delta(\nu_\mathcal{S},\lambda) be the corresponding representation-sector deviation, and let F∗(dλ,ϵ)F_{\ast}(d_\lambda,\epsilon) be the bound associated with the type ∗∈{O,U,R,C}\ast\in\{O,U,R,C\} of the gate-set. Large-representation tail bound conjecture. One has

P(δ(νS,λ)>2+ϵ∣S∣)≤F∗(dλ,ϵ).\mathbb{P}\left(\delta(\nu_\mathcal{S},\lambda)>\frac{2+\epsilon}{\sqrt{|\mathcal{S}|}}\right)\leq F_{\ast}(d_\lambda,\epsilon).

Moreover, for every fixed cardinality of S\mathcal{S} there is a representation index λ0\lambda_0 such that, whenever dλ>dλ0d_\lambda>d_{\lambda_0},

P(δ(νS,λ)>2+ϵ∣S∣)≤P(δ(λ)>2+ϵ).\mathbb{P}\left(\delta(\nu_\mathcal{S},\lambda)>\frac{2+\epsilon}{\sqrt{|\mathcal{S}|}}\right)\leq\mathbb{P}\left(\delta(\lambda)>2+\epsilon\right).

Here the correspondence between ∗\ast, λ\lambda, and the gate-set type is the one specified in the source's cited theorem. The conjecture is motivated by numerical evidence and concentration in large representation dimensions; the source does not provide a proof or resolution.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.