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

Southeast Symposium on Contemporary Engineering Topics (SSCET)

Distributed Consensus Control with Monolithic and Distributed VQE Optimized Topology for Multi-Agent Systems

Milad Hasanzadeh, Amin Kargarian

Published Aug 1, 2026• 0 citations
Publisher

Abstract

This paper presents a framework for distributed consensus control in multi-agent systems (MASs), where the communication topology is dynamically optimized using quantum algorithms. This work highlights the potential of combining distributed control with near-term quantum computing for intelligent networked systems. At first, we revisit classical consensus control for both first-order and second-order agent dynamics and model the resulting closed-loop systems under dynamic communication topologies. We then formulate the topology selection problem as a quadratic unconstrained binary optimization (QUBO) problem, incorporating application-aware cost terms such as communication cost, inter-agent distance, security, and connectivity constraints. While classical topology optimization methods for consensus control can solve the problem effectively, they struggle to scale as the system size increases. Quantum optimization offers a promising alternative, with the potential for greater efficiency and even exponential speedup over classical approaches in some instances. We solve the QUBO using the variational quantum eigensolver (VQE), leveraging monolithic and distributed quantum computing. Simulation results demonstrate the effectiveness of the proposed approaches in executing consensus.

DOI
10.1109/sscet69323.2026.11735428

Related papers

Dynamic Quantum Optimal Communication Topology Design for Consensus Control in Linear Multi-Agent Systems

Milad Hasanzadeh, Amin Kargarian

This paper proposes a quantum framework for the design of communication topologies in consensus-based multi-agent systems. The communication graph is selected online by solving a mixed-integer quadratic program (MIQP) that minimizes a cost combining communication and distance penalties with degree-regularization terms, while enforcing exact connectivity through a flow-based formulation. To cope with the combinatorial complexity of this NP-hard problem, we develop a three-block ADMM scheme that decomposes the MIQP into a convex quadratic program in relaxed edge and flow variables, a pure binary unconstrained subproblem, and a closed-form auxiliary update. The binary subproblem is mapped to a quadratic unconstrained binary optimization (QUBO) Hamiltonian and approximately solved via quantum imaginary time evolution (QITE). The resulting time-varying, optimizer-generated Laplacians are applied to linear first- and second-order consensus dynamics. Numerical simulations on networks demonstrate that the proposed method produces connected topologies that satisfy degree constraints, achieve consensus, and incur costs comparable to those of classical mixed-integer solvers, thereby illustrating how quantum algorithms can be embedded as topology optimizers within closed-loop distributed control architectures.

arXiv:2602.06215•Feb 5, 2026•2 citations

Distributed Quantum Computing Framework for Smart Grid Optimization

Agata Jolanta Jachowa, Ludwik Kłos

Optimization models for large smart grids need to consider network constraints, renewable energy uncertainty, storage dynamics and flexible demand simultaneously. The mixed discrete-continuous nature of these problems is not suitable for the operational time constraints, and a single quantum processor cannot yet handle real grid instances. A distributed quantum computing framework for an electrical network is proposed in this paper, which divides the network into coupled regions, assigns compact quadratic unconstrained binary optimisation subproblems to heterogeneous quantum workers, and employs an asynchronous classical coordinator to enforce boundary consensus. The four components of the framework are adaptive penalty encoding, warm-started variational circuits, confidence-aware result aggregation and projection-based feasibility repair. A reproducible simulation study is constructed for modified 33-bus, 118-bus, 300-bus and 1354-bus systems with renewable generation, batteries and responsive loads. In all the test cases, the proposed method reduced the operating cost and constraint violation compared with centralised QAOA, quantum annealing, ADMM, and mixed-integer programming under the same time budget. It still performs reasonably well under high worker latency and depolarising noise. Based on the above results, near-term quantum resources will be more credible as coordinated regional accelerators than as a single grid optimizer. Therefore, it will be presented as an engineering architecture, an explicit optimisation map and a multi-metric evaluation system for scalable quantum-assisted smart grid operation.

Journal of Applied Automation Technologies•Apr 14, 2024•0 citations

Q-PACT : Quantum-Parallel Agentic Coordination Toolkit

Sourodeep Kundu

