math.OC — Optimization and Control
Lower bounds for the quantum permanent
Griffiths's 1969 conjecture on the positivity of Schur forms reduces to the positivity of the quantum permanent on positive bistochastic maps. This conjecture was refuted by Du with a map for which . Therefore, we ask: how negative can be? We prove a lower bound (for ), and an asymptotically stronger bound . The key to our bounds is the orbital polynomial of the map, which turns into a linear function of a distribution on partitions and positivity into linear constraints. We also construct explicit maps for that improve on Du's example. Finally, if is the first dimension for which , the minimum of over positive bistochastic maps satisfies ; we conjecture the matching order .
A mix of human-written and AI-generated textHuman understanding: some partsGriffiths positivitybistochasticlower boundspositive mapsquantum permanentsemidefinite programming