The complexity of quantum disjointness

DOI10.4230/LIPIcs.MFCS.2017.15zbMath1441.68059OpenAlexW2775607353MaRDI QIDQ5111229

Hartmut Klauck

Publication date: 26 May 2020

Full work available at URL: https://dblp.uni-trier.de/db/conf/mfcs/mfcs2017.html#Klauck17

zbMATH Keywords

communication complexityquantum proof systems

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Zero-information protocols and unambiguity in Arthur-Merlin communication
• On the distributional complexity of disjointness
• Quantum communication and complexity.
• Exponential separation of quantum and classical communication complexity
• A strong direct product theorem for disjointness
• Two Results about Quantum Messages
• Algebrization
• On quantum and probabilistic communication
• The Probabilistic Communication Complexity of Set Intersection
• Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
• Quantum communication complexity of symmetric predicates
• An elementary proof of a theorem of Johnson and Lindenstrauss
• Communication Complexity
• Quantum one-way communication can be exponentially stronger than classical communication

This page was built for publication: The complexity of quantum disjointness