DQMW-Sample realizes a classically hard online learning primitive via dissipative quantum dynamics with sublinear regret and proven hardness for classical simulation including PH collapse.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.
citing papers explorer
-
Dissipative Quantum Multiplicative Weights with Sampling Feedback: A Classically Hard Primitive Realized via Engineered Open-System Dynamics
DQMW-Sample realizes a classically hard online learning primitive via dissipative quantum dynamics with sublinear regret and proven hardness for classical simulation including PH collapse.
-
Loop Composition in Quantum Algorithms
Adding loop composition to branching quantum walk models produces a variable-time quantum search algorithm whose complexity matches the best known results.