ncpol2sdpa icon indicating copy to clipboard operation
ncpol2sdpa copied to clipboard

Solve global polynomial optimization problems of either commutative variables or noncommutative operators through a semidefinite programming (SDP) relaxation

Results 5 ncpol2sdpa issues
Sort by recently updated
recently updated
newest added

` from ncpol2sdpa import * n_vars = 2 # Number of variables level = 2 # Requested level of relaxation x = generate_variables('x', n_vars) obj = x[0]*x[1] + x[1]*x[0] inequalities...

I'm getting the error `RuntimeError: The requested monomial ___ could not be found` For instance, in this code ```python from ncpol2sdpa import * X = generate_variables('x', 2) obj = X[0]...

Hey, I tried to obtain an upper bound for the quantum value I3322 inequality introduced in https://journals.aps.org/prl/pdf/10.1103/PhysRevLett.100.210503 The code of the implementation is attached. [TestI3322.py.zip](https://github.com/peterwittek/ncpol2sdpa/files/2180692/TestI3322.py.zip) Now this implementation returns the...

Only 1D works at the moment, and without the Fourier transformation to fully exploit block diagonal structures. See [arXiv:1307.1002](https://arxiv.org/abs/1307.1002).

enhancement

The [hierachy for quantum steering](http://dx.doi.org/10.1103/physrevlett.115.210401) is supported, but a working example exampel is missing. The core idea is simple, it follows the NPA hierarchy: ``` python from ncpol2sdpa import SteeringHierarchy,...

enhancement