Author:
Xu Guoliang,Qiu Daowen,Zhang Binbin,Wang Tianyin,Zhang Yongxin
Funder
the National Natural Science Foundation of China
the Natural Science Foundation of Henan Province
the Key Scientific Research Project of Higher Education of Henan Province
the Research and practice project of school-level higher education teaching reform
the Natural Science Foundation of GuangDong Province of China
Science and Technology Project of Henan Province
the Science and Technology Innovation Team of Henan University
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Buhrman, H., De Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288, 21–43 (2002)
2. Aaronson, S.: Open problems related to quantum query complexity. (2021). arxiv preprint arXiv:2109.06917
3. Nielson, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)
4. Montanaro, A., Nishimura, H., Raymond, R.: Unbounded error quantum query complexity. Theor. Comput. Sci. 412, 35 (2011)
5. Simon, D.R.: On the power of quantum computation. In: Proceedings 35th Annual Symposium on Foundations of Computer Science, Santa Fe, New Mexico, USA, pp. 116–123 (1994)