Abstract The convergence of quantum optimization and autonomous agentic reasoning defines a new computational frontier in large-scale resource coordination. This work introduces Q-PACT, a Quantum-Parallel Agentic Coordination Toolkit that unifies quantum optimization, fairness-driven orchestration, and adaptive multi-agent intelligence into a reproducible hybrid framework. Q-PACT addresses a key limitation in distributed and cloud-based quantum infrastructures; inefficient, inequitable scheduling of scarce quantum resources among competing agents and tasks. The proposed architecture formulates multi-agent scheduling as a Quadratic Unconstrained Binary Optimization (QUBO) model, solved through a heterogeneous pipeline integrating quantum annealing (D-Wave), variational optimization (QAOA on IonQ/Azure), and classical meta-heuristics. A noise-aware encoder, solver-adapter layer, and agentic manager collaborate to maintain fairness, adaptability, and load balance, while the QML-AURA subsystem continuously refines solver hyperparameters through feedback-driven variational learning. Q-PACT’s hybrid orchestration layer enables dynamic re-optimization, fault-tolerant fallback execution, and secure artifact exchange across distributed backends, achieving resilience under the noise and queueing constraints of NISQ-era hardware. Empirical evaluations demonstrate significant improvements in makespan reduction, workload variance, and energy minimization compared with classical heuristics, establishing the viability of quantum-assisted agentic scheduling at scale. By bridging quantum optimization paradigms, multi-agent systems, and fairness-aware orchestration, Q-PACT provides a foundational blueprint for the next generation of autonomous, cloud-integrated, and quantum-enabled coordination systems.

•Jan 7, 2026•0 citations

Distributed quantum computing via enhanced connectivity

Jiyao Liu

As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.

•Jun 11, 2026•0 citations

Time-Aware Qubit Assignment and Circuit Optimization for Distributed Quantum Computing

Leo Sünkel, Jonas Stein, Maximilian Zorn +2 more

The emerging paradigm of distributed quantum computing promises a potential solution to scaling quantum computing to currently unfeasible dimensions. While this approach itself is still in its infancy, and many obstacles must still be overcome before its physical implementation, challenges from the software and algorithmic side must also be identified and addressed. For instance, this paradigm shift requires a new form of compiler that considers the network constraints in general as well as phenomena arising due to the nature of quantum communication. In distributed quantum computing, large circuits are divided into smaller subcircuits such that they can be executed individually and simultaneously on multiple QPUs that are connected through quantum channels. As quantum communication, for example, in the form of teleportation, is expensive, it must be used sparingly. We address the problem of assigning qubits to QPUs to minimize communication costs in two different ways. First by applying time-aware algorithms that take into account the changing connectivity of a given circuit as well as the underlying network topology. We define the optimization problem, use simulated annealing and an evolutionary algorithm and compare the results to graph partitioning and sequential qubit assignment baselines. In another approach, we propose an evolutionary-based quantum circuit optimization algorithm that adjusts the circuit itself rather than the schedule to reduce the overall communication cost. We evaluate the techniques against random circuits and different network topologies. Both evolutionary algorithms outperform the baseline in terms of communication cost reduction. We give an outlook on how the approaches can be integrated into a compilation framework for distributed quantum computing.

arXiv:2507.11707•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•3 citations

Multi-Objective Routing Optimization Using Coherent Ising Machine in Wireless Multihop Networks

Yuxuan Lin, Chunxue Xu, Chuan Wang

Multi-objective combinatorial optimization in wireless communication networks is a challenging task, particularly for large-scale and diverse topologies. Recent advances in quantum computing offer promising solutions for such problems. Coherent Ising Machines (CIM), a quantum-inspired algorithm, leverages quantum properties of coherent light, enabling faster convergence to the ground state. This paper applies CIM to multiobjective routing optimization in wireless multi-hop networks. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and map it onto an Ising model, allowing CIM to solve it. CIM demonstrates strong scalability across diverse network topologies without requiring topology-specific adjustments, overcoming the limitations of traditional quantum algorithms like Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE). Our results show that CIM provides feasible and near-optimal solutions for networks containing hundreds of nodes and thousands of edges. Additionally, a complexity analysis highlights CIM's increasing efficiency as network size grows.

