0 vistas

Cargado por pablo

principles of numeric analysis

- Quantum Computing in Big Data Analytics: A Survey by Shaikh 2016
- Land Records in Jharkhand
- CFG Iluminatti
- High Quality Niches (1)
- PotBS_00001
- All Stuff for Free_ DOWNLOAD CAT Materi
- Adobe - After Effects CS3 Tutorial _ Create a Fireworks Effect Using After Effects
- Rohit Dubey
- Akai ADR
- OnlineStatementOfMarks_2
- MRP PO Setup 99349
- Pradhan Mantri Awas Yojana - Gramin (PMAY-G).pdf
- Arpit Newestbnm
- opa powerpoint
- HEXAPP Readme.txt
- lastException_63647846156.txt
- Face to Face Upper Intermediate PDF
- Config File for Dota 2 reborn
- lastException_63561148016
- dallas_onchat_1.7+

Está en la página 1de 4

Mathematics

Biology

Computer Science

All Articles

**Major Quantum Computing Advance Made Obsolete by Teenager
**

Share

quantum computing

Major Quantum Computing Advance Made Obsolete by Teenager

18-year-old Ewin Tang 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.

ADragan

Kevin Hartnett

Senior Writer

July 31, 2018

View PDF/Print Mode

computational complexitycomputer sciencecomputingmathematicsquantum

computingtheoretical computer science

The Prime Number Conspiracy - The Biggest Ideas in Math from Quanta – AVAILABLE

NOW!

**A teenager from Texas has taken quantum computing down a notch. In a paper posted
**

online earlier this month, 18-year-old 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.

**“This was one of the most definitive examples of a quantum speedup, and it’s no
**

longer there,” said Tang, who graduated from the University of Texas, Austin, in

spring and will begin a Ph.D. at the University of Washington in the fall.

**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.

**“I was hesitant because it seemed like a hard problem when I looked at it, but it
**

was the easiest of the problems he gave me,” Tang said.

**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

and he was the authority. there were only a few examples of problems that quantum computers seemed to be able to solve exponentially faster than classical computers. Throughout the spring Tang wrote up the results and worked with Aaronson to clarify some steps in the proof. each user likes each film. with the senior thesis deadline bearing down.” said Kerenidis. A good algorithm would generate recommendations by quickly and accurately recognizing similarities between movies and users and filling in the blanks in the matrix. that was the question he posed — prove there is no fast classical recommendation algorithm.” said Aaronson. users listed down the side. 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. “To my sense it was one of the first examples in machine learning and big data where we showed quantum computers can do something that we still don’t know how to do classically. intending for the recommendation problem to serve as a senior thesis. they developed a way of sorting users into a small number of categories — do they like blockbusters or indie films? — and sampling the existing data in order to generate a recommendation that was simply good enough. a computer scientist at the Research Institute on the Foundations of Computer Science in Paris. Tang’s algorithm ran in polylogarithmic time — meaning the . Finally. or to what extent. or matrix. Tang set to work in the fall of 2017. Tang wrote to Aaronson and admitted a growing suspicion: “Tang wrote to me saying. Tang started to think that maybe such an algorithm was possible after all. They achieved this quantum speedup in part by simplifying the problem: Instead of filling out the entire matrix and identifying the single best product to recommend. ‘I think there is a fast classical algorithm. actually.” Tang said. what are you likely to want to watch next? You can think of this data as being arranged in a giant grid. As time went on. So when Aaronson began working with Tang in 2017.’” Aaronson said. 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). At the time of Kerenidis and Prakash’s work. but they didn’t prove that a fast classical algorithm couldn’t exist. Kerenidis and Prakash’s result was exciting because it provided a real-world 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 I couldn’t really prove it to myself because Scott seemed to think there wasn’t one. Tang showed that the kind of quantum sampling techniques they used in their algorithm could be replicated in a classical setting. The fast classical algorithm Tang found was directly inspired by the fast quantum algorithm Kerenidis and Prakash had found two years earlier. with movies listed across the top. Like Kerenidis and Prakash’s algorithm.information. who believed at the time that no fast classical algorithm existed. For several months Tang struggled to prove that a fast classical algorithm was impossible. “That seemed to me like an important ‘t’ to cross to complete this story. and values at points in the grid quantifying whether. and thereby confirm Kerenidis and Prakash’s quantum speedup is real. “I started believing there is a fast classical algorithm.

