Correlation matrices, Clifford algebras, and completely positive semidefinite rank

ABSTRACT A symmetric matrix X is completely positive semidefinite (cpsd) if there exist positive semidefinite matrices (for some ) such that for all . The of a cpsd matrix is the smallest for which such a representation is possible. It was shown independently in Prakash A, Sikora J, Varvitsiotis A, et al. [Completely positive semidefinite rank. 2016 Apr. arXiv:1604.07199] and Gribling S, de Laat D, Laurent M. [Matrices with high completely positive semidefinite rank. Linear Algebra Appl. 2017 May;513:122–148] that there exist completely positive semidefinite matrices with sub-exponential cpsd-rank. Both proofs were obtained using fundamental results from the quantum information literature as a black-box. In this work we give a self-contained and succinct proof of the existence of completely positive semidefinite matrices with sub-exponential cpsd-rank. For this, we introduce matrix valued Gram decompositions for correlation matrices and show that for extremal correlations, the matrices in such a factorization generate a Clifford algebra. Lastly, we show that this fact underlies and generalizes Tsirelson's results concerning the structure of quantum representations for extremal quantum correlation matrices.

[1]  B. Tsirelson Quantum analogues of the Bell inequalities. The case of two spatially separated domains , 1987 .

[2]  R. Grone,et al.  Extremal correlation matrices , 1990 .

[3]  B. Tsirelson Some results and problems on quan-tum Bell-type inequalities , 1993 .

[4]  Chi-Kwong Li,et al.  A Note on Extreme Correlation Matrices , 1994, SIAM J. Matrix Anal. Appl..

[5]  Charles R. Johnson,et al.  Completely positive matrices associated with M-matrices , 1994 .

[6]  Michel Deza,et al.  Geometry of cuts and metrics , 2009, Algorithms and combinatorics.

[7]  G. Lindblad A General No-Cloning Theorem , 1999 .

[8]  J. Stillwell,et al.  Symmetry , 2000, Am. Math. Mon..

[9]  A. Berman,et al.  Completely Positive Matrices , 2003 .

[10]  H. Barnum,et al.  Generalized no-broadcasting theorem. , 2007, Physical review letters.

[11]  David Avis,et al.  From Bell Inequalities to Tsirelson's Theorem , 2008, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[12]  R. Goodman,et al.  Symmetry, Representations, and Invariants , 2009 .

[13]  Samuel Burer,et al.  On the copositive representation of binary and continuous nonconvex quadratic programs , 2009, Math. Program..

[14]  Tim Netzer,et al.  Polynomials with and without determinantal representations , 2010, 1008.1931.

[15]  William Slofstra,et al.  Lower bounds on the entanglement needed to play XOR non-local games , 2011 .

[16]  The automorphism group of a completely positive cone and its Lie algebra , 2013 .

[17]  Tim Netzer,et al.  Hyperbolic Polynomials and Generalized Clifford Algebras , 2012, Discret. Comput. Geom..

[18]  D. Roberson Conic formulations of graph homomorphisms , 2014, 1411.6723.

[19]  Monique Laurent,et al.  Conic Approach to Quantum Graph Parameters Using Linear Optimization Over the Completely Positive Semidefinite Cone , 2013, SIAM J. Optim..

[20]  Immanuel M. Bomze,et al.  New Lower Bounds and Asymptotics for the cp-Rank , 2015, SIAM J. Matrix Anal. Appl..

[21]  Rekha R. Thomas,et al.  Positive semidefinite rank , 2014, Math. Program..

[22]  Antonios Varvitsiotis,et al.  Linear conic formulations for two-party correlations and values of nonlocal games , 2015, Math. Program..

[23]  Monique Laurent,et al.  Matrices With High Completely Positive Semidefinite Rank , 2016, 1605.00988.

[24]  Zhaohui Wei,et al.  Completely positive semidefinite rank , 2016, Math. Program..

[25]  William Slofstra,et al.  THE SET OF QUANTUM CORRELATIONS IS NOT CLOSED , 2017, Forum of Mathematics, Pi.

[26]  Mikael Rørdam,et al.  Non-closure of Quantum Correlation Matrices and Factorizable Channels that Require Infinite Dimensional Ancilla (With an Appendix by Narutaka Ozawa) , 2018, Communications in Mathematical Physics.

[27]  Vern I. Paulsen,et al.  Non-closure of the Set of Quantum Correlations via Graphs , 2017, Communications in Mathematical Physics.