Tight edge-query bounds are proven for learning matchings (deterministic n(n-1)/2, randomized Θ(n^2)) and half graphs (Θ(n log n) classically for column-permuted, Θ(n log n) quantum in general), with half-graph learning reduced to sorting problems.
Quantum lower bounds by quantum arguments
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Complexity of learning matchings and half graphs via edge queries
Tight edge-query bounds are proven for learning matchings (deterministic n(n-1)/2, randomized Θ(n^2)) and half graphs (Θ(n log n) classically for column-permuted, Θ(n log n) quantum in general), with half-graph learning reduced to sorting problems.