Pages that link to "Item:Q3614162"
From MaRDI portal
The following pages link to Exponential Separation of Quantum and Classical One-Way Communication Complexity (Q3614162):
Displaying 14 items.
- Experimental multipartner quantum communication complexity employing just one qubit (Q269058) (← links)
- Quantum weakly nondeterministic communication complexity (Q387026) (← links)
- Kolmogorov complexity and combinatorial methods in communication complexity (Q534568) (← links)
- A generalized Grothendieck inequality and nonlocal correlations that require high entanglement (Q635824) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Towards quantum computing based community detection (Q2065973) (← links)
- On the Power of Lower Bound Methods for One-Way Quantum Communication Complexity (Q3012791) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Exponential separation of quantum communication and classical information (Q4977978) (← links)
- (Q5111154) (← links)
- (Q5874382) (← links)
- Exponential Separation of Information and Communication for Boolean Functions (Q5892102) (← links)
- The Power of One Clean Qubit in Communication Complexity (Q6168487) (← links)