English

Correlation matrices, Clifford algebras, and completely positive semidefinite rank

Optimization and Control 2018-10-01 v2

Abstract

We introduce a notion of matrix valued Gram decompositions for correlation matrices whose study is motivated by quantum information theory. We show that for extremal correlations, the matrices in such a factorization generate a Clifford algebra and thus, their size is exponential in terms of the rank of the correlation matrix. Using this we give a self-contained and succinct proof of the existence of completely positive semidefinite matrices with sub-exponential cpsd-rank, recently derived in the literature. This fact also underlies and generalizes Tsirelson's seminal lower bound on the local dimension of a quantum system necessary to generate an extreme quantum correlation.

Keywords

Cite

@article{arxiv.1702.06305,
  title  = {Correlation matrices, Clifford algebras, and completely positive semidefinite rank},
  author = {Anupam Prakash and Antonios Varvitsiotis},
  journal= {arXiv preprint arXiv:1702.06305},
  year   = {2018}
}

Comments

New title. To appear in Linear & Multilinear Algebra. 15 pages. Comments welcome!