has proven that classical computers can solve the "recommendation problem" nearly as fast as quantum computers. The result eliminates one of the best examples of quantum speedup...
A teenager from Texas has taken quantum computing down a notch. In a paper (A Quantuminspired Classical Algorithm for Recommendation Systems) posted online earlier this month, 18yearold Ewin Tang proved that ordinary computers can solve an important computing problem with performance potentially comparable to that of a quantum computer.
In its most practical form, the "recommendation problem" relates to how services like Amazon and Netflix determine which products you might like to try.
Computer scientists had considered it to be one of the best examples of a problem that's exponentially faster to solve on quantum computers  making it an important validation of the power of these futuristic machines.
Now Tang has stripped that validation away...
In 2014, at age 14 and after skipping the fourth through sixth grades, Tang enrolled at UT Austin and majored in mathematics and computer science.
In the spring of 2017 Tang took a class on quantum information taught by Scott Aaronson, a prominent researcher in quantum computing. Aaronson recognized Tang as an unusually talented student and offered himself as adviser on an independent research project.
Aaronson gave Tang a handful of problems to choose from, including the recommendation problem.
Tang chose it somewhat reluctantly.
The recommendation problem is designed to give a recommendation for products that users will like.
Consider the case of Netflix. It knows what films you've watched. It knows what all of its other millions of users have watched. Given this information, what are you likely to want to watch next?
You can think of this data as being arranged in a giant grid, or matrix, with movies listed across the top, users listed down the side, and values at points in the grid quantifying whether, or to what extent, each user likes each film.
A good algorithm would generate recommendations by quickly and accurately recognizing similarities between movies and users and filling in the blanks in the matrix.
In 2016 the computer scientists Iordanis Kerenidis and Anupam Prakash published a quantum algorithm that solved the recommendation problem exponentially faster than any known classical algorithm.
They achieved this quantum speedup in part by simplifying the problem:
At the time of Kerenidis and Prakash's work, there were only a few examples of problems that quantum computers seemed to be able to solve exponentially faster than classical computers.
Most of those examples were specialized  they were narrow problems designed to play to the strengths of quantum computers (these include the "forrelation" problem Quanta covered earlier this year).
Kerenidis and Prakash's result was exciting because it provided a realworld problem people cared about where quantum computers outperformed classical ones.
Kerenidis and Prakash proved that a quantum computer could solve the recommendation problem exponentially faster than any known algorithm, but they didn't prove that a fast classical algorithm couldn't exist.
So when Aaronson began working with Tang in 2017, that was the question he posed  prove there is no fast classical recommendation algorithm, and thereby confirm Kerenidis and Prakash's quantum speedup is real.
Tang set to work in the fall of 2017, intending for the recommendation problem to serve as a senior thesis. For several months Tang struggled to prove that a fast classical algorithm was impossible.
As time went on, Tang started to think that maybe such an algorithm was possible after all.
Finally, with the senior thesis deadline bearing down, Tang wrote to Aaronson and admitted a growing suspicion:
Throughout the spring Tang wrote up the results and worked with Aaronson to clarify some steps in the proof.
The fast classical algorithm Tang found was directly inspired by the fast quantum algorithm Kerenidis and Prakash had found two years earlier. Tang showed that the kind of quantum sampling techniques they used in their algorithm could be replicated in a classical setting.
Like Kerenidis and Prakash's algorithm, Tang's algorithm ran in polylogarithmic time  meaning the computational time scaled with the logarithm of characteristics like the number of users and products in the data set  and was exponentially faster than any previously known classical algorithm.
Once Tang had completed the algorithm, Aaronson wanted to be sure it was correct before releasing it publicly.
Aaronson had been planning to attend a quantum computing workshop at the University of California, Berkeley, in June.
Many of the biggest names in the field were going to be there, including Kerenidis and Prakash. Aaronson invited Tang to come out to Berkeley to informally present the algorithm in the days after the official conference ended.
On the mornings of June 18 and 19 Tang gave two lectures while fielding questions from the audience.
By the end of four hours, a consensus emerged:
What many people in the room didn't realize, however, was just how young the speaker was.
The algorithm now faces a formal peer review before publication.
For quantum computing, Tang's result is a setback. Or not. Tang has eliminated one of the clearest, best examples of a quantum advantage.
At the same time, Tang's paper is further evidence of the fruitful interplay between the study of quantum and classical algorithms.
