Two-party Hamming distance is a fundamental primitive in which two parties hold bit strings and want to compute how many positions differ, while revealing nothing beyond the result. A new paper on arXiv introduces quantum protocols for this task that are information-theoretically private, meaning security holds even against unbounded adversaries. The setting is stricter than usual: both parties must output the same estimate, which classically forces a trade-off between privacy and communication.
According to the abstract, classical information-theoretic protocols for input length n require more resources—the sentence is cut off, but the paper's title and framing make the direction clear. The quantum protocols, by contrast, achieve the same privacy guarantee with less communication, demonstrating a quantum advantage for a differentially private computation.
If the result holds up, it adds to a growing list of tasks where quantum communication outperforms classical communication under information-theoretic security. It also suggests that quantum resources can help in privacy-preserving analytics, not just in speedups for computational problems.