A new algorithm from Weijun Feng of the Fujian Normal University and colleagues, in collaboration with Sun Yat-sen University, shows an exponential separation between quantum and classical space complexity when estimating Shannon entropy in data streams. The two-stage quantum streaming algorithm achieves logarithmic space complexity, a sharp improvement over the polynomial space needed by any classical method. This demonstrates a key distinction between quantum query complexity and streaming space complexity, highlighting a practical problem in areas like computer networking where quantum computation offers a vital advantage. Quantum algorithm achieves logarithmic space complexity for Shannon entropy estimation Shannon entropy estimation now requires logarithmic space on a quantum computer, a dramatic improvement over the polynomial space demanded by all classical algorithms for the same task. Previously, even the best quantum methods only offered a quadratic speedup for estimating entropy, falling short of a definitive advantage. The two-stage quantum streaming algorithm constructs a specialised ‘oracle’ from incoming data, enabling efficient quantum queries impossible for classical systems. Shannon entropy, a fundamental concept in information theory, quantifies the uncertainty or randomness inherent in a data source. Accurately estimating this entropy is crucial for various applications, including data compression, cryptography, and machine learning. Classical algorithms for Shannon entropy estimation typically require storing a significant portion of the data stream to achieve reasonable accuracy, leading to polynomial space complexity, meaning the memory requirement grows proportionally to a power of the input stream size. This becomes a bottleneck when dealing with massive, continuous data streams. This establishes a fundamental gap between how quantum and classical computers process information in data-rich environments, with potential implications for network analysis and data compression techniques. While practical implementation on near-term devices with limited qubit numbers remains a challenge, the algorithm achieves its space efficiency while maintaining accuracy parameters. Classical algorithms require exponentially