Fetching the paper…
Reading the bibliography…
In a recent breakthrough, Mahadev constructed a classical verification of quantum computation (CVQC) protocol for a classical client to delegate decision problems in BQP to an untrusted quantum prover under computational assumptions.
Algorithms for quantum computation: discrete logarithms and factoring
P. W. Shor · 1994
Earlier work this paper cites.
Does parallel repetition lower the error in computationally sound protocols?
Mihir Bellare, Russell Impagliazzo, and Moni Naor · 1997
Earlier work this paper cites.
Secure multi-party quantum computation
Claude Crépeau, Daniel Gottesman, and Adam Smith · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A.Y. Kitaev, A. Shen, and M.N. Vyalyi · 2002
Earlier work this paper cites.
A simple proof that toffoli and hadamard are quantum universal, 2003
Dorit Aharonov · 2003
Earlier work this paper cites.
Both toffoli and controlled-not need little help to do universal quantum computing
Yaoyun Shi · 2003
Earlier work this paper cites.
Quantum arthur–merlin games
Chris Marriott and John Watrous · 2005
Earlier work this paper cites.
The complexity of the local hamiltonian problem
Julia Kempe, Alexei Kitaev, and Oded Regev · 2006
Earlier work this paper cites.
Adiabatic quantum computation is equivalent to standard quantum computation
Dorit Aharonov, Wim Van Dam, Julia Kempe, Zeph Landau, Seth Lloyd, and Oded Regev · 2008
Earlier work this paper cites.
Realizable hamiltonians for universal adiabatic quantum computers
Jacob D. Biamonte and Peter J. Love · 2008
Earlier work this paper cites.
Universal blind quantum computation
A. Broadbent, J. Fitzsimons, and E. Kashefi · 2009
Earlier work this paper cites.
On lattices, learning with errors, random linear codes, and cryptography
Oded Regev · 2009
Earlier work this paper cites.
Temporally unstructured quantum computation
Dan Shepherd and Michael J. Bremner · 2009
Earlier work this paper cites.
The computational complexity of linear optics
Scott Aaronson and Alex Arkhipov · 2011
Cited alongside, same era.
Efficient Parallel Repetition Theorems with Applications to Security Amplification
Kai-Min Chung · 2011
Cited alongside, same era.
Actively secure two-party evaluation of any quantum operation
Frédéric Dupuis, Jesper Buus Nielsen, and Louis Salvail · 2012
Cited alongside, same era.
Parallel repetition of computationally sound protocols revisited
Krzysztof Pietrzak and Douglas Wikström · 2012
Cited alongside, same era.
The equivalence of sampling and searching
Scott Aaronson · 2013
Cited alongside, same era.
Classical command of quantum systems
Ben W Reichardt, Falk Unger, and Umesh Vazirani · 2013
Cited alongside, same era.
Quantum de finetti theorems under local measurements with applications
Fernando G. S. L. Brandão and Aram W. Harrow · 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 fhe (almost) as secure as classical
Zvika Brakerski · 2018
Later among the works it cites.
Post hoc verification of quantum computation
Joseph F. Fitzsimons, Michal Hajdušek, and Tomoyuki Morimae · 2018
Later among the works it cites.
Classical homomorphic encryption for quantum circuits
Urmila Mahadev · 2018
Later among the works it cites.
Classical verification of quantum computations
Urmila Mahadev · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Outsourcing private RAM computation
Craig Gentry, Shai Halevi, Mariana Raykova, and Daniel Wichs · 2014
Cited alongside, same era.
Robustness and device independence of verifiable blind quantum computing
Alexandru Gheorghiu, Elham Kashefi, and Petros Wallden · 2015
Cited alongside, same era.
Device-Independent Verifiable Blind Quantum Computation
Michal Hajdušek, Carlos A. Pérez-Delgado, and Joseph F. Fitzsimons · 2015
Cited alongside, same era.
Verifiable measurement-only blind quantum computing with stabilizer testing
Masahito Hayashi and Tomoyuki Morimae · 2015
Cited alongside, same era.
Quantum proofs can be verified using only single-qubit measurements
Tomoyuki Morimae, Daniel Nagaj, and Norbert Schuch · 2016
Cited alongside, same era.
Interactive proofs for quantum computations
Dorit Aharonov, Michael Ben-Or, Elad Eban, and Urmila Mahadev · 2017
Cited alongside, same era.
Verification of many-qubit states
Yuki Takeuchi and Tomoyuki Morimae · 2018
Later among the works it cites.
Quantum supremacy using a programmable superconducting processor
Frank Arute, Kunal Arya, Ryan Babbush, et al., and John M. Martinis · 2019
Later among the works it cites.
Verifier-on-a-leash: New schemes for verifiable delegated quantum computation, with quasilinear resources
Andrea Coladangelo, Alex B. Grilo, Stacey Jeffery, and Thomas Vidick · 2019
Later among the works it cites.
Computationally-secure and composable remote state preparation
Alexandru Gheorghiu and Thomas Vidick · 2019
Later among the works it cites.
Non-interactive classical verification of quantum computation
Gorjan Alagic, Andrew M Childs, Alex B Grilo, and Shih-Han Hung · 2020
Closest in time.
Classical verification of quantum computations with efficient verifier
Nai-Hui Chia, Kai-Min Chung, and Takashi Yamakawa · 2020
Closest in time.
Secure quantum computation with classical communication
James Bartusek · 2021
Closest in time.