Abstract
In the framework of this work, we consider the problem of finding the largest square in a 0-1 matrix consisting of ones. The task is considered with point of view of quantum algorithms. For the problem of finding a square of the largest size on a two-dimensional map, there is a quantum algorithm with running time O(n<sup>1.5</sup>log n) and error probability at most 0.1. At the same time, any classical algorithm (probabilistic or deterministic) has a lower bound on the running time Omega(n<sup>2</sup>).
Publisher
Keldysh Institute of Applied Mathematics
Reference10 articles.
1. Ablayev F., Ablayev M., Huang J.Z., Khadiev K., Salikhova N., Wu D. On quantum methods for machine learning problems part I: Quantum tools // Big Data Mining and Analytics. 2019. Vol. 3, No. 1. P.41–55.
2. Bennett C. H. et al. Strengths and weaknesses of quantum computing // SIAM journal on Computing. 1997. Vol. 26, No. 5. P. 1510–1523.
3. Kothari R. An optimal quantum algorithm for the oracle identification problem // 31st International Symposium on Theoretical Aspects of Computer Science. 2014. P. 482.
4. Durr, C., Heiligman, M., Hoyer, P., Mhalla, M. Quantum query complexity of some graph problems // SIAM Journal on Computing. 2006. Vol. 35, No. 6. P. 1310–1328.
5. Kapralov, R., Khadiev, K., Mokut, J., Shen, Y., Yagafarov, M. Fast Classical and Quantum Algorithms for Online k-server Problem on Trees // CEUR Workshop Proceedings. 2020. 3072. P. 287–301.