#video #study #math #QuantumComputing
Прекрасный подход к объяснениям/обучению:
https://youtu.be/OWJCfOvochA
Прекрасный подход к объяснениям/обучению:
https://youtu.be/OWJCfOvochA
YouTube
Quantum Computing Expert Explains One Concept in 5 Levels of Difficulty | WIRED
WIRED has challenged IBM's Dr. Talia Gershon (Senior Manager, Quantum Research) to explain quantum computing to 5 different people; a child, teen, a college student, a grad student and a professional.
Still haven’t subscribed to WIRED on YouTube? ►► ht…
Still haven’t subscribed to WIRED on YouTube? ►► ht…
#Entanglion #quantum #boardgames #git #math #study #QuantumComputing #IBM
Кооперативная опенсорсная настольная игра, обучающая базовым принципам квантовой механики:
https://entanglion.github.io/ (from @qbfox)
Кооперативная опенсорсная настольная игра, обучающая базовым принципам квантовой механики:
https://entanglion.github.io/ (from @qbfox)
#QuantumComputing
Peter Shor didn’t set out to break the internet. But an algorithm he developed in the mid-1990s threatened to do just that. In a landmark paper, Shor showed how a hypothetical computer that exploited the quirks of quantum physics could break large numbers into their prime factors far faster than any ordinary classical machine.
The result had implications far beyond mathematics. At the time, a vital component of internet security called public-key cryptography relied on the assumption that factoring large numbers is so computationally difficult as to be effectively impossible. That assumption still underpins some critical protocols today. Shor’s algorithm showed that it would fail spectacularly in a world with powerful quantum computers:
https://www.quantamagazine.org/thirty-years-later-a-speed-boost-for-quantum-factoring-20231017
Peter Shor didn’t set out to break the internet. But an algorithm he developed in the mid-1990s threatened to do just that. In a landmark paper, Shor showed how a hypothetical computer that exploited the quirks of quantum physics could break large numbers into their prime factors far faster than any ordinary classical machine.
The result had implications far beyond mathematics. At the time, a vital component of internet security called public-key cryptography relied on the assumption that factoring large numbers is so computationally difficult as to be effectively impossible. That assumption still underpins some critical protocols today. Shor’s algorithm showed that it would fail spectacularly in a world with powerful quantum computers:
https://www.quantamagazine.org/thirty-years-later-a-speed-boost-for-quantum-factoring-20231017
Quanta Magazine
Thirty Years Later, a Speed Boost for Quantum Factoring | Quanta Magazine
Shor’s algorithm will enable future quantum computers to factor large numbers quickly, undermining many online security protocols. Now a researcher has shown how to do it even faster.