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

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)

Fuzzy Clustering-based Transferability of QAOA Parameters for Solving Vertex Cover Problems

Giovanni Acampora, Angela Chiatto, Autilia Vitiello

Published Jul 6, 2025• 1 citation
Publisher

Abstract

Optimization problems are fundamental to real-world applications, driving the need for increasingly advanced computational techniques. One promising methodology is the Quantum Approximate Optimization Algorithm (QAOA), a hybrid quantum-classical approach that maximizes the probability of obtaining sub-optimal solutions for combinatorial problems by tuning quantum gate parameters with a classical optimizer. Despite its success, QAOA still faces practical challenges, particularly in terms of training efficiency and computational cost. This paper introduces a fuzzy clustering-based approach to transfer QAOA parameters from instances of a relatively simpler problem to instances of different, more complex problems. Experimental results demonstrate both the effectiveness and efficiency of this approach in solving the Vertex Cover problem, thereby offering a viable alternative to conventional parameter tuning methods.

DOI
10.1109/fuzz62266.2025.11152203

Related papers

Fuzzy Clustering for QAOA Complexity Reduction

Giovanni Acampora, Angela Chiatto, Autilia Vitiello

The Quantum Approximate Optimization Algorithm (QAOA) has become one of the most widely used components in the development of modern quantum applications. It works on the paradigm of quantum variational circuits, where a quantum circuit is trained - by repeatedly adjusting circuit parameters - to adequately solve a combinatorial optimization problem. This training process, based on classical optimization algorithms, represents a significant computational bottleneck for QAOA, as it requires repeated calls to the quantum device to evaluate the cost function of the problem to solve. Therefore, there is a strong need to eliminate this computationally expensive task and identify an alternative strategy to compute good parameters for QAOA. This paper synergistically exploits the parameter concentration property of QAOA and the Fuzzy C-Means algorithm to achieve this goal. Experimental results show that the proposed approach can support QAOA to maintain high performance in solving well-known optimization problems such as MAXCUT, requiring a reduced computational effort for the parameter tuning phase.

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE)•Aug 13, 2023•4 citations

Graph representation learning for parameter transferability in quantum approximate optimization algorithm

Jose Falla, Quinn Langfitt, Yuri Alexeev +1 more

Abstract The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. Optimal QAOA parameter concentration effects for special MaxCut problem instances have been observed, but a rigorous study of the subject is still lacking. Due to clustering of optimal QAOA parameters for MaxCut, successful parameter transferability between different MaxCut instances can be explained and predicted based on local properties of the graphs, including the type of subgraphs (lightcones) from which graphs are composed as well as the overall degree of nodes in the graph (parity). In this work, we apply five different graph embedding techniques to determine good donor candidates for parameter transferability, including parameter transferability between different classes of MaxCut instances. Using this technique, we effectively reduce the number of iterations required for parameter optimization, obtaining an approximate solution to the target problem with an order of magnitude speedup. This procedure also effectively removes the problem of encountering barren plateaus during the variational optimization of parameters. Additionally, our findings demonstrate that the transferred parameters maintain effectiveness when subjected to noise, supporting their use in real-world quantum applications. This work presents a framework for identifying classes of combinatorial optimization instances for which optimal donor candidates can be predicted such that QAOA can be substantially accelerated under both ideal and noisy conditions.

arXiv:2401.06655•Quantum Machine Intelligence•Jul 22, 2024•33 citations

Similarity-based parameter transferability in the quantum approximate optimization algorithm

Alexey Galda, Eesh Gupta, Jose Falla +4 more

The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. A near-optimal solution to the combinatorial optimization problem is achieved by preparing a quantum state through the optimization of quantum circuit parameters. Optimal QAOA parameter concentration effects for special MaxCut problem instances have been observed, but a rigorous study of the subject is still lacking. In this work we show clustering of optimal QAOA parameters around specific values; consequently, successful transferability of parameters between different QAOA instances can be explained and predicted based on local properties of the graphs, including the type of subgraphs (lightcones) from which graphs are composed as well as the overall degree of nodes in the graph (parity). We apply this approach to several instances of random graphs with a varying number of nodes as well as parity and show that one can use optimal donor graph QAOA parameters as near-optimal parameters for larger acceptor graphs with comparable approximation ratios. This work presents a pathway to identifying classes of combinatorial optimization instances for which variational quantum algorithms such as QAOA can be substantially accelerated.

arXiv:2307.05420•Frontiers in Quantum Science and Technology•Jul 13, 2023•44 citations

Quantum Approaches to Urban Logistics: From Core QAOA to Clustered Scalability

F. Picariello, G. Turati, R. Antonelli +10 more

