EUVIMEDEUVIMED entdecken
Crossref

Quantum Algorithms for Hopcroft's problem

Vladimirs Andrejevs, Aleksandrs Belovs, Jevgēnijs Vihrovs

ACM Transactions on Quantum Computing · 30.06.2026 · 7 (2) · 1-22

DOI: 10.1145/3787461 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM Transactions on Quantum Computing, online erschienen am 10.02.2026. Verfasst von Vladimirs Andrejevs und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 53 Literaturangaben. Gefördert von: Latvian Quantum Initiative under European Union Recovery and Resilience Facility.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In this work, we study quantum algorithms for Hopcroft’s problem which is a fundamental problem in computational geometry. Given n points and n lines in the plane, the task is to determine whether there is a point-line incidence. The classical complexity of this problem is well-studied, with the best known algorithm running in \(O(n^{4/3})\) time, with matching lower bounds in some restricted settings. Our results are two different quantum algorithms with time complexity \(\widetilde{O}(n^{5/6})\) . The first algorithm is based on partition trees and the quantum backtracking algorithm. The second algorithm uses a quantum walk together with a history-independent dynamic data structure for storing line arrangement which supports efficient point location queries. In the setting where the number of points and lines differ, the quantum walk-based algorithm is asymptotically faster. The quantum speedups for the aforementioned data structures may be useful for other geometric problems. Finally, we examine the connections between Hopcroft’s problem and other computational problems via fine-grained complexity. For example, we show a conditional \(\Omega (n^{3/4})\) time lower bound on Hopcroft’s problem in 5 dimensions based on the quantum analogue of a classical hardness conjecture, which is stronger than the (optimal) \(\Theta (n^{2/3})\) query complexity bounds.

Förderung

  • Latvian Quantum Initiative under European Union Recovery and Resilience Facility

Zitieren

APA

Andrejevs, V., Belovs, A., & Vihrovs, J. (2026). Quantum Algorithms for Hopcroft's problem. ACM Transactions on Quantum Computing, 7(2), 1-22. https://doi.org/10.1145/3787461

Vancouver

Andrejevs V, Belovs A, Vihrovs J. Quantum Algorithms for Hopcroft's problem. ACM Transactions on Quantum Computing. 2026;7(2):1-22. doi:10.1145/3787461

BibTeX
@article{Andrejevs2026,
  author = {Andrejevs, Vladimirs and Belovs, Aleksandrs and Vihrovs, Jevgēnijs},
  title = {Quantum Algorithms for Hopcroft's problem},
  journal = {ACM Transactions on Quantum Computing},
  year = {2026},
  volume = {7},
  number = {2},
  pages = {1--22},
  doi = {10.1145/3787461}
}
Kostenlos starten →