Pages that link to "Item:Q5346440"
From MaRDI portal
The following pages link to Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States (Q5346440):
Displaying 17 items.
- Common information and unique disjointness (Q343843) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- Positive semidefinite rank (Q745689) (← links)
- Euclidean distance matrices and separations in communication complexity theory (Q1731462) (← links)
- Completely positive semidefinite rank (Q1785204) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Multipartite quantum correlation and communication complexities (Q2012182) (← links)
- Communication complexity with small advantage (Q2182866) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- Quantum game players can have advantage without discord (Q2407098) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)
- Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices (Q3298903) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Approximate tensor decompositions: Disappearance of many separations (Q5154281) (← links)
- Common Information, Noise Stability, and Their Extensions (Q5863763) (← links)
- (Q5875509) (← links)
