The article discusses a recent breakthrough in quantum computing where researchers have demonstrated a significant speedup for solving a specific class of hard problems compared to classical methods. The remarks from readers highlight a desire for clearer comparisons, particularly around the Big O notation that conveys the efficiency of the algorithms in classical versus quantum contexts. The mention of Shor's algorithm indicates that readers are critically thinking about established examples of quantum advantage but also express skepticism about the implications of recent findings.