Fetching the paper…
Reading the bibliography…
We present a protocol which allows a client to have a server carry out a quantum computation for her such that the client's inputs, outputs and computation remain perfectly private, and where she does not require any quantum computational power or memory.
R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Commun. ACM , vol. 21, pp. 120–126, 1978
1978
Earlier work this paper cites.
C. Bennett and G. Brassard, “Quantum cryptography: Public-key distribution and coin tossing,” in Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing , 1984, pp. 175–179
1984
Earlier work this paper cites.
J. Feigenbaum, “Encrypting problem instances: Or … can you take advantage of someone without having to trust him?” in Proceedings of Advances in Cryptology—CRYPTO 85 , 1986, pp. 477–488
1986
Earlier work this paper cites.
M. Abadi, J. Feigenbaum, and J. Kilian, “On hiding information from an oracle,” J. Comput. Syst. Sci. , vol. 39, pp. 21–50, 1989
1989
Earlier work this paper cites.
D. Deutsch, “Quantum computational networks,” Proc. R. Soc. A , pp. 425–467, 1989
1989
Earlier work this paper cites.
P. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM J. Comput. , vol. 26, pp. 1484–1509, 1997, first published in 1995
1995
Earlier work this paper cites.
A. Kitaev, “Quantum computations: algorithms and error correction,” Russ. Math. Surv. , vol. 52, pp. 1191–1249, 1997
1997
Earlier work this paper cites.
E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Phys. Rev. A , vol. 55, pp. 900–911, 1997
1997
Earlier work this paper cites.
A. Ambainis, M. Mosca, A. Tapp, and R. Wolf, “Private quantum channels,” in Proceedings of the 41st IEEE Annual Symposium on Foundations of Computer Science (FOCS 2000) , 2000, pp. 547–553
2000
Earlier work this paper cites.
D. Gottesman, “Fault-tolerant quantum computation with local gates,” J. Mod. Opt. , vol. 47, pp. 333–345, 2000
2000
Earlier work this paper cites.
A. Childs, “Secure assisted quantum computation,” Quantum Inform. Comput. , vol. 5, pp. 456–466, 2005, initial version appeared online in 2001
2001
Earlier work this paper cites.
R. Raussendorf and H. Briegel, “A one-way quantum computer,” Phys. Rev. Lett. , vol. 86, pp. 5188–5191, 2001
2001
Cited alongside, same era.
H. Barnum, C. Crépeau, D. Gottesman, A. Smith, and A. Tapp, “Authentication of quantum messages,” in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2002) , 2002, pp. 449–458
2002
Cited alongside, same era.
P. Boykin and V. Roychowdhury, “Optimal encryption of quantum bits,” Phys. Rev. A , vol. 67, 042317 [6 pages], 2003
2003
Cited alongside, same era.
R. Raussendorf, D. Browne, and H. Briegel, “Measurement-based quantum computation with cluster states,” Phys. Rev. A , vol. 68, 022312 [32 pages], 2003
2003
Cited alongside, same era.
M. Hein, J. Eisert, and H. J. Briegel, “Multiparty entanglement in graph states,” Phys. Rev. A , vol. 69, 062311 [20 pages], 2004
2004
P. Arrighi and L. Salvail, “Blind quantum computation,” Int. J. Quantum Inf. , vol. 4, pp. 883–898, 2006
2006
Later among the works it cites.
D. Browne and H. Briegel, “One-way quantum computation,” in Lectures on Quantum Information . Wiley-VCH, Berlin, 2006, pp. 359–380
2006
Later among the works it cites.
V. Danos and E. Kashefi, “Determinism in the one-way model,” Physical Review A , vol. 74, 052310 [6 pages], 2006
2006
Later among the works it cites.
A. Greentree, P. Olivero, M. Draganski, E. Trajkov, J. Rabeau, P. Reichart, B. Gibson, S. Rubanov, S. Huntington, D. Jamieson, and S. Prawer, “Critical components for diamond-based quantum coherent devices,” J. Phys.-Condes. Matter , vol. 18, pp. 825–842, 2006
2006
Later among the works it cites.
R. Raussendorf, J. Harrington, and K. Goyal, “A fault-tolerant one-way quantum computer,” Ann. Phys. , vol. 321, pp. 2242–2270, 2006
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A. Childs, D. Leung, and M. Nielsen, “Unified derivations of measurement-based schemes for quantum computation,” Physical Review A , vol. 71, 032318 [14 pages], 2005
2005
Cited alongside, same era.
R. Jozsa, “An introduction to measurement based quantum computation,” 2005, available as arXiv:quant-ph/0508124v2
2005
Cited alongside, same era.
M. A. Nielsen and C. M. Dawson, “Fault-tolerant quantum computation with cluster states,” Phys. Rev. A , vol. 71, 042323 [26 pages], 2005
2005
Cited alongside, same era.
M. Nielsen, “Cluster-state quantum computation,” Rep. Math. Phys. , vol. 57, pp. 147–161, 2005
2005
Cited alongside, same era.
D. Aharonov, V. Jones, and Z. Landau, “A polynomial quantum algorithm for approximating the Jones polynomial,” in Proceedings of the 38th Annual ACM Symposium on Theory of computing (STOC 2006) , 2006, pp. 427–436
2006
Cited alongside, same era.
P. Aliferis and D. W. Leung, “Simple proof of fault tolerance in the graph-state model,” Phys. Rev. A , vol. 73, 032308 [6 pages], 2006
2006
Cited alongside, same era.
2006
Later among the works it cites.
V. Danos, E. Kashefi, and P. Panangaden, “The measurement calculus,” J. ACM , vol. 54, 8 [45 pages], 2007
2007
Later among the works it cites.
2007
Later among the works it cites.
2008
Closest in time.
S. Goldwasser, Y. Kalai, and G. Rothblum, “Delegating computation: interactive proofs for muggles,” in Proceedings of the 40th annual ACM symposium on Theory of computing , 2008, pp. 113–122
2008
Closest in time.
D. Markham and B. Sanders, “Graph states for quantum secret sharing,” Phys. Rev. A , vol. 78, 042309 [17 pages], 2008
2008
Closest in time.
J. Anders and D. Browne, “Computational power of correlations,” Phys. Rev. Lett. , vol. 102, 050502 [4 pages], 2009
2009
Closest in time.