Sharp quantum query bounds for controlled noisy evolution, governed by entropy-decrease capacity, with channel stability proofs and matching two-qubit constructions.
-
Updated
Oct 24, 2026 - Python
Sharp quantum query bounds for controlled noisy evolution, governed by entropy-decrease capacity, with channel stability proofs and matching two-qubit constructions.
Reconstructing source-weighted quantum energy distributions from independent state copies, with multilevel phase estimation and dimension-sensitive bounds on Hamiltonian access.
Optimal quantum search under flagged renewal dephasing: a truncated-moment law and different search exponents for clocks with equal mean and leading tail.
Exact rational certificates settling nine open cases of the Ambainis-Iraids-Nagaj EXACT_{k,l}^n conjecture (exact quantum query complexity)
Matching forward–inverse quantum query tradeoffs for known-state discrimination, with a dimension-dependent forward-only algorithm.
Optimal forward-only discrimination of promised quantum transitions using symmetric controls, with near-identity unitary bounds, fixed-step Hamiltonian guarantees, and explicit resource costs.
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.
Provisional asymptotic and finite-size hard-dose lower-bound proof packages for fourfold forrelation, with reproducibility checks.
Optimal query bounds for mean estimation from fresh quantum samplers under a local replay limit, with exact-inverse algorithms and adaptive lower bounds.
To associate your repository with the quantum-query-complexity topic, visit your repo's landing page and select "manage topics."