Reference · 2026
Fast quantum algorithms for learning linear threshold functions
Krivcenko, A., Nguyen, T., & de Wolf, R. (2026). Fast quantum algorithms for learning linear threshold functions. arXiv:2609.40331.
- Authors
- Aleksandrs Krivcenko; Tuyen Nguyen; Ronald de Wolf
- Venue
- arXiv:2609.40331
Cited from the 19 Oct 2026 digest for Theorems 3.4 and 3.5, the Boolean bound in Theorem 4.1, and the example-oracle bound in Theorem 5.8. Version 2, dated 5 Oct 2026, is the text the digest follows. The logarithmic bound counts membership queries. The other gates in Theorem 3.4 are linear in the dimension.
Cited by
Updated 19 Oct 2026.