Author:
Adcock Mark,Cleve Richard
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. A. Ambainis, M. Mosca, A. Tapp, R. de Wolf, “Private quantum channels”, Proc. 41st Ann. IEEE Symp. on Foundations of Computer Science (FOCS’ 00), pp. 547–553, 2000.
2. M. Bellare, “The Goldreich-Levin Theorem”, Manuscript, 1999. (Available at http://www-cse.ucsd.edu/users/mihir/ .)
3. E. Bernstein and U. V. Vazirani, “Quantum complexity theory”, SIAM J. on Comput., Vol. 26, No. 5, pp. 1411–1473, 1997.
4. M. Blum and S. Micali, “How to generate cryptographically strong sequences of pseudo-random bits”, SIAM J. on Comput., Vol. 13, No. 4, pp. 850–864, 1984.
5. G. Brassard and P. Høyer, “An exact quantum polynomial-time algorithm for Simon’s problem”, Proc. Fifth Israeli Symp. on Theory of Computing and Systems, pp. 12–23, 1997.
Cited by
34 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献