Quantum ordinal optimization under a fixed comparison budget
quant-ph, cs.SY, eess.SY, math.OC
Submitted: 2026-10-11
Updated: 2026-10-11
Comments: 20 pages, 3 tables
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Sources
- A Quantum Algorithm for Finding the Minimum
- Quantum Grover Adaptive Search for Discrete Simulation Optimization
- Rate-Optimal Quantum Discrete Simulation Optimization
- Invariant Quantum Algorithms for Insertion into an Ordered List
- Translation-Invariant Quantum Algorithms for Ordered Search are Optimal
- On exact quantum query complexity
- Optimal one-shot quantum algorithm for EQUALITY and AND
- Optimal quantum adversary lower bounds for ordered search
- Approximate Selection with Unreliable Comparisons in Optimal Expected Time
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Incoherent Imaging with Spatially Structured Quantum Probes
- A quasiparticle-protected superconducting qubit
- Theory of quantum-enhanced interferometry with general Markovian light sources