analiza aiqbench
This arXiv paper is a theoretical quantum algorithms result: it tightens the error guarantees of electric flow sampling, a quantum walk primitive, and applies it to effective resistance estimation and a claimed up-to-quadratic speedup for semi-supervised learning on expander graphs. The speedup is an asymptotic bound, not a demonstrated advantage, and it depends on access models and graph assumptions that may not hold in practice. Readers should treat the learning application as a complexity-theoretic claim until it is evaluated against real workloads.
Elfs, transducers and quantum walks
arXiv:2605.30013v2 Announce Type: replace Abstract: Electric flow sampling (elfs) is a new tool in the quantum walk toolbox and a useful primitive for solving search, sampling and optimization problems on graphs. We refine this tool by showing that there exists a zero-error transducer for implementing elfs. More broadly, we establish a zero-error transducer for reflecting about the intersection of two subspaces, yielding an errorfree transducer version of the effective gap lemma. Building on this result, we obtain improved quantum walk algorithms for estimating effective resistances and span program witness sizes with an optimal error scaling, and for sampling from the random walk arrival distribution, via the composition of many elfs. Using this last algorithm, we obtain an up-to-quadratic quantum speedup for semi-supervised learning on expander graphs.
Abstract:Electric flow sampling (elfs) is a new tool in the quantum walk toolbox and a useful primitive for solving search, sampling and optimization problems on graphs. We refine this tool by showing that there exists a zero-error transducer for implementing elfs. More broadly, we establish a zero-error transducer for reflecting about the intersection of two subspaces, yielding an errorfree transducer version of the effective gap lemma. Building on this result, we obtain improved quantum walk algorithms for estimating effective resistances and span program witness sizes with an optimal error scaling, and for sampling from the random walk arrival distribution, via the composition of many elfs. Using this last algorithm, we obtain an up-to-quadratic quantum speedup for semi-supervised learning on expander graphs.
Quantum Physics (quant-ph); Computational Complexity (cs.CC); Data Structures and Algorithms (cs.DS)
arXiv:2605.30013 [quant-ph]
(or arXiv:2605.30013v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2605.30013 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 221 cuvinte
Subiecte conexe
Improved quantum volume estimation with transducers and amortized quantum walks
arXiv · 1 oct. 2026
Root-sparsity scaling for Hamiltonian simulation, differential equations and linear-system solvers
arXiv · 5 oct. 2026

Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
Quantum Journal · 13 oct. 2026

How Yokohama National University Maps Grover Walk Robustness
Quantum Zeitgeist · 18 iul. 2026