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:2507.20777 · The Journal of Supercomputing

Quantum circuit evolutionary framework applied to the set partitioning problem

Bruno Oziel Fernandez, Rodrigo Bloot, Marcelo Albano Moret

Published May 11, 2026• 0 citations
arXivHTMLPDF
DOI
10.1007/s11227-026-08511-8

Related papers

Evolutionary Algorithms for Quantum Computers

Daniel Johannsen, Piyush P. Kurur, Johannes Lengler

Algorithmica•Apr 19, 2013•2 citations

Avoiding Convergence Stagnation in a Quantum Circuit Evolutionary Framework Through an Adaptive Cost Function

Bruno O. Fernandez, Rodrigo Bloot, Marcelo Albano Moret

Binary optimization problems are emerging as potential candidates for useful applications of quantum computing. Among quantum algorithms, the quantum approximate optimization algorithm (QAOA) is currently considered the most promising method to obtain a quantum advantage for such problems. The QAOA method uses a classical counterpart to perform optimization in a hybrid approach. In this paper, we show that the recently introduced method called quantum circuit evolutionary (QCE) also has potential for applications in binary optimization problems. This methodology is classical optimizer-free, but, for some scenarios, may have convergence stagnation as a consequence of smooth circuit modifications at each generation. To avoid this drawback and accelerate the convergence capabilities of QCE, we introduce a framework using an adaptive cost function (ACF), which varies dynamically with the circuit evolution. This procedure accelerates the convergence of the method. Applying this new approach to instances of the set partitioning problem, we show that QCE-ACF achieves convergence performance identical to QAOA but with a shorter execution time. Finally, experiments in the presence of induced noise show that this framework is quite suitable for the noisy intermediate-scale quantum era.

arXiv:2503.22404•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•1 citation

Quantum-inspired evolutionary algorithms: a survey and empirical study

Gexiang Zhang

Journal of Heuristics•Jun 28, 2010•297 citations

Applying an Evolutionary Algorithm to Minimize Teleportation Costs in Distributed Quantum Computing

Leo Sünkel, Manik Dawar, Thomas Gabor

By connecting multiple quantum computers (QCs) through classical and quantum channels, a quantum communication network can be formed. This gives rise to new applications such as blind quantum computing, distributed quantum computing, and quantum key distribution. In distributed quantum computing, QCs collectively perform a quantum computation. As each device only executes a sub-circuit with fewer qubits than required by the complete circuit, a number of small QCs can be used in combination to execute a large quantum circuit that a single QC could not solve on its own. However, communication between QCs may still occur. Depending on the connectivity of the circuit, qubits must be teleported to different QCs in the network, adding overhead to the actual computation; thus, it is crucial to minimize the number of teleportations. In this paper, we propose an evolutionary algorithm for this problem. More specifically, the algorithm assigns qubits to QCs in the network for each time step of the circuit such that the overall teleportation cost is minimized. Moreover, network-specific constraints such as the capacity of each QC in the network can be taken into account. We run experiments on random as well as benchmarking circuits and give an outline on how this method can be adjusted to be incorporated into more realistic network settings as well as in compilers for distributed quantum computing. Our results show that an evolutionary algorithm is well suited for this problem when compared to the graph partitioning approach as it delivers better results while simultaneously allows the easy integration and consideration of various problem-specific constraints.

arXiv:2311.18529•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•12 citations

The set partitioning problem in a quantum context

Rafael Cação, Lucas R. C. T. Cortez, Jackson Forner +3 more

Optimization Letters•Jun 23, 2023•3 citations

Application of Genetic Algorithm for Synthesis of Large Reversible Circuits using Covered Set Partitions

Maher Hawash, Baker K. Abdalhaq, Amjad Hawash +1 more

We present the results of application of Evolutionary Algorithms to the problem of synthesizing quantum circuits which belong to the class of reversible circuits, represented as an input/output mapping vectors. The paper specifically focuses on large quantum circuits where many valid solutions exist in an exponentially inflating search space. Valid solutions represent the set of all input vector permutations (arrangements) which satisfy the circuit specification. The search space for circuits with large number of variables grows exponentially making it impossible to discover the set of optimal solutions. The paper compares three methods for selecting valid solutions of input vector sequences: 1) randomly, 2) genetic algorithm, 3) Tabu search. The objective function calculates the number of elementary quantum gates needed to represent the solution such that lower number of gates represents better solutions. In addition to the choice of selection algorithm, we illustrate the impact of using different partition depths for the Covered Set Partitions algorithm used to construct valid input vector sequences.

•Jan 1, 2011•5 citations
Binary optimization problems are emerging as potential candidates for useful applications of quantum computing. Among quantum algorithms, the quantum approximate optimization algorithm (QAOA) is currently considered the most promising method to obtain a quantum advantage for such problems. The QAOA method uses a classical counterpart to perform optimization in a hybrid approach. In this paper, we show that the recently introduced method called quantum circuit evolutionary (QCE) also has potential for applications in binary optimization problems. This methodology is classical optimizer-free, but, for some scenarios, may have convergence stagnation as a consequence of smooth circuit modifications at each generation. To avoid this drawback and accelerate the convergence capabilities of QCE, we introduce a framework using an adaptive cost function (ACF), which varies dynamically with the circuit evolution. This procedure accelerates the convergence of the method. Applying this new approach to instances of the set partitioning problem, we show that QCE-ACF achieves convergence performance identical to QAOA but with a shorter execution time. Finally, experiments in the presence of induced noise show that this framework is quite suitable for the noisy intermediate-scale quantum era.
By connecting multiple quantum computers (QCs) through classical and quantum channels, a quantum communication network can be formed. This gives rise to new applications such as blind quantum computing, distributed quantum computing, and quantum key distribution. In distributed quantum computing, QCs collectively perform a quantum computation. As each device only executes a sub-circuit with fewer qubits than required by the complete circuit, a number of small QCs can be used in combination to execute a large quantum circuit that a single QC could not solve on its own. However, communication between QCs may still occur. Depending on the connectivity of the circuit, qubits must be teleported to different QCs in the network, adding overhead to the actual computation; thus, it is crucial to minimize the number of teleportations. In this paper, we propose an evolutionary algorithm for this problem. More specifically, the algorithm assigns qubits to QCs in the network for each time step of the circuit such that the overall teleportation cost is minimized. Moreover, network-specific constraints such as the capacity of each QC in the network can be taken into account. We run experiments on random as well as benchmarking circuits and give an outline on how this method can be adjusted to be incorporated into more realistic network settings as well as in compilers for distributed quantum computing. Our results show that an evolutionary algorithm is well suited for this problem when compared to the graph partitioning approach as it delivers better results while simultaneously allows the easy integration and consideration of various problem-specific constraints.
We present the results of application of Evolutionary Algorithms to the problem of synthesizing quantum circuits which belong to the class of reversible circuits, represented as an input/output mapping vectors. The paper specifically focuses on large quantum circuits where many valid solutions exist in an exponentially inflating search space. Valid solutions represent the set of all input vector permutations (arrangements) which satisfy the circuit specification. The search space for circuits with large number of variables grows exponentially making it impossible to discover the set of optimal solutions. The paper compares three methods for selecting valid solutions of input vector sequences: 1) randomly, 2) genetic algorithm, 3) Tabu search. The objective function calculates the number of elementary quantum gates needed to represent the solution such that lower number of gates represents better solutions. In addition to the choice of selection algorithm, we illustrate the impact of using different partition depths for the Covered Set Partitions algorithm used to construct valid input vector sequences.