Matching works

1 work

math.OC — Optimization and Control

Lower bounds for the quantum permanent

Contributed by Suvrit Sra

Griffiths's 1969 conjecture on the positivity of Schur forms reduces to the positivity of the quantum permanent Φn\Phi_n on positive bistochastic maps. This conjecture was refuted by Du with a map for which Φ9<0\Phi_9<0. Therefore, we ask: how negative can Φn\Phi_n be? We prove a lower bound Φn≥−3n/(3n2+20n+103)\Phi_n\ge-3n/(3n^2+20n+103) (for n≥8n\ge 8), and an asymptotically stronger bound Φn≥−1/n+(3e2−7−o(1))log⁡n/n2\Phi_n\ge-1/n+(3e^2-7-o(1))\log n/n^2. The key to our bounds is the orbital polynomial of the map, which turns Φn\Phi_n into a linear function of a distribution on partitions and positivity into linear constraints. We also construct explicit maps for n=8,9n=8, 9 that improve on Du's example. Finally, if d∗∈{4,…,8}d_*\in\{4,\ldots,8\} is the first dimension for which Φn<0\Phi_n<0, the minimum μn\mu_n of Φn\Phi_n over positive bistochastic maps satisfies −μn=Ω(n−d∗)-\mu_n=\Omega(n^{-d_*}); we conjecture the matching order −μn=O(n−d∗)-\mu_n=O(n^{-d_*}).

A mix of human-written and AI-generated textHuman understanding: some partsGriffiths positivitybistochasticlower boundspositive mapsquantum permanentsemidefinite programming

Advanced search

Text
Human understanding
Linked formalizations