Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2603.20694 · International Conference on Computer Vision Theory and Applications

FALQON-MST: A Fully Quantum Framework for Graph Optimization in Vision Systems

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

quant-phSubmitted Mar 21, 2026• Announced Mar 24, 2026• 0 citations
arXivHTMLPDF

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.

Journal reference
Proceedings of the 21st International Conference on Computer Vision Theory and Applications - Volume 1: VISAPP, 419-426, 2026
DOI
10.5220/0014312400004084
Comments
8 pages. Accepted for publication at the 21st International Conference on Computer Vision Theory and Applications (VISAPP 2026), Marbella, Spain

Related papers

Accelerating feedback-based quantum algorithms through time rescaling

L. A. M. Rattighieri, G. E. L. Pexe, Bertúlio de Lima Bernardo +1 more

This work investigates the impact of time rescaling on the performance of Feedback-Based Quantum Algorithms (FQAs) and their variant for optimization tasks, Feedback-Based Algorithm for Quantum Optimization (FALQON). We introduce the Time-Rescaled Feedback-Based Quantum Algorithm (TR-FQA) and Time-Rescaled Feedback-Based Algorithm for Quantum Optimization (TR-FALQON), time-rescaled versions of FQA and FALQON, respectively. The method is applied to two representative problems: the MaxCut combinatorial optimization problem and ground-state preparation in the axial next-nearest neighbor Ising (ANNNI) model. The results show that TR-FALQON accelerates convergence toward the optimal solution in the circuit's early layers and outperforms the standard version in low-depth regimes. In the context of state preparation, TR-FQA requires fewer layers than the original algorithm. These findings suggest that time rescaling can reduce the number of layers needed to reach a high-quality solution, even if the exact ground state is not obtained.

arXiv:2504.01256•Physical Review A•Sep 17, 2025•12 citations

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 more

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 quantum walk on a graph, where vertices are encoded as quantum states and edge weights are inverted to define a modified Hamiltonian, we demonstrate that the quantum evolution naturally selects the MST by maximizing the cumulative transition probability (and thus the Shannon entropy) over the spanning tree. Our method, termed Quantum Kruskal with MDC, significantly reduces the quantum resource requirement to $\mathcal{O}(\log N)$ qubits while retaining a competitive classical computational complexity. Numerical experiments on fully connected graphs up to $10^4$ vertices confirm that, particularly for MDC values exceeding $4$, the algorithm delivers MSTs with optimal or near-optimal total weights. When MDC values are less or equal to $4$, some instances achieve a suboptimal solution, still outperforming several established classical algorithms. These results open promising perspectives for hybrid quantum-classical solutions in large-scale graph optimization.

arXiv:2508.07007•Aug 9, 2025•1 citation

Time rescaling for second-order feedback-based quantum optimization

Leticia Bertuzzi, João P. Engster, Evandro C. R. da Rosa +1 more

Feedback-based quantum algorithms recently gained attention by demonstrating how quantum computers can be used to solve optimization problems without resorting to hybrid quantum-classical architectures. Recent progress made with Feedback-based Algorithm for Quantum Optimization (FALQON) variants significantly reduced the depth of the required circuits. In this work, we merge the time-rescaled and second-order FALQON variants into a unified framework. The results show an important improvement over past modifications, reducing circuit depth and allowing a more flexible choice of time-steps, while maintaining stable solutions. This FALQON variant makes it suitable for the NISQ era.

quant-pharXiv:2609.21640•Sep 21, 2026•0 citations

PUBO Formulation for MST and Application to Optimum-Path Forest

Guilherme E. L. Pexe, Lucas A. M. Rattighieri, Leandro A. Passos +5 more

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 prototypes computed by a Minimum Spanning Tree (MST) over the training data, which might become prohibitive for large-scale datasets. In this context, Quantum Machine Learning has emerged as a promising approach to overcome the high computational burden of combinatorial problems. We propose a quantum-inspired approach for prototype selection in OPF classifiers by reformulating the MST problem as a Polynomial Unconstrained Binary Optimization (PUBO) task and further employing the Feedback-Based Quantum Optimization (FALQON) algorithm for Hamiltonian minimization. The PUBO formulation reduces the need for qubits and eliminates the need for auxiliary variables, thereby addressing scalability constraints in current quantum hardware. Experiments on real-world datasets demonstrate that the FALQON-optimized MST achieves accuracies comparable to those of the classical Prim's algorithm while maintaining prototype quality. While FALQON occasionally reached local minima, it did not significantly impact the accuracy of the prototype selection process.

quant-pharXiv:2605.20637•May 21, 2026•0 citations

Solving Graph Coloring Problems Using Feedback-Based Algorithm for Quantum Optimization

Yuika Kawatomi, Yukina Tatsuta, Kazue Kudo

The feedback-based algorithm for quantum optimization (FALQON), which is an extension of the quantum approximate optimization algorithm (QAOA), is a promising approach for finding approximate solutions to combinatorial optimization problems. The FALQON avoids the optimization of variational parameters by using information derived from iterative measurements. To solve a constrained combinatorial optimization problem, it is sometimes more efficient to use an XY mixer rather than the conventional X mixer. We applied the FALQON with the XY mixer to graph coloring and investigated the expectation value of the problem Hamiltonian, success probability of graph coloring, and fair sampling for several small-scale problems. The FALQON with the XY mixer exhibited better performance than that with the X mixer.

quant-pharXiv:2609.30991•Sep 28, 2026•0 citations