The Traveling Salesman Problem (TSP) is a fundamental challenge in combinatorial optimization, widely applied in logistics and transportation. As the size of TSP instances grows, traditional algorithms often struggle to produce high-quality solutions within reasonable timeframes. This study investigates the potential of the Quantum Approximate Optimization Algorithm (QAOA), a hybrid quantum-classical method, to solve TSP under realistic constraints. We adopt a QUBO-based formulation of TSP that integrates real-world logistical constraints reflecting operational conditions, such as vehicle capacity, road accessibility, and time windows, while ensuring compatibility with the limitations of current quantum hardware. Our experiments are conducted in a simulated environment using high-performance computing (HPC) resources to assess QAOA's performance across different problem sizes and quantum circuit depths. In order to improve scalability, we propose clustering QAOA (Cl-QAOA), a hybrid approach combining classical machine learning with QAOA. This method decomposes large TSP instances into smaller sub-problems, making quantum optimization feasible even on devices with a limited number of qubits. The results offer a comprehensive evaluation of QAOA's strengths and limitations in solving constrained TSP scenarios. This study advances quantum optimization and lays groundwork for future large-scale applications.

quant-pharXiv:2512.10813•Dec 12, 2025•1 citation

Genetic Algorithm-based QAOA Training improved with Fuzzy Clustering

Giovanni Acampora, Angela Chiatto, Autilia Vitiello

The Quantum Approximate Optimization Algorithm (QAOA) is emerging as a key method in quantum optimization. Operating within the framework of variational quantum circuits, QAOA entails training a parameterized quantum circuit through classical optimizers to effectively address combinatorial optimization problems. In this context, evolutionary algorithms such as genetic algorithms are emerging as suitable methodologies to search the optimal parameters for QAOA circuits. However, unfortunately, the training process results in a computationally intensive task, and, as a consequence, it is crucial to explore innovative strategies to address this issue. This work introduces a novel approach based on Fuzzy C-means algorithm to opportunely initialize the population of the genetic algorithms employed as optimizers for QAOA and, as a consequence, enhance the training. Experimental results demonstrate that the proposed approach significantly improves the performance of genetic algorithms-based training for QAOA.

•Mar 17, 2025•0 citations

Edge-based quantum approximate optimization algorithm for MAX-CUT problem

Youngjin Seo, Jun Heo

Quantum computing has emerged as a promising paradigm to tackle computationally intensive problems that classical computers struggle with. In this study, we explore the application of the Edge-based quantum approximate optimization algorithm (QAOA) to the MAX-CUT problem, a well-known combinatorial optimization challenge. MAX-CUT aims to partition the vertices of a graph into two subsets such that the number of edges between the subsets is maximized. We define the edge-based MAX-CUT problem and propose a method for applying QAOA specifically tailored to this formulation. We conduct simulations using IBM’s Qiskit framework, examining both vertex-based and edge-based QAOA implementations across various graph structures. Our results highlight the comparative performance of these approaches in terms of solution quality and computational efficiency. Specifically, we analyze the impact of different graph sizes and edge densities on the complexity and CNOT gate counts of the proposed algorithms. This analysis provides insights into leveraging quantum computing for combinatorial optimization tasks, particularly focusing on the implications for practical applications and future research directions.

