A paradox in bosonic energy calculations via semidefinite programming relaxations

Details A paradox in bosonic energy calculations via semidefinite programming relaxations A paradox in bosonic energy calculations via semidefinite programming relaxations

2012-03-16

arxiv.org/abs/1203.3777v1

Physics

Quantum Physics

Scientific paper

We show that the recent hierarchy of semidefinite programming approximations based on non-commutative polynomial optimization and reduced density matrix variational methods exhibits an interesting paradox when extended to the bosonic case: even though it can be proven that the hierarchy collapses after the first step, one finds numerically that higher order steps generate a sequence of 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 classical 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.

Affiliated with

Also associated with

No associations

Rating

A paradox in bosonic energy calculations via semidefinite programming relaxations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A paradox in bosonic energy calculations via semidefinite programming relaxations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A paradox in bosonic energy calculations via semidefinite programming relaxations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-352433