Exact first-return compilation and tight query bounds for finding previous checkpoints in unknown permutations with forward-only access.
-
Updated
Nov 18, 2026 - JavaScript
Exact first-return compilation and tight query bounds for finding previous checkpoints in unknown permutations with forward-only access.
Matching forward–inverse quantum query tradeoffs for known-state discrimination, with a dimension-dependent forward-only algorithm.
Exact rational certificates settling nine open cases of the Ambainis-Iraids-Nagaj EXACT_{k,l}^n conjecture (exact 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.
Coherent Hadamard powers of unknown quantum states via collision extraction and spectral filtering, with optimal query scaling for the square.
Optimal quantum search under flagged renewal dephasing: a truncated-moment law and different search exponents for clocks with equal mean and leading tail.
Exact query thresholds for heralded Lüders-instrument synthesis from destructive projective measurements.
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.
Optimal forward-only discrimination of promised quantum transitions using symmetric controls, with near-identity unitary bounds, fixed-step Hamiltonian guarantees, and explicit resource costs.
Quantum estimation of probability vectors with exact unbiasedness, valid simplex outputs, and uniform expected query bounds.
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.
Optimal query bounds for mean estimation from fresh quantum samplers under a local replay limit, with exact-inverse algorithms and adaptive lower bounds.
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."