What Have Google’s Random Quantum Circuit Simulation Experiments Demonstrated about Quantum Supremacy?
In Hamid R. Arabnia, Leonidas Deligiannidis, Fernando G. Tinetti & Quoc-Nam Tran (eds.), Advances in Software Engineering, Education, and e-Learning. Cham, Switzerland: Springer Nature (forthcoming)
Abstract
Quantum computing is of high interest because it promises to perform at least some kinds of
computations much faster than classical computers. Arute et al. 2019 (informally, “the Google
Quantum Team”) report the results of experiments that purport to demonstrate “quantum
supremacy” – the claim that the performance of some quantum computers is better than that of
classical computers on some problems. Do these results close the debate over quantum
supremacy? We argue that they do not. In the following, we provide an overview of the Google
Quantum Team’s experiments, then identify some open questions in the quest to demonstrate
quantum supremacy.
Categories
(categorize this paper)
PhilPapers/Archive ID
HORWHG-2
Upload history
Archival date: 2020-09-11
View other versions
View other versions
Added to PP index
2020-09-11
Total views
113 ( #48,554 of 70,019 )
Recent downloads (6 months)
38 ( #22,563 of 70,019 )
2020-09-11
Total views
113 ( #48,554 of 70,019 )
Recent downloads (6 months)
38 ( #22,563 of 70,019 )
How can I increase my downloads?
Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.