Pages that link to "Item:Q5419072"
From MaRDI portal
The following pages link to Quantum one-way communication can be exponentially stronger than classical communication (Q5419072):
Displaying 19 items.
- Classical versus quantum communication in XOR games (Q1654152) (← links)
- Quantum versus randomized communication complexity, with efficient players (Q2099674) (← links)
- Sampling by intersections with random geodesics (Q2182033) (← links)
- On approximations of the PSD cone by a polynomial number of smaller-sized PSD cones (Q2687062) (← links)
- Quantum one-way versus classical two-way communication in XOR games (Q2687124) (← 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)
- Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
- Interactive Information Complexity (Q3454520) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Interactive Information Complexity (Q4592949) (← links)
- On Polyhedral Approximations of the Positive Semidefinite Cone (Q5026447) (← links)
- Polynomial Data Structure Lower Bounds in the Group Model (Q5067444) (← links)
- (Q5089155) (← links)
- (Q5090373) (← links)
- The complexity of quantum disjointness (Q5111229) (← links)
- Query-to-Communication Lifting for BPP (Q5117373) (← links)
- Optimal bounds for parity-oblivious random access codes (Q5855036) (← links)
- An Optimal Separation of Randomized and Quantum Query Complexity (Q5890036) (← links)