Quantum computing promises unprecedented speed, but in practice, it’s proven remarkably difficult to find important questions that quantum machines can solve faster than classical ones. One of the most notable demonstrations of this came from Ewin Tang(opens a new tab), who rose to prominence in the field as a teenager. When quantum algorithms had in principle cracked the so-called recommendation problem, Tang designed classical algorithms that could match them.