quantum-query-complexity

Exact query thresholds for global Kerr phase estimation: three uses with a known linear phase, four with a common unknown phase. Fixed-duration forward access, arithmetic strong converses, and explicit protocols.

Matching forward–inverse quantum query tradeoffs for known-state discrimination, with a dimension-dependent forward-only algorithm.

Sharp quantum query bounds for controlled noisy evolution, governed by entropy-decrease capacity, with channel stability proofs and matching two-qubit constructions.

Exact rational certificates settling nine open cases of the Ambainis-Iraids-Nagaj EXACT_{k,l}^n conjecture (exact quantum query complexity)

Optimal forward-only discrimination of promised quantum transitions using symmetric controls, with near-identity unitary bounds, fixed-step Hamiltonian guarantees, and explicit resource costs.

Provisional asymptotic and finite-size hard-dose lower-bound proof packages for fourfold forrelation, with reproducibility checks.