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.
Fowler, Improved QUBO formulations for D-Wave quantum computing, Master’s thesis, University of Auck- land (2017)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
REJECT 1roles
background 1polarities
background 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.