The following pages link to (Q4939137):
Displaying 11 items.
- Implausible consequences of superstrong nonlocality (Q269047) (← links)
- Experimental multipartner quantum communication complexity employing just one qubit (Q269058) (← links)
- The quantum query complexity of learning multilinear polynomials (Q436558) (← links)
- Entropy lower bounds for quantum decision tree complexity (Q1847373) (← links)
- Quantum communication and complexity. (Q1853475) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- Lower bounds for predecessor searching in the cell probe model (Q2475409) (← links)
- On the power of non-local boxes (Q2503267) (← links)
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness (Q4562275) (← links)
- Exponential lower bound for 2-query locally decodable codes via a quantum argument (Q5917576) (← links)
- Sensitivity, affine transforms and quantum communication complexity (Q5918933) (← links)