The algorithm now faces a formal peer review before publication. Tang’s paper is further evidence of the fruitful interplay between the study of quantum and classical algorithms. best examples of a quantum advantage. Many of the biggest names in the field were going to be there. Abusive. On the mornings of June 18 and 19 Tang gave two lectures while fielding questions from the audience. in June. Berkeley. but then in another sense Tang is giving a big improvement and building on what they did. Aaronson wanted to be sure it was correct before releasing it publicly. misleading. Aaronson had been planning to attend a quantum computing workshop at the University of California. By the end of four hours. Tang’s result is a setback. Moderators are staffed during regular business hours (New York time) and can only accept comments written in English. What many people in the room didn’t realize. civil conversation. was just how young the speaker was. “I was still nervous that once Tang put the paper online. Share this article Newsletter Get Quanta Magazine delivered to your inbox Most recent newsletter The Quanta Newsletter Get highlights of the most important news delivered to your email inbox Most recent newsletter Comment on this article Quanta Magazine moderates comments to facilitate an informed. Aaronson invited Tang to come out to Berkeley to informally present the algorithm in the days after the official conference ended. Tang has eliminated one of the clearest. Or not. if it’s wrong.” Aaronson said. Once Tang had completed the algorithm.” Aaronson said. substantive. Tang never would have come up with this classical algorithm but for their quantum algorithm. incoherent or off- topic comments will be rejected.” Kerenidis said. Art for "A Math Theory for Why People Hallucinate" Art for "A Math Theory for Why People Hallucinate" Next article A Math Theory for Why People Hallucinate About Quanta Archive Contact Us Terms & Conditions Privacy Policy Simons Foundation . “Tang is killing [Kerenidis and Prakash’s] quantum speedup. At the same time. “I did not know Ewin was 18. the first big paper of [Tang’s] career would go splat. including Kerenidis and Prakash. self-promotional.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. and I certainly did not get that from the talk. To me [Ewin] was someone who was giving a very mature talk. profane. For quantum computing. however. a consensus emerged: Tang’s classical algorithm seemed correct.

All Rights Reserved © 2019 .

- Quantum Computing in Big Data Analytics: A Survey by Shaikh 2016Cargado porAbhijeet
- Land Records in JharkhandCargado porassetyogi
- CFG IluminattiCargado porPetreanu Iulian
- High Quality Niches (1)Cargado porUchìhä Ärfåñ
- PotBS_00001Cargado porFlavio Stella
- All Stuff for Free_ DOWNLOAD CAT MateriCargado porangelohero6643
- Adobe - After Effects CS3 Tutorial _ Create a Fireworks Effect Using After EffectsCargado porfitriaholic
- Rohit DubeyCargado porRrohit Dubey
- Akai ADRCargado porSebastian Quarone
- OnlineStatementOfMarks_2Cargado porADITYA PRABHUDESAI
- MRP PO Setup 99349Cargado porGops989
- Pradhan Mantri Awas Yojana - Gramin (PMAY-G).pdfCargado porAnonymous dxsNnL6S8h
- Arpit NewestbnmCargado porPrateek Sharma
- opa powerpointCargado porapi-334777538
- HEXAPP Readme.txtCargado porJason Anderson
- lastException_63647846156.txtCargado porm
- Face to Face Upper Intermediate PDFCargado porAnna
- Config File for Dota 2 rebornCargado pordaniel
- lastException_63561148016Cargado porGeorgiana Cîmpan
- dallas_onchat_1.7+Cargado porjo0o0m0guerra

- The Vega WorldCargado porpablo
- Bichos y SerpientesCargado porpablo
- Light and MatterCargado porpablo
- History of MachineryCargado porpablo
- Circuits for AllCargado porpablo
- AmanecerCargado porpablo
- aventuras famosasCargado porpablo
- Statistics and ProbabilityCargado porpablo
- Quantum Computing Against Classical ComputingCargado porpablo
- TransistorsCargado porpablo
- principles of quantum mechanics.txtCargado porpablo
- principles of quantum mechanics.txtCargado porpablo
- Piano for AllCargado porpablo
- Contemporary GuitarCargado porpablo
- The Physics of the Wind and StormsCargado porpablo
- Note by NoteCargado porpablo
- Guitar ScalesCargado porpablo
- Famous Scores for GuitarCargado porpablo
- The Termodinamic ProcessesCargado porpablo

- Quiz: SoftwareCargado poray
- W310 Robotics Lesson Plan (3)Cargado porAndrea Kowalewicz
- Cloud Computing a General Users Perception and Security Issues at Universities of Faisalabad PakistanCargado porRana Ahmad
- DAA Marking SchemeCargado porEvan Robertson
- biochem lab manualCargado porCarolyne Dale
- Printf - Format SpecifierCargado porSanjog
- ARM Architecture & Programmer ModelCargado pors natarajan
- Syllabus CodeCargado porThasleem Bin Aushiq Hussain
- ResumeCargado porRemy Goldschmidt
- Harris_Ch6Cargado porkulenk
- ge330fall09_lp_model3Cargado porUZMA SIDDIQUE
- Inroduccion MicrocontroladoresCargado porsreenu201
- KnapsackCargado porZia Marwat
- Operating System 1Cargado por亚尚仁
- scmCargado porRajesh Pandey
- Unit 2_QP AnswersCargado por476
- Tests and Quizzes CNUCargado porPhạmHọc
- Ch2 AssemblerCargado porKeshav Bohra
- Jyotika Pruthi Resume eGovCargado porengineeringwatch
- SIVA.DOCCargado porprakashputtu
- tmp7211.tmpCargado porFrontiers
- Processor & RAM AutoCADCargado poredwin154
- Exercise- Binary Integer ProgrammingCargado porSergio Alexander Gutiérrez
- VSI ManifestoCargado porAlex Muscar
- Modular ProgrammingCargado porrodwellhead
- EE209_1_CppCargado porKahMun Lim
- VCS Commands Ease Coverage Efforts Speed SimulationCargado porcool_cake20
- Sr05220501 Software EngineeringCargado porandhracolleges
- Artificial Intelligence Homework HelpCargado porassignmentpedia
- Chapter 4-Key TermCargado porNatosha Mendoza