arXiv:2503.07924•International Conference on Communications•Jun 8, 2025•8 citations
This paper presents a framework for distributed consensus control in multi-agent systems (MASs), where the communication topology is dynamically optimized using quantum algorithms. This work highlights the potential of combining distributed control with near-term quantum computing for intelligent networked systems. At first, we revisit classical consensus control for both first-order and second-order agent dynamics and model the resulting closed-loop systems under dynamic communication topologies. We then formulate the topology selection problem as a quadratic unconstrained binary optimization (QUBO) problem, incorporating application-aware cost terms such as communication cost, inter-agent distance, security, and connectivity constraints. While classical topology optimization methods for consensus control can solve the problem effectively, they struggle to scale as the system size increases. Quantum optimization offers a promising alternative, with the potential for greater efficiency and even exponential speedup over classical approaches in some instances. We solve the QUBO using the variational quantum eigensolver (VQE), leveraging monolithic and distributed quantum computing. Simulation results demonstrate the effectiveness of the proposed approaches in executing consensus.
This paper proposes a quantum framework for the design of communication topologies in consensus-based multi-agent systems. The communication graph is selected online by solving a mixed-integer quadratic program (MIQP) that minimizes a cost combining communication and distance penalties with degree-regularization terms, while enforcing exact connectivity through a flow-based formulation. To cope with the combinatorial complexity of this NP-hard problem, we develop a three-block ADMM scheme that decomposes the MIQP into a convex quadratic program in relaxed edge and flow variables, a pure binary unconstrained subproblem, and a closed-form auxiliary update. The binary subproblem is mapped to a quadratic unconstrained binary optimization (QUBO) Hamiltonian and approximately solved via quantum imaginary time evolution (QITE). The resulting time-varying, optimizer-generated Laplacians are applied to linear first- and second-order consensus dynamics. Numerical simulations on networks demonstrate that the proposed method produces connected topologies that satisfy degree constraints, achieve consensus, and incur costs comparable to those of classical mixed-integer solvers, thereby illustrating how quantum algorithms can be embedded as topology optimizers within closed-loop distributed control architectures.
Optimization models for large smart grids need to consider network constraints, renewable energy uncertainty, storage dynamics and flexible demand simultaneously. The mixed discrete-continuous nature of these problems is not suitable for the operational time constraints, and a single quantum processor cannot yet handle real grid instances. A distributed quantum computing framework for an electrical network is proposed in this paper, which divides the network into coupled regions, assigns compact quadratic unconstrained binary optimisation subproblems to heterogeneous quantum workers, and employs an asynchronous classical coordinator to enforce boundary consensus. The four components of the framework are adaptive penalty encoding, warm-started variational circuits, confidence-aware result aggregation and projection-based feasibility repair. A reproducible simulation study is constructed for modified 33-bus, 118-bus, 300-bus and 1354-bus systems with renewable generation, batteries and responsive loads. In all the test cases, the proposed method reduced the operating cost and constraint violation compared with centralised QAOA, quantum annealing, ADMM, and mixed-integer programming under the same time budget. It still performs reasonably well under high worker latency and depolarising noise. Based on the above results, near-term quantum resources will be more credible as coordinated regional accelerators than as a single grid optimizer. Therefore, it will be presented as an engineering architecture, an explicit optimisation map and a multi-metric evaluation system for scalable quantum-assisted smart grid operation.
Abstract The convergence of quantum optimization and autonomous agentic reasoning defines a new computational frontier in large-scale resource coordination. This work introduces Q-PACT, a Quantum-Parallel Agentic Coordination Toolkit that unifies quantum optimization, fairness-driven orchestration, and adaptive multi-agent intelligence into a reproducible hybrid framework. Q-PACT addresses a key limitation in distributed and cloud-based quantum infrastructures; inefficient, inequitable scheduling of scarce quantum resources among competing agents and tasks. The proposed architecture formulates multi-agent scheduling as a Quadratic Unconstrained Binary Optimization (QUBO) model, solved through a heterogeneous pipeline integrating quantum annealing (D-Wave), variational optimization (QAOA on IonQ/Azure), and classical meta-heuristics. A noise-aware encoder, solver-adapter layer, and agentic manager collaborate to maintain fairness, adaptability, and load balance, while the QML-AURA subsystem continuously refines solver hyperparameters through feedback-driven variational learning. Q-PACT’s hybrid orchestration layer enables dynamic re-optimization, fault-tolerant fallback execution, and secure artifact exchange across distributed backends, achieving resilience under the noise and queueing constraints of NISQ-era hardware. Empirical evaluations demonstrate significant improvements in makespan reduction, workload variance, and energy minimization compared with classical heuristics, establishing the viability of quantum-assisted agentic scheduling at scale. By bridging quantum optimization paradigms, multi-agent systems, and fairness-aware orchestration, Q-PACT provides a foundational blueprint for the next generation of autonomous, cloud-integrated, and quantum-enabled coordination systems.
As quantum computing transitions into the Noisy Intermediate-Scale Quantum (NISQ) era, scaling monolithic quantum processors remains a significant challenge due to decoherence and operational noise. This dissertation proposes enhancing the connectivity of distributed quantum systems as a scalable solution, focusing on three major research tasks: architectural co-design, operation scheduling optimization, and network topology design. First, to address the physical qubit limits of single-chip processors, we investigate the co-design of network topology and logical qubit allocation for Distributed Quantum Computing (DQC). By modeling qubit interaction as a graph partition problem, we propose a joint optimization framework to minimize inter-QPU communication overhead. Our results demonstrate that the proposed linearized formulation, TACO-L, significantly outperforms traditional two-stage methods in executing complex quantum circuits. Second, we address the challenge of maintaining high-fidelity long-distance entanglements through the optimization of Swapping and Purification Schemes (SPS). We prove that in Binary systems, any optimal swapping and purification tree (OSPT) must follow a Restricted SPT (RT) pattern, where purification is integrated at the link level prior to swapping. Furthermore, we introduce the gradient-based GradTree algorithm, which enables an efficient search for low-cost, high-fidelity scheduling in complex noise environments. Finally, this dissertation formulates the first general Topology Design Problem (TDP) for quantum networks, jointly optimizing quantum memory allocation, optical channel deployment, and entanglement scheduling. By analyzing flow-based and path-based formulations, we prove the optimality of the Relaxed Complete Swapping Tree (RCST) in minimizing the expected cost of entanglement distribution. Collectively, these contributions provide a comprehensive theoretical and algorithmic framework for building scalable, cost-effective global quantum internet architectures.
The emerging paradigm of distributed quantum computing promises a potential solution to scaling quantum computing to currently unfeasible dimensions. While this approach itself is still in its infancy, and many obstacles must still be overcome before its physical implementation, challenges from the software and algorithmic side must also be identified and addressed. For instance, this paradigm shift requires a new form of compiler that considers the network constraints in general as well as phenomena arising due to the nature of quantum communication. In distributed quantum computing, large circuits are divided into smaller subcircuits such that they can be executed individually and simultaneously on multiple QPUs that are connected through quantum channels. As quantum communication, for example, in the form of teleportation, is expensive, it must be used sparingly. We address the problem of assigning qubits to QPUs to minimize communication costs in two different ways. First by applying time-aware algorithms that take into account the changing connectivity of a given circuit as well as the underlying network topology. We define the optimization problem, use simulated annealing and an evolutionary algorithm and compare the results to graph partitioning and sequential qubit assignment baselines. In another approach, we propose an evolutionary-based quantum circuit optimization algorithm that adjusts the circuit itself rather than the schedule to reduce the overall communication cost. We evaluate the techniques against random circuits and different network topologies. Both evolutionary algorithms outperform the baseline in terms of communication cost reduction. We give an outlook on how the approaches can be integrated into a compilation framework for distributed quantum computing.
Multi-objective combinatorial optimization in wireless communication networks is a challenging task, particularly for large-scale and diverse topologies. Recent advances in quantum computing offer promising solutions for such problems. Coherent Ising Machines (CIM), a quantum-inspired algorithm, leverages quantum properties of coherent light, enabling faster convergence to the ground state. This paper applies CIM to multiobjective routing optimization in wireless multi-hop networks. We formulate the routing problem as a Quadratic Unconstrained Binary Optimization (QUBO) problem, and map it onto an Ising model, allowing CIM to solve it. CIM demonstrates strong scalability across diverse network topologies without requiring topology-specific adjustments, overcoming the limitations of traditional quantum algorithms like Quantum Approximate Optimization Algorithm (QAOA) and Variational Quantum Eigensolver (VQE). Our results show that CIM provides feasible and near-optimal solutions for networks containing hundreds of nodes and thousands of edges. Additionally, a complexity analysis highlights CIM's increasing efficiency as network size grows.