A New Quantum Inspired Algorithmic Approach to Finding Minimum Spanning Tree

Amrit Kaur, Sulabh Bansal

One of the most common and well-known problems in combinatorial optimization is the minimum spanning tree. With the emergence of complex data structures, new, more complex, but asymptotically efficient algorithms have been proposed. In this research, we present a new evolutionary algorithm influenced by quantum mechanics, known as quantum-inspired evolutionary algorithm (QIEA) to find the minimum spanning tree of a complete weighted undirected graph as input and computational results to demonstrate the effectiveness of proposed algorithm. The proposed algorithm is named QIEA-MST and is based on concept and principle such as qubits and the superposition, coherence and the entanglement of different qubits of quantum state. The algorithm is simple and easy to understand and easy to implement. Some types of scientific and engineering problems will benefit from the proposed method.

IEEE India Conference•Dec 14, 2023•1 citation
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.
This work investigates the impact of time rescaling on the performance of Feedback-Based Quantum Algorithms (FQAs) and their variant for optimization tasks, Feedback-Based Algorithm for Quantum Optimization (FALQON). We introduce the Time-Rescaled Feedback-Based Quantum Algorithm (TR-FQA) and Time-Rescaled Feedback-Based Algorithm for Quantum Optimization (TR-FALQON), time-rescaled versions of FQA and FALQON, respectively. The method is applied to two representative problems: the MaxCut combinatorial optimization problem and ground-state preparation in the axial next-nearest neighbor Ising (ANNNI) model. The results show that TR-FALQON accelerates convergence toward the optimal solution in the circuit's early layers and outperforms the standard version in low-depth regimes. In the context of state preparation, TR-FQA requires fewer layers than the original algorithm. These findings suggest that time rescaling can reduce the number of layers needed to reach a high-quality solution, even if the exact ground state is not obtained.
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 quantum walk on a graph, where vertices are encoded as quantum states and edge weights are inverted to define a modified Hamiltonian, we demonstrate that the quantum evolution naturally selects the MST by maximizing the cumulative transition probability (and thus the Shannon entropy) over the spanning tree. Our method, termed Quantum Kruskal with MDC, significantly reduces the quantum resource requirement to O(log⁡N)\mathcal{O}(\log N)O(logN) qubits while retaining a competitive classical computational complexity. Numerical experiments on fully connected graphs up to 10410^4104 vertices confirm that, particularly for MDC values exceeding 444, the algorithm delivers MSTs with optimal or near-optimal total weights. When MDC values are less or equal to 444, some instances achieve a suboptimal solution, still outperforming several established classical algorithms. These results open promising perspectives for hybrid quantum-classical solutions in large-scale graph optimization.
Feedback-based quantum algorithms recently gained attention by demonstrating how quantum computers can be used to solve optimization problems without resorting to hybrid quantum-classical architectures. Recent progress made with Feedback-based Algorithm for Quantum Optimization (FALQON) variants significantly reduced the depth of the required circuits. In this work, we merge the time-rescaled and second-order FALQON variants into a unified framework. The results show an important improvement over past modifications, reducing circuit depth and allowing a more flexible choice of time-steps, while maintaining stable solutions. This FALQON variant makes it suitable for the NISQ era.
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 prototypes computed by a Minimum Spanning Tree (MST) over the training data, which might become prohibitive for large-scale datasets. In this context, Quantum Machine Learning has emerged as a promising approach to overcome the high computational burden of combinatorial problems. We propose a quantum-inspired approach for prototype selection in OPF classifiers by reformulating the MST problem as a Polynomial Unconstrained Binary Optimization (PUBO) task and further employing the Feedback-Based Quantum Optimization (FALQON) algorithm for Hamiltonian minimization. The PUBO formulation reduces the need for qubits and eliminates the need for auxiliary variables, thereby addressing scalability constraints in current quantum hardware. Experiments on real-world datasets demonstrate that the FALQON-optimized MST achieves accuracies comparable to those of the classical Prim's algorithm while maintaining prototype quality. While FALQON occasionally reached local minima, it did not significantly impact the accuracy of the prototype selection process.
The feedback-based algorithm for quantum optimization (FALQON), which is an extension of the quantum approximate optimization algorithm (QAOA), is a promising approach for finding approximate solutions to combinatorial optimization problems. The FALQON avoids the optimization of variational parameters by using information derived from iterative measurements. To solve a constrained combinatorial optimization problem, it is sometimes more efficient to use an XY mixer rather than the conventional X mixer. We applied the FALQON with the XY mixer to graph coloring and investigated the expectation value of the problem Hamiltonian, success probability of graph coloring, and fair sampling for several small-scale problems. The FALQON with the XY mixer exhibited better performance than that with the X mixer.
One of the most common and well-known problems in combinatorial optimization is the minimum spanning tree. With the emergence of complex data structures, new, more complex, but asymptotically efficient algorithms have been proposed. In this research, we present a new evolutionary algorithm influenced by quantum mechanics, known as quantum-inspired evolutionary algorithm (QIEA) to find the minimum spanning tree of a complete weighted undirected graph as input and computational results to demonstrate the effectiveness of proposed algorithm. The proposed algorithm is named QIEA-MST and is based on concept and principle such as qubits and the superposition, coherence and the entanglement of different qubits of quantum state. The algorithm is simple and easy to understand and easy to implement. Some types of scientific and engineering problems will benefit from the proposed method.