Fooling one-sided quantum protocols

DOI10.4230/LIPICS.STACS.2013.424MaRDI QIDQ2957903zbMATH OpenFDO

Authors Hartmut Klauck, Ronald de Wolf

Publication date 30 January 2017

Full work available at URL https://arxiv.org/abs/1204.4619

zbMATH Keywords

communication complexityfooling setlower boundquantum computing

Mathematics Subject Classification ID

Network protocols (68M12) Quantum algorithms and complexity in the theory of computing (68Q12)

Recommendations

• Lower Bounds for Quantum Communication Complexity
• New bounds on classical and quantum one-way communication complexity
• Nondeterministic Quantum Query and Communication Complexities
• Quantum communication complexity of symmetric predicates
• scientific article; zbMATH DE number 2086394

Cited in

(3)

• Fooling-sets and rank
• The (minimum) rank of typical fooling-set matrices
• Lower Bounds for Quantum Communication Complexity

This page was built for publication: Fooling one-sided quantum protocols

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