Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States
From MaRDI portal
Cited in
(20)- Euclidean distance matrices and separations in communication complexity theory
- Completely positive semidefinite rank
- Information-theoretic approximations of the nonnegative rank
- Multipartite quantum correlation and communication complexities
- Communication complexity with small advantage
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- Exponential lower bounds for polytopes in combinatorial optimization
- Mixed states in one spatial dimension: decompositions and correspondence with nonnegative matrices
- Common information and unique disjointness
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- Approximate tensor decompositions: disappearance of many separations
- Some upper and lower bounds on PSD-rank
- Common Information, Noise Stability, and Their Extensions
- scientific article; zbMATH DE number 7650118 (Why is no real title available?)
- Multiplicative updates for symmetric-cone factorizations
- Restricted hidden cardinality constraints in causal models
- Mapping the frontier: a review of quantum and evolutionary game theory for complex decision-making
- Channel simulation: theory and applications to lossy compression and differential privacy
- Lower bounds on nonnegative rank via nonnegative nuclear norms
- Positive semidefinite rank
This page was built for publication: Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346440)
