We prove tight bounds of Θ(k logk) queries for non-adaptively testing whether a function f : {0,1}→{0,1} is a k-parity or far from any k-parity. The lower bound combines a recent method of Blais, Brody and Matulef [4] to get lower bounds for testing from communication complexity with an Ω(k logk) lower bound for the one-way communication complexity of k-disjointness.

The comparison of communication protocols using quantum messages with protocols using classical messages is a central topic in information and communication theory. It is always good to understand such questions well in the simplest settings where they arise. An example is the setting of one-way communication complexity, which is rich enough to lead to many interesting questions, yet accessible...

This article describes a series of demonstration projects that use multiscalar gigapixel image technology to iteratively design, test, and study how visitors learn to observe more scientifically in museums, online, and through museum-based programming. We consider how the particular affordances of systems like these can move science communication and learning from didactic approaches centered o...

In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating only O(log n) qubits, but for which any classical (randomized, bounded-error) protocol requires poly(n) bits of communication. That quantum protocol requires two rounds of communication. Ever since Raz’s paper it was open whether the same exponential separation can be achieved with a quantum pro...

• Thoroughly critiques the normative bias in public relations. Challenges two-way symmetrical narrative that it employs dialogue. various treatments of dialogue as impractical by examining two “Negative Spaces”. Describes appropriate contexts, purposes, and applications dialogic theory. Provides table summarising features is used media. This paper challenges four assumptions relations literatur...