On the quantum communication complexity of total functions
Dmytro Gavinsky
Abstract
We present a total function with a polylogarithmic two-message quantum protocol, whereas every randomised protocol, even with arbitrarily many rounds, requires polynomial communication.
Create a lesson
Related papers
A Structural Proof of the Lower Bound 21 for 3×3 Matrix Multiplication over F2
Shuxing Yang, Rui Zhao, Junyao Wu et al.
An Operator Approach to Register Programs for Catalytic Computing
Antoine Vinciguerra
Rational Reductions and Regular Languages of Constant Circuit Complexity
Stefan Göller, Amaldev Manuel
Hidden Circuits and Exact Counting in Ordered Graphs
Chenghua Liu, Boning Meng
Improved lower bounds for decomposable randomized encoding
Justin Holmgren, Kewen Wu
Separating Non-redundancy and Chain Length
Joshua Brakensiek, Venkatesan Guruswami, Aaron Putterman