Recommendations
- scientific article; zbMATH DE number 2086394
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- Interaction in quantum communication and the complexity of \textsc{Set Disjointness}
- Quantum Weakly Nondeterministic Communication Complexity
- Quantum communication complexity of symmetric predicates
Cites work
- scientific article; zbMATH DE number 5485519 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 6829278 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- A strong direct product theorem for disjointness
- Algebrization: a new barrier in complexity theory
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Communication Complexity
- Exponential separation of quantum and classical communication complexity
- Near-optimal bounds on the bounded-round quantum communication complexity of disjointness
- On quantum and probabilistic communication: Las Vegas and one-way protocols
- On the distributional complexity of disjointness
- Quantum communication and complexity.
- Quantum communication complexity of symmetric predicates
- Quantum one-way communication can be exponentially stronger than classical communication
- Quantum search of spatial regions
- Quantum versus classical proofs and advice
- The Probabilistic Communication Complexity of Set Intersection
- Two results about quantum messages
- Zero-information protocols and unambiguity in Arthur-Merlin communication
Cited in
(6)
This page was built for publication: The complexity of quantum disjointness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111229)
