The zz-permanent anti-concentration conjecture

From papers

Let T\mathbb{T} denote the unit circle, let XX be sampled from the complex Gaussian ensemble G=NC(0,1)n×n\mathcal{G}=\mathcal{N}_{\mathbb{C}}(0,1)^{n\times n}, and let Perz(X)\operatorname{Per}_z(X) denote the zz-permanent. zz-permanent anti-concentration conjecture. There exists a polynomial pp such that for every positive integer nn, every real number δ>0\delta>0, and every zTz\in\mathbb{T},

PrXG\originalleft[Perz(X)2n!p(n,1/δ)\aftergroup\originalright]1δ.\Pr_{X\sim\mathcal{G}}\mathopen{}\mathclose\bgroup\originalleft[ |\operatorname{Per}_z(X)|^2 \geq \frac{\sqrt{n!}}{p(n,1/\delta)}\aftergroup\egroup\originalright] \geq 1-\delta.

The source calls this the generalization of the original permanent anti-concentration conjecture. The supplied status evidence says that the case z=1z=-1 is proved, while the case z=1z=1 is described as a widely believed standard conjecture; consequently the general statement is refuted as a conjecture in its unrestricted form.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Shih-Han Hung and En-Jui Kuo, “The Computational Complexity of Quantum Determinants”, arXiv:2302.08083 (2023).

Solutions 0

No solutions have been posted yet.