Author:
Iwama Kazuo,Nishimura Harumichi,Raymond Rudy,Teruyama Junichi
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Quantum lower bounds by quantum arguments;Ambainis;J. Comput. Syst. Sci.,2002
2. Polynomial degree vs. quantum query complexity;Ambainis;J. Comput. Syst. Sci.,2006
3. A. Ambainis, L. Magnin, M. Roetteler, J. Roland, Symmetry-assisted adversaries for quantum state generation, in: Proc. 26th CCC, 2011, pp. 167–177.
4. H. Barnum, M.E. Saks, M. Szegedy, Quantum query complexity and semi-definite programming, in: Proc. 18th CCC, 2003, pp. 179–193.
5. Quantum complexity theory;Bernstein;SIAM J. Comput.,1997
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献