References
==================================================
Bancal, Jean-Daniel, Lana Sheridan, and Valerio Scarani. 2014. “More
Randomness from the Same Data.” *New Journal of Physics* 16 (3): 033011.
doi:\ `10.1088/1367-2630/16/3/033011 <http://dx.doi.org/10.1088/1367-2630/16/3/033011>`__.

Fayngold, M., and V. Fayngold. 2013. *Quantum Mechanics and Quantum
Information*. Wiley-VCH.

Johansson, J.R., P.D. Nation, and Franco Nori. 2013. “QuTiP 2: A Python
Framework for the Dynamics of Open Quantum Systems.” *Computer Physics
Communications* 184 (4): 1234–40.
doi:\ `10.1016/j.cpc.2012.11.019 <http://dx.doi.org/10.1016/j.cpc.2012.11.019>`__.

Moroder, Tobias, Jean-Daniel Bancal, Yeong-Cherng Liang, Martin Hofmann,
and Otfried Gühne. 2013. “Device-Independent Entanglement Quantification
and Related Applications.” *Physics Review Letters* 111 (3). American
Physical Society: 030501.
doi:\ `10.1103/PhysRevLett.111.030501 <http://dx.doi.org/10.1103/PhysRevLett.111.030501>`__.

Navascués, M., A. García-Sáez, A. Acín, S. Pironio, and M.B. Plenio.
2013. “A Paradox in Bosonic Energy Computations via Semidefinite
Programming Relaxations.” *New Journal of Physics* 15 (2): 023026.
doi:\ `10.1088/1367-2630/15/2/023026 <http://dx.doi.org/10.1088/1367-2630/15/2/023026>`__.

Nieto-Silleras, O., S. Pironio, and J. Silman. 2014. “Using Complete
Measurement Statistics for Optimal Device-Independent Randomness
Evaluation.” *New Journal of Physics* 16 (1): 013035.
doi:\ `10.1088/1367-2630/16/1/013035 <http://dx.doi.org/10.1088/1367-2630/16/1/013035>`__.

Pironio, S., M. Navascués, and A. Acín. 2010. “Convergent Relaxations of
Polynomial Optimization Problems with Noncommuting Variables.” *SIAM
Journal on Optimization* 20 (5). SIAM: 2157–80.
doi:\ `10.1137/090760155 <http://dx.doi.org/10.1137/090760155>`__.

Sturm, J.F. 1999. “Using SeDuMi 1.02, a MATLAB Toolbox for Optimization
over Symmetric Cones.” *Optimization Methods and Software* 11 (1-4):
625–53.

Waki, H.; S. Kim, M. Kojima, M. Muramatsu, and H. Sugimoto. 2008. “Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems.” ACM Transactions on Mathematical Software, 2008, 35(2), 15.
doi:\ `10.1145/1377612.1377619 <http://dx.doi.org/10.1145/1377612.1377619>`__.

Yamashita, M., K. Fujisawa, and M. Kojima. 2003. “SDPARA: Semidefinite
Programming Algorithm Parallel Version.” *Parallel Computing* 29 (8):
1053–67.
