Robust Quantum Algorithms for Oracle Identification (計算機科学基礎理論とその応用 研究集会報告集)
暂无分享,去创建一个
[1] Ronald de Wolf,et al. Quantum Search on Bounded-Error Inputs , 2003, ICALP.
[2] Ronald de Wolf,et al. Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[3] Frédéric Magniez,et al. Quantum algorithms for the triangle problem , 2005, SODA '05.
[4] Andris Ambainis,et al. Quantum search of spatial regions , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..
[5] Umesh V. Vazirani,et al. Quantum Complexity Theory , 1997, SIAM J. Comput..
[6] Dana Ron,et al. Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[7] Markus Grassl,et al. Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution , 1998, QCQC.
[8] Lov K. Grover. Rapid sampling through quantum computing , 1999 .
[9] Andris Ambainis,et al. Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.
[10] Gérard D. Cohen,et al. Covering Codes , 2005, North-Holland mathematical library.
[11] Eli Upfal,et al. Computing with Noisy Information , 1994, SIAM J. Comput..
[12] Gilles Brassard,et al. Tight bounds on quantum searching , 1996, quant-ph/9605034.
[13] Jin-Soo Kim,et al. Quantum Database Search by a Single Query , 1998, QCQC.
[14] Frédéric Magniez,et al. Quantum algorithms for element distinctness , 2000, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[15] Lov K. Grover. A fast quantum mechanical algorithm for database search , 1996, STOC '96.
[16] Dong Pyo Chi,et al. Quantum Database Searching by a Single Query , 1997 .
[17] M. Sipser,et al. Bound on the number of functions that can be distinguished with k quantum queries , 1999 .
[18] Mehdi Mhalla,et al. Quantum Query Complexity of Some Graph Problems , 2004, SIAM J. Comput..
[19] Rocco A. Servedio,et al. Quantum versus classical learnability , 2000, Proceedings 16th Annual IEEE Conference on Computational Complexity.
[20] Bernard Chazelle,et al. Sublinear Geometric Algorithms , 2005, SIAM J. Comput..
[21] Rocco A. Servedio,et al. Improved Bounds on Quantum Learning Algorithms , 2004, Quantum Inf. Process..
[22] Lov K. Grover. A framework for fast quantum mechanical algorithms , 1997, STOC '98.
[23] Ronald de Wolf,et al. Robust Quantum Algorithms and Polynomials , 2003, ArXiv.
[24] Ori Sasson,et al. Property testing of data dimensionality , 2003, SODA '03.
[25] Andris Ambainis,et al. Quantum Identification of Boolean Oracles , 2004, STACS.
[26] Richard Cleve,et al. A Quantum Goldreich-Levin Theorem with Cryptographic Applications , 2002, STACS.
[27] G. Brassard,et al. Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.
[28] Yaoyun Shi,et al. Quantum lower bounds for the collision and the element distinctness problems , 2001, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..