Asymptotic advantage of quantum one-way and SMP communication for total functions
Dmytro Gavinsky
Abstract
We exhibit a total Boolean function on n input bits whose bounded-error quantum simultaneous-message (and hence one-way) communication complexity is in O( n), whereas its randomised one-way (and hence simultaneous-message) communication complexity is in Ω(n). The same function admits a classical simultaneous-message protocol of cost O( n) when the players share O( n) EPR pairs.
Create a lesson
Related papers
A Little Derandomization Goes a Long Way: Unconditional Circuit Lower Bounds using Low-Degree PIT
Nikolai Chukhin, Karthik Gajulapalli, Alexander Golovnev et al.
Multiplicative and Additive Extractors for Low Entropy Samplable Sources Under Reduced Assumptions
Marshall Ball, Eshan Chattopadhyay, Mohit Gurumukhani et al.
A New Characterization of Streaming Decidability of Boolean CSPs Under Deletions
Aditya Bandekar, Amatya Sharma, Santhoshini Velusamy
Degree profiles of uniform polynomial consequences: Linear lower bounds for Nullstellensatz and Polynomial Calculus
Søren Riis
Quadratic Extractors
Gautam Chandrasekaran, Jesse Goodman, David Zuckerman
PIT and Reconstruction for Sums of Powers
Nimrod Kaplan, Amir Shpilka, Yann Tal