FALQON-MST: A Fully Quantum Framework for Graph Optimization in Vision Systems
Summarize this article with:
Quantum Physics arXiv:2603.20694 (quant-ph) [Submitted on 21 Mar 2026] Title:FALQON-MST: A Fully Quantum Framework for Graph Optimization in Vision Systems Authors:Guilherme E. L. Pexe, Lucas A. M. Rattighieri, Leandro A. Passos, Douglas Rodrigues, Danilo S. Jodas, João P. Papa, Kelton A. P. da Costa View a PDF of the paper titled FALQON-MST: A Fully Quantum Framework for Graph Optimization in Vision Systems, by Guilherme E. L. Pexe and 6 other authors View PDF HTML (experimental) Abstract:Finding the minimum spanning tree (MST) of a graph is an important task in computer vision, as it enables a sparse and low-cost representation of connectivity among elements (such as superpixels, points, or regions), which is useful for tasks such as segmentation, reconstruction, and clustering. In this work, we propose and evaluate a fully quantum pipeline for computing MSTs using the FALQON algorithm, a feedback-based quantum optimization method that does not require classical optimizers. We construct a Hamiltonian formulation whose ground-state energy encodes the MST of a graph and compare different FALQON strategies: (i) time rescaling (TR-FALQON) and (ii) multi-driver configurations. To avoid domain-specific biases, we adopt graphs with random weights and show that the FALQON variants exhibit significant differences in ground-state fidelity. We discuss the relevance of this approach for computer vision problems that naturally yield graph representations, and experimental results on synthetic instances together with a small demonstrative study on image segmentation illustrate both the potential and the current limitations of the method. Our numerical simulations on randomly weighted graphs show that standard one drive FALQON, although it reduces the expected energy, fails to concentrate amplitude in the MST solution. The multi drive variant succeeds in redistributing probability mass toward the ground state so that the MST appears among the most probable outcomes, and TR FALQON applied over multi drive produces the best results with faster convergence, lower final energy, and the highest solution state probability or fidelity in our tested instances. These improvements were observed on small synthetic graphs, underscoring both the promise of multi drive controls with temporal rescaling and the need for further scaling and hardware validation. Comments: Subjects: Quantum Physics (quant-ph) Cite as: arXiv:2603.20694 [quant-ph] (or arXiv:2603.20694v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2603.20694 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Journal reference: Proceedings of the 21st International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, 419-426, 2026 Related DOI: https://doi.org/10.5220/0014312400004084 Focus to learn more DOI(s) linking to related resources Submission history From: Guilherme Pexe [view email] [v1] Sat, 21 Mar 2026 07:34:07 UTC (349 KB) Full-text links: Access Paper: View a PDF of the paper titled FALQON-MST: A Fully Quantum Framework for Graph Optimization in Vision Systems, by Guilherme E. L. Pexe and 6 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-03 References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) Links to Code Toggle Papers with Code (What is Papers with Code?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators 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. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)