Quantum Information Processing•Sep 23, 2025•2 citations
Optimization problems are fundamental to real-world applications, driving the need for increasingly advanced computational techniques. One promising methodology is the Quantum Approximate Optimization Algorithm (QAOA), a hybrid quantum-classical approach that maximizes the probability of obtaining sub-optimal solutions for combinatorial problems by tuning quantum gate parameters with a classical optimizer. Despite its success, QAOA still faces practical challenges, particularly in terms of training efficiency and computational cost. This paper introduces a fuzzy clustering-based approach to transfer QAOA parameters from instances of a relatively simpler problem to instances of different, more complex problems. Experimental results demonstrate both the effectiveness and efficiency of this approach in solving the Vertex Cover problem, thereby offering a viable alternative to conventional parameter tuning methods.
The Quantum Approximate Optimization Algorithm (QAOA) has become one of the most widely used components in the development of modern quantum applications. It works on the paradigm of quantum variational circuits, where a quantum circuit is trained - by repeatedly adjusting circuit parameters - to adequately solve a combinatorial optimization problem. This training process, based on classical optimization algorithms, represents a significant computational bottleneck for QAOA, as it requires repeated calls to the quantum device to evaluate the cost function of the problem to solve. Therefore, there is a strong need to eliminate this computationally expensive task and identify an alternative strategy to compute good parameters for QAOA. This paper synergistically exploits the parameter concentration property of QAOA and the Fuzzy C-Means algorithm to achieve this goal. Experimental results show that the proposed approach can support QAOA to maintain high performance in solving well-known optimization problems such as MAXCUT, requiring a reduced computational effort for the parameter tuning phase.
Abstract The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. Optimal QAOA parameter concentration effects for special MaxCut problem instances have been observed, but a rigorous study of the subject is still lacking. Due to clustering of optimal QAOA parameters for MaxCut, successful parameter transferability between different MaxCut instances can be explained and predicted based on local properties of the graphs, including the type of subgraphs (lightcones) from which graphs are composed as well as the overall degree of nodes in the graph (parity). In this work, we apply five different graph embedding techniques to determine good donor candidates for parameter transferability, including parameter transferability between different classes of MaxCut instances. Using this technique, we effectively reduce the number of iterations required for parameter optimization, obtaining an approximate solution to the target problem with an order of magnitude speedup. This procedure also effectively removes the problem of encountering barren plateaus during the variational optimization of parameters. Additionally, our findings demonstrate that the transferred parameters maintain effectiveness when subjected to noise, supporting their use in real-world quantum applications. This work presents a framework for identifying classes of combinatorial optimization instances for which optimal donor candidates can be predicted such that QAOA can be substantially accelerated under both ideal and noisy conditions.
The quantum approximate optimization algorithm (QAOA) is one of the most promising candidates for achieving quantum advantage through quantum-enhanced combinatorial optimization. A near-optimal solution to the combinatorial optimization problem is achieved by preparing a quantum state through the optimization of quantum circuit parameters. Optimal QAOA parameter concentration effects for special MaxCut problem instances have been observed, but a rigorous study of the subject is still lacking. In this work we show clustering of optimal QAOA parameters around specific values; consequently, successful transferability of parameters between different QAOA instances can be explained and predicted based on local properties of the graphs, including the type of subgraphs (lightcones) from which graphs are composed as well as the overall degree of nodes in the graph (parity). We apply this approach to several instances of random graphs with a varying number of nodes as well as parity and show that one can use optimal donor graph QAOA parameters as near-optimal parameters for larger acceptor graphs with comparable approximation ratios. This work presents a pathway to identifying classes of combinatorial optimization instances for which variational quantum algorithms such as QAOA can be substantially accelerated.
The Traveling Salesman Problem (TSP) is a fundamental challenge in combinatorial optimization, widely applied in logistics and transportation. As the size of TSP instances grows, traditional algorithms often struggle to produce high-quality solutions within reasonable timeframes. This study investigates the potential of the Quantum Approximate Optimization Algorithm (QAOA), a hybrid quantum-classical method, to solve TSP under realistic constraints. We adopt a QUBO-based formulation of TSP that integrates real-world logistical constraints reflecting operational conditions, such as vehicle capacity, road accessibility, and time windows, while ensuring compatibility with the limitations of current quantum hardware. Our experiments are conducted in a simulated environment using high-performance computing (HPC) resources to assess QAOA's performance across different problem sizes and quantum circuit depths. In order to improve scalability, we propose clustering QAOA (Cl-QAOA), a hybrid approach combining classical machine learning with QAOA. This method decomposes large TSP instances into smaller sub-problems, making quantum optimization feasible even on devices with a limited number of qubits. The results offer a comprehensive evaluation of QAOA's strengths and limitations in solving constrained TSP scenarios. This study advances quantum optimization and lays groundwork for future large-scale applications.
The Quantum Approximate Optimization Algorithm (QAOA) is emerging as a key method in quantum optimization. Operating within the framework of variational quantum circuits, QAOA entails training a parameterized quantum circuit through classical optimizers to effectively address combinatorial optimization problems. In this context, evolutionary algorithms such as genetic algorithms are emerging as suitable methodologies to search the optimal parameters for QAOA circuits. However, unfortunately, the training process results in a computationally intensive task, and, as a consequence, it is crucial to explore innovative strategies to address this issue. This work introduces a novel approach based on Fuzzy C-means algorithm to opportunely initialize the population of the genetic algorithms employed as optimizers for QAOA and, as a consequence, enhance the training. Experimental results demonstrate that the proposed approach significantly improves the performance of genetic algorithms-based training for QAOA.
Quantum computing has emerged as a promising paradigm to tackle computationally intensive problems that classical computers struggle with. In this study, we explore the application of the Edge-based quantum approximate optimization algorithm (QAOA) to the MAX-CUT problem, a well-known combinatorial optimization challenge. MAX-CUT aims to partition the vertices of a graph into two subsets such that the number of edges between the subsets is maximized. We define the edge-based MAX-CUT problem and propose a method for applying QAOA specifically tailored to this formulation. We conduct simulations using IBM’s Qiskit framework, examining both vertex-based and edge-based QAOA implementations across various graph structures. Our results highlight the comparative performance of these approaches in terms of solution quality and computational efficiency. Specifically, we analyze the impact of different graph sizes and edge densities on the complexity and CNOT gate counts of the proposed algorithms. This analysis provides insights into leveraging quantum computing for combinatorial optimization tasks, particularly focusing on the implications for practical applications and future research directions.