scientific article; zbMATH DE number 5568623

MaRDI QIDQ3633949zbMATH OpenFDO

Authors Yaoyun Shi, Yufan Zhu

Publication date 23 June 2009

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

zbMATH Keywords

communication complexitypolynomial approximation of Boolean functionsquantum information processingquantum lower bound

Mathematics Subject Classification ID

Quantum computation (81P68) Analytic circuit theory (94C05)

Recommendations

• Quantum communication complexity
• scientific article; zbMATH DE number 1512076
• Communication complexity of private simultaneous quantum messages protocols
• Quantum Multiparty Communication Complexity and Circuit Lower Bounds
• Quantum multiparty communication complexity and circuit lower bounds
• Lower Bounds for Quantum Communication Complexity
• Quantum Weakly Nondeterministic Communication Complexity
• Quantum weakly nondeterministic communication complexity
• Communication complexity as a principle of quantum mechanics
• Unconventional Computation

Cited in

(32)

• Simulation theorems via pseudo-random properties
• On derandomized composition of Boolean functions
• Query-to-communication lifting for \(\mathsf{P}^{\mathsf{NP}}\)
• The unbounded-error communication complexity of symmetric functions
• The multiparty communication complexity of set disjointness
• Tight bounds on communication complexity of symmetric XOR functions in one-way and SMP models
• The Range of Topological Effects on Communication
• Composition theorems in communication complexity
• Quantum multiparty communication complexity and circuit lower bounds
• On the tightness of the Buhrman-Cleve-Wigderson simulation
• The Quantum Communication Complexity of Sampling
• scientific article; zbMATH DE number 1775389 (Why is no real title available?)
• Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
• Deterministic communication vs. partition number
• The NOF multiparty communication complexity of composed functions
• Approximate Degree in Classical and Quantum Computing
• Lifting Theorems for Equality
• Query-to-communication lifting for BPP using inner product
• Query-to-communication lifting for BPP
• A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
• The polynomial method strikes back: tight quantum query bounds via dual polynomials
• The large-error approximate degree of \(\mathrm{AC}^0\)
• Entangled simultaneity versus classical interactivity in communication complexity
• Efficient quantum protocols for XOR functions
• Lower Bounds for Quantum Communication Complexity
• Communication lower bounds using directional derivatives
• Query-to-communication lifting using low-discrepancy gadgets
• scientific article; zbMATH DE number 7650118 (Why is no real title available?)
• The large-error approximate degree of \(\mathrm{AC}^0\)
• Rectangles are nonnegative juntas
• Around the log-rank conjecture
• On the degree of Boolean functions as polynomials over \(\mathbb{Z}_m\)

This page was built for publication:

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