preprintComputational ComplexityFeb 10, 2026GREEN OA

Tight Quantum Lower Bound for Approximate Counting with Quantum States

ABAleksandrs BelovsARAnsis Rosmanis

University of Latvia · Nagoya University

Indexed inarxivcrossrefdatacite

Abstract

No abstract available for this paper.

Citation impact

6
total citations
FWCI
0.00
Percentile
97%
References
22
Citations per year

Authors

2

Topics & keywords

Topics
Keywords
  • Combinatorics
  • Upper and lower bounds
  • State (computer science)
  • Oracle
  • Type (biology)
  • Mathematics
  • Inverse
  • Quantum algorithm
No related works found for this paper.