Quantum weakly nondeterministic communication complexity

DOI10.1016/j.tcs.2012.12.015zbMath1277.68081OpenAlexW1531104768MaRDI QIDQ387026

François Le Gall

Publication date: 11 December 2013

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2012.12.015

zbMATH Keywords

quantum computingnondeterministic communication complexity

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum algorithms and complexity in the theory of computing (68Q12)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)
• Quantum communication and complexity.
• A new proof of several inequalities on codes and sets
• Complexity limitations on quantum computation
• Quantum certificate complexity
• Exponential separation of quantum and classical communication complexity
• On quantum and probabilistic communication
• Quantum Property Testing
• Exponential Separation of Quantum and Classical One-Way Communication Complexity
• Rapid solution of problems by quantum computation
• Quantum Complexity Theory
• Nondeterministic Quantum Query and Communication Complexities
• Communication Complexity
• Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy

This page was built for publication: Quantum weakly nondeterministic communication complexity