2 papers
quant-ph2026
PUBO Formulation for MST and Application to Optimum-Path Forest
Guilherme E. L. Pexe, Lucas A. M. Rattighieri, Leandro A. Passos +5
The Optimum-Path Forest is a graph-based framework for designing classifiers that exploit inter-sample connectivity. A particular variant constructs decision boundaries based on pr…
quant-ph2025
A Quantum Walk-Driven Algorithm for the Minimum Spanning Tree Problem under a Maximal Degree Constraint
F. S. Luiz, F. F. Fanchini, Victor Hugo C. de Albuquerque +2
We present a novel quantum walk-based approach to solve the Minimum Spanning Tree (MST) problem under a maximal degree constraint (MDC). By recasting the classical MST problem as a…