Fetching the paper…
Reading the bibliography…
As progress on experimental quantum processors continues to advance, the problem of verifying the correct operation of such devices is becoming a pressing concern.
W. Hoeffding, “Probability inequalities for sums of bounded random variables,” J. Am. Stat. Assoc. 58
1963
Earlier work this paper cites.
K. Azuma, “Weighted sums of certain dependent random variables,” Tohoku Mathematical Journal, Second Series 19
1967
Earlier work this paper cites.
J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt, “Proposed experiment to test local hidden-variable theories,” Phys. Rev. Lett. 23
1969
Earlier work this paper cites.
P. W. Shor, “Algorithms for quantum computation: Discrete logarithms and factoring,” in Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on (IEEE, 1994) pp. 124–134
1994
Earlier work this paper cites.
D. Mayers and A. Yao, “Quantum cryptography with imperfect apparatus,” in Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on (IEEE, 1998) pp. 503–509
1998
Earlier work this paper cites.
D. Mayers and A. Yao, “Self testing quantum apparatus,” Quantum Inf. Comput. 4
2004
Earlier work this paper cites.
A. Broadbent, J. F. Fitzsimons, and E. Kashefi, “Universal blind quantum computation,” in Foundations of Computer Science, 2009. FOCS’09. 50th Annual IEEE Symposium on (IEEE, 2009) pp. 517–526
2009
Earlier work this paper cites.
S. Aaronson, “BQP and the polynomial hierarchy,” in Proceedings of the forty-second ACM symposium on Theory of computing (ACM, 2010) pp. 141–150
2010
Earlier work this paper cites.
D. Aharonov, M. Ben-Or, and E. Eban, “Interactive Proofs For Quantum Computations,” in Proceedings of Innovation in Computer Science (Tsinghua University Press, 2010) p. 543
2010
Earlier work this paper cites.
S. Pironio, A. Acín, S. Massar, A. Boyer de La Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and C. Monroe, “Random numbers certified by Bell’s theorem,” Nature (London) 464
2010
Cited alongside, same era.
M. McKague and M. Mosca, “Generalized self-testing and the security of the 6-state protocol,” in Theory of Quantum Computation, Communication, and Cryptography (Springer, 2011) pp. 113–130
2011
Cited alongside, same era.
J. F. Fitzsimons and E. Kashefi, “Unconditionally verifiable blind computation,” (2012), arXiv:quant-ph/1203.5217
2012
Cited alongside, same era.
S. Barz, E. Kashefi, A. Broadbent, J. F. Fitzsimons, A. Zeilinger, and P. Walther, “Demonstration of blind quantum computing,” Science 335
2012
Cited alongside, same era.
M. McKague, T. H. Yang, and V. Scarani, “Robust self-testing of the singlet,” J. Phys. A: Math. Theor. 45
A. Mantri, C. A. Pérez-Delgado, and J. F. Fitzsimons, “Optimal blind quantum computation,” Phys. Rev. Lett. 111
2013
Later among the works it cites.
T. P. Harty, D. T. C. Allcock, C. J. Ballance, L. Guidoni, H. A. Janacek, N. M. Linke, D. N. Stacey, and D. M. Lucas, “High-Fidelity Preparation, Gates, Memory, and Readout of a Trapped-Ion Quantum Bit,” Phys. Rev. Lett. 113
2014
Later among the works it cites.
C. J. Ballance, T. P. Harty, N. M. Linke, and D. M. Lucas, “High-fidelity two-qubit quantum logic gates using trapped calcium-43 ions,” (2014), arXiv:quant-ph/1406.5473
2014
Later among the works it cites.
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O’Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and J. M. Martinis, “Superconducting quantum circuits at the surface code threshold for fault tolerance,” Nature (London) 508
2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2012
Cited alongside, same era.
S. Barz, J. F. Fitzsimons, E. Kashefi, and P. Walther, “Experimental verification of quantum computation,” Nature Physics 9
2013
Cited alongside, same era.
B. W. Reichardt, F. Unger, and U. Vazirani, “Classical command of quantum systems,” Nature (London) 496
2013
Cited alongside, same era.
M. McKague, “Interactive proofs for BQP via self-tested graph states,” (2013), arXiv:quant-ph/1309.5675
2013
Cited alongside, same era.
T. Morimae and K. Fujii, “Secure entanglement distillation for double-server blind quantum computation,” Phys. Rev. Lett. 111
Cited in the paper.
T. Morimae and K. Fujii, “Blind quantum computation protocol in which alice only makes measurements,” Phys. Rev. A 87
Cited in the paper.
Later among the works it cites.
V. Dunjko, J. F. Fitzsimons, C. Portmann, and R. Renner, “Composable security of delegated quantum computation,” in Advances in Cryptology–ASIACRYPT 2014 (Springer, 2014) pp. 406–425
2014
Later among the works it cites.
T. Morimae, “Verification for measurement-only blind quantum computing,” Phys. Rev. A 89
2014
Later among the works it cites.
Y.-B. Sheng and L. Zhou, “Deterministic entanglement distillation for secure double-server blind quantum computation,” Sci. Rep. 5
2015
Closest in time.
A. Gheorghiu, E. Kashefi, and P. Wallden, “Robustness and device independence of verifiable blind quantum computing,” New J. Phys. 17
2015
Closest in time.