Compressibility of Positive Semidefinite Factorizations and Quantum Models
We investigate compressibility of the dimension of positive semidefinite matrices, while approximately preserving their pairwise inner products. This can either be regarded as compression of positive semidefinite factorizations of nonnegative matrices or (if the matrices are subject to additional no...
Main Authors: | Stark, Cyril, Harrow, Aram W |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Physics |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2017
|
Online Access: | http://hdl.handle.net/1721.1/108466 https://orcid.org/0000-0002-7588-6796 https://orcid.org/0000-0003-3220-7682 |
Similar Items
-
An Improved Semidefinite Programming Hierarchy for Testing Entanglement
by: Harrow, Aram W, et al.
Published: (2021) -
An Improved Semidefinite Programming Hierarchy for Testing Entanglement
by: Harrow, Aram W., et al.
Published: (2022) -
Limitations of Semidefinite Programs for Separable States and Entangled Games
by: Harrow, Aram W., et al.
Published: (2020) -
Positive semidefinite rank
by: Gouveia, João, et al.
Published: (2017) -
Completely positive semidefinite rank
by: Prakash, Anupam, et al.
Published: (2020)