Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Newton

100 years of quantum at the APS Global Summit

Published Apr 1, 2025• 0 citations
Publisher
DOI
10.1016/j.newton.2025.100070

Related papers

APS Medal for Exceptional Achievement in Research Talk: Three Seeds in the Flowering of Quantum Science

Daniel Kleppner

Bulletin of the American Physical Society•Jun 6, 2017•0 citations

100 Years of Quantum Science and Technology

Frontiers research topics•Jan 1, 2026•0 citations

Gamifying Quantum Theory

Matthew Leifer

"Over the past few years, the trend of gamification has gradually seeped into quantum research, education and outreach, so that we now have a critical mass of games based on quantum mechanics. I thought the time was right to discuss quantum gamification at the APS March meeting[.]"

•Jan 1, 2017•3 citations

100 Years of Quantum Mysteries

Max Tegmark, JOHN ARCHIBALD WHEELER

arXiv:quant-ph/0101077•Scientific American•Feb 1, 2001•146 citations

Classical Simulation of Quantum Supremacy Circuits

Cupjin Huang, Fang Zhang, Michael Newman +10 more

It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical computer. The task underlying the assertion of quantum supremacy by Arute et al. (Nature, 574, 505--510 (2019)) was initially estimated to require Summit, the world's most powerful supercomputer today, approximately 10,000 years. The same task was performed on the Sycamore quantum processor in only 200 seconds. In this work, we present a tensor network-based classical simulation algorithm. Using a Summit-comparable cluster, we estimate that our simulator can perform this task in less than 20 days. On moderately-sized instances, we reduce the runtime from years to minutes, running several times faster than Sycamore itself. These estimates are based on explicit simulations of parallel subtasks, and leave no room for hidden costs. The simulator's key ingredient is identifying and optimizing the "stem" of the computation: a sequence of pairwise tensor contractions that dominates the computational cost. This orders-of-magnitude reduction in classical simulation time, together with proposals for further significant improvements, indicates that achieving quantum supremacy may require a period of continuing quantum hardware developments without an unequivocal first demonstration.

arXiv:2005.06787•May 14, 2020•203 citations

Celebrations of the international quantum year

Toni Feder

Physics Today•Jan 26, 2026•0 citations
It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical computer. The task underlying the assertion of quantum supremacy by Arute et al. (Nature, 574, 505--510 (2019)) was initially estimated to require Summit, the world's most powerful supercomputer today, approximately 10,000 years. The same task was performed on the Sycamore quantum processor in only 200 seconds. In this work, we present a tensor network-based classical simulation algorithm. Using a Summit-comparable cluster, we estimate that our simulator can perform this task in less than 20 days. On moderately-sized instances, we reduce the runtime from years to minutes, running several times faster than Sycamore itself. These estimates are based on explicit simulations of parallel subtasks, and leave no room for hidden costs. The simulator's key ingredient is identifying and optimizing the "stem" of the computation: a sequence of pairwise tensor contractions that dominates the computational cost. This orders-of-magnitude reduction in classical simulation time, together with proposals for further significant improvements, indicates that achieving quantum supremacy may require a period of continuing quantum hardware developments without an unequivocal first demonstration.