Quantum weakly nondeterministic communication complexity

DOI10.1016/J.TCS.2012.12.015MaRDI QIDQ387026zbMATH OpenOpenAlexFDO

Authors 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 algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45)

Recommendations

• Quantum Weakly Nondeterministic Communication Complexity
• Nondeterministic Quantum Query and Communication Complexities
• Quantum communication complexity
• Lower Bounds for Quantum Communication Complexity
• scientific article; zbMATH DE number 1512076
• Quantum multiparty communication complexity and circuit lower bounds
• Quantum Multiparty Communication Complexity and Circuit Lower Bounds
• Quantum entanglement and communication complexity
• Communication complexity as a principle of quantum mechanics
• Unconventional Computation

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5485520 (Why is no real title available?)
• scientific article; zbMATH DE number 3471925 (Why is no real title available?)
• scientific article; zbMATH DE number 1011685 (Why is no real title available?)
• scientific article; zbMATH DE number 1512076 (Why is no real title available?)
• scientific article; zbMATH DE number 1775389 (Why is no real title available?)
• scientific article; zbMATH DE number 2086394 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A new proof of several inequalities on codes and sets
• Communication Complexity
• Complexity limitations on quantum computation
• Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy
• Exponential Separation of Quantum and Classical One-Way Communication Complexity
• Exponential separation of quantum and classical communication complexity
• Exponential separations for one-way quantum communication complexity, with applications to cryptography
• Nondeterministic Quantum Query and Communication Complexities
• On quantum and probabilistic communication: Las Vegas and one-way protocols
• Orthogonal vectors in the \(n\)-dimensional cube and codes with missing distances
• Quantum Complexity Theory
• Quantum Property Testing
• Quantum certificate complexity
• Quantum communication and complexity.
• Quantum search of spatial regions
• Rapid solution of problems by quantum computation
• \(\text{NQP}_\mathbb{C}=\text{co-C}_=\text{P}\)

Cited in

(7)

• Quantum Weakly Nondeterministic Communication Complexity
• Quantum Multiparty Communication Complexity and Circuit Lower Bounds
• Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication
• Nondeterministic Quantum Query and Communication Complexities
• scientific article; zbMATH DE number 5568623 (Why is no real title available?)
• Tensor rank and strong quantum nondeterminism in multiparty communication
• Two results about quantum messages

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 Q387026)