Quantum Weakly Nondeterministic Communication Complexity

DOI10.1007/11821069_57MaRDI QIDQ5756686zbMATH OpenOpenAlexFDO

Authors François Le Gall

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_57

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Quantum computation (81P68)

Recommendations

• Quantum weakly nondeterministic communication complexity
• Nondeterministic Quantum Query and Communication Complexities
• Exponential separation of quantum and classical communication complexity
• Two results about quantum messages
• Tensor rank and strong quantum nondeterminism in multiparty communication

Cited in

(8)

• Tensor rank and strong quantum nondeterminism in multiparty communication
• scientific article; zbMATH DE number 5568623 (Why is no real title available?)
• Quantum weakly nondeterministic communication complexity
• Nondeterministic Quantum Query and Communication Complexities
• The complexity of quantum disjointness
• Quantum Multiparty Communication Complexity and Circuit Lower Bounds
• Unbounded-error quantum query complexity
• Exponential separation of quantum and classical online space complexity

This page was built for publication: Quantum Weakly Nondeterministic Communication Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5756686)