aiqbench analysis
This paper resolves the Permanent Anticoncentration Conjecture by establishing rigorous bounds on the density of permanents within Ginibre ensembles, directly advancing our theoretical understanding of computational hardness in quantum sampling problems. By comparing squared Gaussian permanents with determinants via Laplace transforms, these results provide critical mathematical foundations for verifying assumptions underlying Boson Sampling and other post-quantum cryptographic protocols.
Anticoncentration of the Permanent in Ginibre Ensembles
arXiv:2607.20329v1 Announce Type: cross Abstract: Let $\mathbb{K}\in\{\mathbb{R},\mathbb{C},\mathbb{H}\}$, put $\beta=\dim_{\mathbb{R}}\mathbb{K}$, and let $G_n^{\mathbb{K}}$ be an $n\times n$ matrix with i.i.d. standard $\mathbb{K}$-Gaussian entries, namely a standard $\mathbb{K}$-Ginibre matrix. We prove that the normalized row-ordered permanent $W_n^{\mathbb{K}}=\operatorname{per}_{\mathbb{K}}G_n^{\mathbb{K}}/\sqrt{n!}$ has a radial density $p_n^{\mathbb{K}}$ satisfying $\|p_n^{\mathbb{K}}\|_\infty=p_n^{\mathbb{K}}(0)\lesssim_\beta n^{(\beta+2)/4}$ and $\sup_{z\in\mathbb{K}}\mathbb{P}(|W_n^{\mathbb{K}}-z|\leq\varepsilon)\lesssim_\beta n^{(\beta+2)/4}\varepsilon^\beta$. In particular, for $\mathbb{K}=\mathbb{C}$, this resolves the Permanent Anticoncentration Conjecture of Aaronson and Arkhipov. The proof compares the squared Gaussian permanent with the squared (Study) determinant in Laplace-transform order.
Abstract:Let $\mathbb{K}\in\{\mathbb{R},\mathbb{C},\mathbb{H}\}$, put $\beta=\dim_{\mathbb{R}}\mathbb{K}$, and let $G_n^{\mathbb{K}}$ be an $n\times n$ matrix with i.i.d. standard $\mathbb{K}$-Gaussian entries, namely a standard $\mathbb{K}$-Ginibre matrix. We prove that the normalized row-ordered permanent $W_n^{\mathbb{K}}=\operatorname{per}_{\mathbb{K}}G_n^{\mathbb{K}}/\sqrt{n!}$ has a radial density $p_n^{\mathbb{K}}$ satisfying $\|p_n^{\mathbb{K}}\|_\infty=p_n^{\mathbb{K}}(0)\lesssim_\beta n^{(\beta+2)/4}$ and $\sup_{z\in\mathbb{K}}\mathbb{P}(|W_n^{\mathbb{K}}-z|\leq\varepsilon)\lesssim_\beta n^{(\beta+2)/4}\varepsilon^\beta$. In particular, for $\mathbb{K}=\mathbb{C}$, this resolves the Permanent Anticoncentration Conjecture of Aaronson and Arkhipov. The proof compares the squared Gaussian permanent with the squared (Study) determinant in Laplace-transform order.
Probability (math.PR); Computational Complexity (cs.CC); Mathematical Physics (math-ph); Quantum Physics (quant-ph)
arXiv:2607.20329 [math.PR]
(or arXiv:2607.20329v1 [math.PR] for this version)
https://doi.org/10.48550/arXiv.2607.20329 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 · 172 words
Related coverage
Ginibre Matrix Permanent Density Proves Anticoncentration Conjecture
Quantum Zeitgeist · Aug 5, 2026
Emergent universality in Kraus maps of quantum chaotic many-body dynamics
arXiv · Sep 14, 2026
Apparent Universal Behavior in Second Moments of Random Quantum Circuits
arXiv · Jul 28, 2026
Distinctness threshold for pseudorandom unitaries
arXiv · Sep 4, 2026