Fetching the paper…
Reading the bibliography…
A proof of quantumness is a method for provably demonstrating (to a classical verifier) that a quantum device can perform computational tasks that a classical device with comparable resources cannot.
A “paradoxical” solution to the signature problem
Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest · 1985
Earlier work this paper cites.
How to prove yourself: Practical solutions to identification and signature problems
Amos Fiat and Adi Shamir · 1986
Earlier work this paper cites.
Algorithms for quantum computation: Discrete logarithms and factoring
Peter W. Shor · 1994
Earlier work this paper cites.
The random oracle methodology, revisited
Ran Canetti, Oded Goldreich, and Shai Halevi · 2004
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2005
Earlier work this paper cites.
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Michael J Bremner, Richard Jozsa, and Dan J Shepherd · 2010
Cited alongside, same era.
On ideal lattices and learning with errors over rings
Vadim Lyubashevsky, Chris Peikert, and Oded Regev · 2010
Cited alongside, same era.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Trapdoors for lattices: Simpler, tighter, faster, smaller
Daniele Micciancio and Chris Peikert · 2012
Cited alongside, same era.
A toolkit for ring-lwe cryptography
Vadim Lyubashevsky, Chris Peikert, and Oded Regev · 2013
Cited alongside, same era.
Candidate quantum-resistant cryptographic algorithms publicly available
NIST
Cited in the paper.
A cryptographic test of quantumness and certifiable randomness from a single quantum device
Zvika Brakerski, Paul Christiano, Urmila Mahadev, Umesh V. Vazirani, and Thomas Vidick · 2018
Later among the works it cites.
Classical verification of quantum computations
Urmila Mahadev · 2018
Later among the works it cites.
Non-interactive classical verification of quantum computation, 2019
Gorjan Alagic, Andrew M. Childs, Alex B. Grilo, and Shih-Han Hung · 2019
Later among the works it cites.
Classical verification of quantum computations with efficient verifier
Nai-Hui Chia, Kai-Min Chung, and Takashi Yamakawa · 2019
Later among the works it cites.
How to factor 2048 bit rsa integers in 8 hours using 20 million noisy qubits
Craig Gidney and Martin Ekerå · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…