A quantum-walk framing of Kruskal's algorithm: edge weights are inverted to define a Hamiltonian, and picking the highest transition-probability edges reproduces the MST, with a greedy degree cap for the constrained case.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint
A quantum-walk framing of Kruskal's algorithm: edge weights are inverted to define a Hamiltonian, and picking the highest transition-probability edges reproduces the MST, with a greedy degree cap for the constrained case.