Exponential Separation of Quantum and Classical One-Way Communication Complexity
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum computation (81P68) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Recommendations
- Exponential separation of quantum and classical one-way communication complexity
- Exponential separation of quantum and classical communication complexity
- A new exponential separation between quantum and classical one-way communication complexity
- Exponential separations for one-way quantum communication complexity, with applications to cryptography
- Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
Cited in
(24)- Kolmogorov complexity and combinatorial methods in communication complexity
- Experimental multipartner quantum communication complexity employing just one qubit
- Sublinear estimation of weighted matchings in dynamic data streams
- scientific article; zbMATH DE number 7651028 (Why is no real title available?)
- Exponential separation of quantum communication and classical information
- Quantum one-way communication can be exponentially stronger than classical communication
- Exponential separations for one-way quantum communication complexity, with applications to cryptography
- Structural results on matching estimation with applications to streaming
- Bounded-error quantum state identification and exponential separations in communication complexity
- Bounded-error quantum state identification and exponential separations in communication complexity
- The Power of One Clean Qubit in Communication Complexity
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- A new exponential separation between quantum and classical one-way communication complexity
- Communication memento: memoryless communication complexity
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity
- A generalized Grothendieck inequality and nonlocal correlations that require high entanglement
- Exponential separation of quantum and classical communication complexity
- Quantum one-way versus classical two-way communication in XOR games
- Towards quantum computing based community detection
- scientific article; zbMATH DE number 7204275 (Why is no real title available?)
- Exponential Separation of Information and Communication for Boolean Functions
- Exponential separation of quantum and classical one-way communication complexity
- Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography
- Quantum weakly nondeterministic communication complexity
This page was built for publication: Exponential Separation of Quantum and Classical One-Way Communication Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3614162)
