A paradox in bosonic energy computations via semidefinite programming relaxations

Abstract

We show that the recent hierarchy of semidefinite programming relaxations based on non-commutative polynomial optimization and reduced density matrix variational methods exhibits an interesting paradox when applied to the bosonic case: even though it can be rigorously proven that the hierarchy collapses after the first step, numerical implementations of higher order steps generate a sequence of improving lower bounds that converges to the optimal solution. We analyze this effect and compare it with similar behavior observed in implementations of semidefinite programming relaxations for commutative polynomial minimization. We conclude that the method converges due to the rounding errors occurring during the execution of the numerical program, and show that convergence is lost as soon as computer precision is incremented. We support this conclusion by proving that for any element p of a Weyl algebra which is non-negative in the Schrodinger representation there exists another element p' arbitrarily close to p that admits a sum of squares decomposition.

22 pages, 4 figures

References in corpus (5)

• A convergent hierarchy of semidefinite programs characterizing the set of quantum correlations
• Bounding the set of quantum correlations
• Convergent relaxations of polynomial optimization problems with non-commuting variables
• Solving condensed-matter ground-state problems by semidefinite relaxations
• Lower Bounds for Ground States of Condensed Matter Systems

Cited by in corpus (5)

• Algorithm 950: Ncpol2sdpa---Sparse Semidefinite Programming Relaxations for Polynomial Optimization Problems of Noncommuting Variables
• Semidefinite programming relaxations for quantum correlations
• Perturbation Analysis of Singular Semidefinite Programs and Its Applications to Control Problems
• Fast semidefinite programming with feedforward neural networks
• Application of Facial Reduction to $H_{\infty }$ State Feedback Control Problem