CV systems are hard to get started with, but the package Strawberry Fields provides a nice framework and a perhaps even nicer documentation for beginners. Here we study a simple variant of the CHSH inequality in the CV setting.
Posts tagged: Semidefinite programming
Semidefinite programming relaxations of polynomial optimization problems of commuting variables with moment constraints, parametric and bilevel variants.
A brief overview of SDP solvers and tools in Python
Optimal randomness generation from entangled quantum states: computational appendix to arXiv:1505.03837.
It is possible to detect a rank loop in the hierarchy of SDP relaxations of polynomial optimization problems, but an arbitrary-precision SDP solver is recommended.
GCC, ICC, PGI compilers with BLAS/LAPACK, MKL, and ACML are compared in solving an SDP with SDPA.
Second-order semidefinite relaxation of a constrained commutative polynomial optimization problem using PICOS in Python, exporting to SDPA.