Three-input Majority Function as the Unique Optimal Function for the Bias Amplification using Nonlocal Boxes
Ryuhei Mori

TL;DR
This paper proves that the 3-input majority function is uniquely optimal for bias amplification in nonlocal box protocols, establishing the exact threshold for trivial communication complexity and comparing adaptive and non-adaptive strategies.
Contribution
It demonstrates the optimality of the 3-input majority function for bias amplification under specific protocols, improving understanding of nonlocal correlations and communication complexity thresholds.
Findings
The 3-input majority function is uniquely optimal for bias amplification.
A new adaptive protocol inspired by Pawłowski et al. outperforms non-adaptive protocols.
The optimal threshold for trivial communication complexity is established at (3+√6)/6.
Abstract
Brassard et al. [Phys. Rev. Lett. 96, 250401 (2006)] showed that shared nonlocal boxes with the CHSH probability greater than yields trivial communication complexity. There still exists the gap with the maximum CHSH probability achievable by quantum mechanics. It is an interesting open question to determine the exact threshold for the trivial communication complexity. Brassard et al.'s idea is based on the recursive bias amplification by the 3-input majority function. It was not obvious if other choice of function exhibits stronger bias amplification. We show that the 3-input majority function is the unique optimal, so that one cannot improve the threshold by Brassard et al.'s bias amplification. In this work, protocols for computing the function used for the bias amplification are restricted to be non-adaptive protocols or…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
