Optimal query bounds for mean estimation from fresh quantum samplers under a local replay limit, with exact-inverse algorithms and adaptive lower bounds.
-
Updated
Nov 2, 2026 - Python
Optimal query bounds for mean estimation from fresh quantum samplers under a local replay limit, with exact-inverse algorithms and adaptive lower bounds.
Matching forward–inverse quantum query tradeoffs for known-state discrimination, with a dimension-dependent forward-only algorithm.
Coherent Hadamard powers of unknown quantum states via collision extraction and spectral filtering, with optimal query scaling for the square.
Exact first-return compilation and tight query bounds for finding previous checkpoints in unknown permutations with forward-only access.
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.
Exact rational certificates settling nine open cases of the Ambainis-Iraids-Nagaj EXACT_{k,l}^n conjecture (exact quantum query complexity)
Quantum estimation of probability vectors with exact unbiasedness, valid simplex outputs, and uniform expected query bounds.
Optimal forward-only discrimination of promised quantum transitions using symmetric controls, with near-identity unitary bounds, fixed-step Hamiltonian guarantees, and explicit resource costs.
Sharp quantum query bounds for controlled noisy evolution, governed by entropy-decrease capacity, with channel stability proofs and matching two-qubit constructions.
Optimal dimension cost for compiling ordinary unital quantum channels into coherent Liouville evolution and block encodings.
Exact query thresholds for heralded Lüders-instrument synthesis from destructive projective measurements.
Optimal quantum search under flagged renewal dephasing: a truncated-moment law and different search exponents for clocks with equal mean and leading tail.
Reconstructing source-weighted quantum energy distributions from independent state copies, with multilevel phase estimation and dimension-sensitive bounds on Hamiltonian access.
Linear sample complexity for erasing address labels from coherent injection examples, separating supplied quantum samples from reversible oracle access.
Provisional asymptotic and finite-size hard-dose lower-bound proof packages for fourfold forrelation, with reproducibility checks.
To associate your repository with the quantum-query-complexity topic, visit your repo's landing page and select "manage topics."