Pages that link to "Item:Q2819566"
From MaRDI portal
The following pages link to Exponential separation of quantum and classical communication complexity (Q2819566):
Displaying 27 items.
- Experimental multipartner quantum communication complexity employing just one qubit (Q269058) (← links)
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Towards characterizing the non-locality of entangled quantum states (Q387027) (← links)
- Small ball probability and Dvoretzky's Theorem (Q877471) (← links)
- Classical versus quantum communication in XOR games (Q1654152) (← links)
- Quantum branching programs and space-bounded nonuniform quantum complexity (Q1779302) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- Almost-everywhere superiority for quantum polynomial time (Q1854537) (← links)
- PSPACE has constant-round quantum interactive proof systems (Q1870552) (← links)
- Quantum entanglement as a new information processing resource (Q1880335) (← links)
- Quantum versus randomized communication complexity, with efficient players (Q2099674) (← links)
- Quantum one-way versus classical two-way communication in XOR games (Q2687124) (← links)
- Parity decision tree in classical-quantum separations for certain classes of Boolean functions (Q2690505) (← links)
- Quantum communication complexity advantage implies violation of a Bell inequality (Q2962327) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Forrelation: A Problem That Optimally Separates Quantum from Classical Computing (Q4571925) (← links)
- (Q5089155) (← links)
- (Q5090373) (← links)
- (Q5090458) (← links)
- The complexity of quantum disjointness (Q5111229) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- Noise and the Mermin-GHZ Game (Q5170273) (← links)
- Noisy Interactive Quantum Communication (Q5232323) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
- Optimal bounds for parity-oblivious random access codes (Q5855036) (← links)
- An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036) (← links)
