The following pages link to Quantum communication complexity (Q720535):
Displaying 18 items.
- Objective computation versus subjective computation (Q320171) (← links)
- Quantum computing without entanglement (Q596121) (← links)
- Exponential quantum enhancement for distributed addition with local nonlinearity (Q967277) (← links)
- Two party non-local games (Q1008263) (← links)
- The Morita theory of quantum graph isomorphisms (Q1720201) (← links)
- Quantum entanglement as a new information processing resource (Q1880335) (← links)
- Quantum speed-up for unsupervised learning (Q1945031) (← links)
- A short review on quantum identity authentication protocols: how would Bob know that he is talking with Alice? (Q2102791) (← links)
- Communication complexity as a principle of quantum mechanics (Q2431804) (← links)
- Quantum pseudo-telepathy (Q2505724) (← links)
- Lower bounds on the entanglement needed to play XOR non-local games (Q2851716) (← links)
- Generalizations of the distributed Deutsch–Jozsa promise problem (Q2973249) (← links)
- Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial (Q3107878) (← links)
- Lifting Bell inequalities (Q3438456) (← links)
- Bell-type inequalities for nonlocal resources (Q3442082) (← links)
- Non-local setting and outcome information for violation of Bell's inequality (Q5135193) (← links)
- Entangled states cannot be classically simulated in generalized Bell experiments with quantum inputs (Q5141487) (← links)
- Strong simulation of linear optical processes (Q6167678) (← links)
