Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States

DOI10.1109/TIT.2013.2258372zbMath1364.81061OpenAlexW2039156581MaRDI QIDQ5346440

Zhao Hui Wei, Shengyu Zhang, Rahul Jain, Yaoyun Shi

Publication date: 8 June 2017

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

Full work available at URL: https://doi.org/10.1109/tit.2013.2258372

Mathematics Subject Classification ID

Information theory (general) (94A15) Statistical aspects of information-theoretic topics (62B10) Communication theory (94A05) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Related Items (19)

Common information and unique disjointness ⋮ Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness ⋮ Quantum game players can have advantage without discord ⋮ Communication complexity with small advantage ⋮ Unnamed Item ⋮ Euclidean distance matrices and separations in communication complexity theory ⋮ Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices ⋮ Multiplicative updates for symmetric-cone factorizations ⋮ Approximate tensor decompositions: Disappearance of many separations ⋮ Some upper and lower bounds on PSD-rank ⋮ Information-theoretic approximations of the nonnegative rank ⋮ Multipartite quantum correlation and communication complexities ⋮ Completely positive semidefinite rank ⋮ Exponential Lower Bounds for Polytopes in Combinatorial Optimization ⋮ Restricted hidden cardinality constraints in causal models ⋮ Lower bounds on nonnegative rank via nonnegative nuclear norms ⋮ Positive semidefinite rank ⋮ Lower bounds on matrix factorization ranks via noncommutative polynomial optimization ⋮ Common Information, Noise Stability, and Their Extensions

This page was built for publication: Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States