The complexity of quantum disjointness
From MaRDI portal
Publication:5111229
DOI10.4230/LIPICS.MFCS.2017.15zbMATH Open1441.68059OpenAlexW2775607353MaRDI QIDQ5111229FDOQ5111229
Publication date: 26 May 2020
Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#Klauck17
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
Quantum algorithms and complexity in the theory of computing (68Q12) Communication complexity, information complexity (68Q11)
Cites Work
- An elementary proof of a theorem of Johnson and Lindenstrauss
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exponential separation of quantum and classical communication complexity
- The Probabilistic Communication Complexity of Set Intersection
- Communication Complexity
- Quantum communication complexity of symmetric predicates
- Title not available (Why is that?)
- On the distributional complexity of disjointness
- A strong direct product theorem for disjointness
- Two Results about Quantum Messages
- Algebrization
- On quantum and probabilistic communication
- Zero-information protocols and unambiguity in Arthur-Merlin communication
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum communication and complexity.
- Quantum one-way communication can be exponentially stronger than classical communication
- Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
Cited In (5)
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)
