Fetching the paper…
Reading the bibliography…
We consider a new model for the testing of untrusted quantum devices, consisting of a single polynomial-time bounded quantum device interacting with a classical polynomial-time verifier.
An extremal problem in probability theory
Yu V Prokhorov · 1959
Earlier work this paper cites.
A ”paradoxical’”solution to the signature problem (abstract)
Shafi Goldwasser, Silvio Micali, and Ronald L. Rivest · 1984
Earlier work this paper cites.
A hierarchy of polynomial time lattice basis reduction algorithms
Claus-Peter Schnorr · 1987
Earlier work this paper cites.
Generalized entropic uncertainty relations
Hans Maassen and Jos BM Uffink · 1988
Earlier work this paper cites.
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
Claus-Peter Schnorr and M. Euchner · 1994
Earlier work this paper cites.
Creating superpositions that correspond to efficiently integrable probability distributions
Lov Grover and Terry Rudolph · 2002
Earlier work this paper cites.
Quantum And Relativistic Protocols For Secure Multi-Party Computation
R. Colbeck · 2006
Earlier work this paper cites.
Interactive Proofs For Quantum Computations
Dorit Aharonov, Micahel Ben-Or, and Elad Eban · 2008
Earlier work this paper cites.
Universal blind quantum computation
Anne Broadbent, Joseph F. Fitzsimons, and Elham Kashefi · 2008
Earlier work this paper cites.
Public-key cryptosystems from the worst-case shortest vector problem
Chris Peikert · 2009
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2009
Earlier work this paper cites.
A fully quantum asymptotic equipartition property
Marco Tomamichel, Roger Colbeck, and Renato Renner · 2009
Earlier work this paper cites.
Robustness of the learning with errors assumption
Shafi Goldwasser, Yael Tauman Kalai, Chris Peikert, and Vinod Vaikuntanathan · 2010
Earlier work this paper cites.
Random numbers certified by Bell’s theorem
S. Pironio, A. Acin, S. Massar, A. Boyer De La Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and et al · 2010
Earlier work this paper cites.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Earlier work this paper cites.
BKZ 2.0: Better lattice security estimates
Yuanmi Chen and Phong Q. Nguyen · 2011
Cited alongside, same era.
Better key sizes (and attacks) for lwe-based encryption
Richard Lindner and Chris Peikert · 2011
Cited alongside, same era.
Certifiable quantum dice: or, true random number generation secure against quantum adversaries
Umesh Vazirani and Thomas Vidick · 2011
Cited alongside, same era.
Hoeffding’s inequality for supermartingales
Xiequan Fan, Ion Grama, and Quansheng Liu · 2012
Cited alongside, same era.
Trapdoors for lattices: Simpler, tighter, faster, smaller
Daniele Micciancio and Chris Peikert · 2012
Cited alongside, same era.
Interactive Proofs for Quantum Computations
Dorit Aharonov, Michael Ben-Or, Elad Eban, and Urmila Mahadev · 2017
Later among the works it cites.
Complexity-theoretic foundations of quantum supremacy experiments
Scott Aaronson and Lijie Chen · 2017
Later among the works it cites.
Unconditionally verifiable blind quantum computation
Joseph F. Fitzsimons and Elham Kashefi · 2017
Later among the works it cites.
Quantum computational supremacy
Aram W Harrow and Ashley Montanaro · 2017
Later among the works it cites.
Classical homomorphic encryption for quantum circuits
Urmila Mahadev · 2017
Later among the works it cites.
Universal security for randomness expansion from the spot-checking protocol
Carl A Miller and Yaoyun Shi · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
B. Reichardt, F. Unger, and U. Vazirani · 2012
Cited alongside, same era.
Learning with rounding, revisited
Joël Alwen, Stephan Krenn, Krzysztof Pietrzak, and Daniel Wichs · 2013
Cited alongside, same era.
Classical hardness of learning with errors
Zvika Brakerski, Adeline Langlois, Chris Peikert, Oded Regev, and Damien Stehlé · 2013
Cited alongside, same era.
Homomorphic encryption from learning with errors: Conceptually-simpler, asymptotically-faster, attribute-based
Craig Gentry, Amit Sahai, and Brent Waters · 2013
Cited alongside, same era.
Quantum Information Theory
Mark M. Wilde · 2013
Cited alongside, same era.
Universal security for randomness expansion from the spot-checking protocol
Carl A Miller and Yaoyun Shi · 2014
Cited alongside, same era.
Fully device-independent quantum key distribution
Umesh Vazirani and Thomas Vidick · 2014
Cited alongside, same era.
Later among the works it cites.
Pseudorandomness of ring-LWE for any ring and modulus
Chris Peikert, Oded Regev, and Noah Stephens-Davidowitz · 2017
Later among the works it cites.
Practical device-independent quantum cryptography via entropy accumulation
Rotem Arnon-Friedman, Frédéric Dupuis, Omar Fawzi, Renato Renner, and Thomas Vidick · 2018
Closest in time.
Experimentally generated randomness certified by the impossibility of superluminal signals
Peter Bierhorst, Emanuel Knill, Scott Glancy, Yanbao Zhang, Alan Mink, Stephen Jordan, Andrea Rommal, Yi-Kai Liu, Bradley Christensen, Sae Woo Nam, et al · 2018
Closest in time.
Delegated pseudo-secret random qubit generator
Alexandru Cojocaru, Léo Colisson, Elham Kashefi, and Petros Wallden · 2018
Closest in time.
Classical verification of quantum computations
Urmila Mahadev · 2018
Closest in time.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando Brandao, David Buell, Brian Burkett, Yu Chen, Zijun Chen, Ben Chiaro, Roberto Collins, William Courtney, Andrew Dunsworth, Edward Farhi, Brooks Foxen, and John Martinis · 2019
Closest in time.
On the complexity and verification of quantum random circuit sampling
Adam Bouland, Bill Fefferman, Chinmay Nirkhe, and Umesh Vazirani · 2019
Closest in time.
Qfactory: classically-instructed remote secret qubits preparation
Alexandru Cojocaru, Léo Colisson, Elham Kashefi, and Petros Wallden · 2019
Closest in time.
Computationally-secure and composable remote state preparation
Alexandru Gheorghiu and Thomas Vidick · 2019
Closest in time.