- #1
Major Quantum Computing Advance Made Obsolete by UT Grad
- Thread starter jedishrfu
- Start date
Click For Summary
Discussion Overview
The discussion centers around a significant achievement in quantum computing by Ewin Tang, who demonstrated that classical computers could solve a problem previously thought to require quantum computing. The conversation explores the implications of this finding, the evolving nature of quantum computing research, and the reactions to Tang's work.
Discussion Character
- Exploratory
- Debate/contested
- Technical explanation
Main Points Raised
- Some participants highlight Ewin Tang's achievement in disproving a widely held assumption about quantum computing capabilities.
- Others express admiration for Tang's work and share links to both the original article and his full paper.
- A participant notes the rapid changes in the narrative surrounding quantum computing, referencing contrasting articles from Quanta Magazine.
- There is mention of a specific problem, the Raz and Tal problem, and its relation to Tang's results, with some uncertainty about whether it is "Ewin-proof."
- One participant shares their personal experience of learning about quantum computing and leading a seminar on the topic, indicating a connection to the ongoing discourse.
Areas of Agreement / Disagreement
Participants express a mix of agreement on the significance of Tang's work while also noting that there are competing views regarding the implications for quantum computing. The discussion remains unresolved regarding the status of the Raz and Tal problem in relation to Tang's findings.
Contextual Notes
There are references to multiple articles that present differing perspectives on the capabilities of quantum versus classical computing, indicating a dynamic and evolving understanding of the field. The discussion also reflects ongoing uncertainties about specific problems in quantum computing.
Who May Find This Useful
Readers interested in quantum computing advancements, the implications of classical computing capabilities, and the evolving narrative in STEM research may find this discussion relevant.
- #2
- 11,326
- 8,755
Wow, what an inspirational story. Thanks for sharing.
I liked the longer version of the article https://www.quantamagazine.org/teen...to-quantum-recommendation-algorithm-20180731/
Here is the full paper by this remarkable young man https://arxiv.org/abs/1807.04271
I liked the longer version of the article https://www.quantamagazine.org/teen...to-quantum-recommendation-algorithm-20180731/
Here is the full paper by this remarkable young man https://arxiv.org/abs/1807.04271
- #3
- 15,681
- 10,475
I didn’t post the quant mag story because this morning it wouldn’t come up and I thought maybe it got retracted but the UT version was there so I used it. Go Longhorns.
- #4
George Jones
Staff Emeritus
Science Advisor
Gold Member
- 7,643
- 1,602
anorlunda said:
How quickly things change!
I get Quanta Magazine sent to my inbox. The title of the above Quanta Magazine article is "Major Quantum Computing Advance Made Obsolete by Teenager". I remember seeing a Quanta Magazine article (link in above article) six weeks ago titled "Finally, a Problem That Only Quantum Computers Will Ever Be Able to Solve", which was about the "Major Quantum Computing Advance" part of the previous title!
https://www.quantamagazine.org/fina...omputers-will-ever-be-able-to-solve-20180621/
This is all quite fascinating for me, as I currently am being forced to learn some elementary quantum computing. After some (good-natured) arm-twisting, I agreed to lead a seminar course on quantum computing. At 4:30 PDT today, we will cover some stuff from chapter 5 of
https://www.amazon.com/dp/019857049X/?tag=pfamazon01-20
Excuse me, as I have some reading to do.
- #5
atyy
Science Advisor
- 15,170
- 3,378
George Jones said:
On a quick read, the Raz and Tal problem is not the "major quantum computing advance" made obsolete.
Scott Aronson blogged about Ewin Tang's result: https://www.scottaaronson.com/blog/?p=3880. At the end of the post he mentions that it remains open whether his Forrelation problem, addressed by Raz and Tal, is Ewin-proof.