Compressibility of Positive Semidefinite Factorizations and Quantum Models

DOI10.1109/TIT.2016.2538278MaRDI QIDQ2976873zbMATH OpenOpenAlexWikidataFDO

Authors Cyril Jakob Stark, Aram W. Harrow

Publication date 28 April 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1412.7437

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: 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 normalization constraints) as compression of quantum models. We derive both lower and upper bounds on compressibility. Applications are broad and range from the statistical analysis of experimental data to bounding the one-way quantum communication complexity of Boolean functions.

Cited in

(8)

• Quantum compression relative to a set of measurements
• Dimensionality reduction of SDPs through sketching
• Global completability with applications to self-consistent quantum tomography
• Nonlocal Games with Noisy Maximally Entangled States are Decidable
• Approximate tensor decompositions: disappearance of many separations
• Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations
• Decidability of fully quantum nonlocal games with noisy maximally entangled states
• Positive semidefinite rank

This page was built for publication: Compressibility of Positive Semidefinite Factorizations and Quantum Models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2976873)