For one specific computational task, the ‘Cheat-Shapen’ function, quantum systems now achieve communication costs of O(log³ Nn log log Nn), defying classical limits. Every randomised protocol for the same function demands polynomial communication regardless of how many interactive rounds are permitted. This establishes an exponential gap between what is computationally possible using quantum and classical methods.
Researchers Bound Quantum Communication to Polylogarithmic Complexity
For one specific computational task, the ‘Cheat-Shapen’ function, quantum systems now achieve communication costs of O(log³ Nn log log Nn), defying classical limits. Every randomised protocol for the same function demands polynomial communication regardless of how many interactive rounds are permitted. This establishes an exponential gap between what is computationally possible using quantum and classical methods.