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

Asian Control Conference (ASCC)

LQ Performance of Multi-Agent Quantum System

Truptimayee Nayak, Jatin Kumar Pradhan, Rajiv Kumar Mishra

Published Jun 1, 2026• 0 citations
Publisher

Abstract

For a multi-agent quantum system, this work suggests a distributed consensus-based control to attain linear-quadratic (LQ) performance. When a bilinear problem arises during the problem formulation step, the State Dependent Riccati equation (SDRE) is used. Synchronization is achieved in the studied quantum networks by distributed control. Using Lyapunov theory, the asymptotic stability criterion is developed. The new approach is demonstrated by analyzing a network of spin-1/2 quantum entities. Convergence of state populations, along with the geometrical alignment of Bloch vectors, is demonstrated numerically, confirming the effectiveness of the method proposed. The novel framework offers a systematic approach to stabilization and coordination of quantum networks having finite dimensions.

DOI
10.1109/ascc70886.2026.11702229

Related papers

Quantum Consensus Algorithms: A Brief Survey and Characterization

Hyungseop Yu, Hyo‐Sung Ahn, Kwang‐Kyo Oh

This paper presents a control-theoretic survey of four representative quantum consensus algorithms, with a focus on their convergence properties and implementation feasibility. The selected algorithms—ranging from gossip-based method to measurement-based feedback method and geometric control methods—exhibit fundamentally different convergence targets, including symmetric state consensus and directional alignment of Bloch vectors. Each approach is analyzed in terms of its dynamical structure, physical requirements, and control complexity. To show their performance, numerical simulations are conducted on a 3-qubit network under a fully connected topology. The results imply the trade-offs between convergence strength, coherence preservation, and practical implementability, offering insights for the design of distributed control protocols in quantum networks.

IFAC-PapersOnLine•Jan 1, 2025•0 citations

Lyapunov-based fixed-time stabilization control of quantum systems

Xiaolei Li, Changyun Wen, Jian‐Ge Wang

In this paper, we consider the fixed-time stabilization control problem of quantum systems modeled by Schrödinger equations. Firstly, the Lyapunov-based fixed-time stability criterion is extended to finite-dimensional closed quantum systems in the form of coherence vectors. Then for a two-level quantum system with single control input, a non-smooth fractional-order control law is designed using the relative state distance. By integrating the fixed-time Lyapunov control technique and the bi-limit homogeneity theory, the quantum system is proved to be stabilized to an eigenstate of the inherent Hamiltonian in a fixed time. Comparing with existing methods in quantum system control, the proposed approach can guarantee stabilization in a fixed time without depending on the initial states.

Journal of Automation and Intelligence•Dec 1, 2022•23 citations

Distributed Partial Quantum Consensus of Qubit Networks With Connected Topologies

Xin Jin, Zhu Cao, Yang Shan Tang +1 more

In this article, we consider the partial quantum consensus problem of a qubit network in a distributed view. The local quantum operation is designed based on the Hamiltonian by using the local information of each quantum system in a network of qubits. We construct the unitary transformation for each quantum system to achieve the partial quantum consensus, that is, the directions of the quantum states in the Bloch ball will reach an agreement. A simple case of two-qubit quantum systems is considered first, and a minimum completing time of reaching partial consensus is obtained based on the geometric configuration of each qubit. Furthermore, we extend the approaches to deal with the more general N -qubit networks. Two partial quantum consensus protocols, based on the Lyapunov method for chain graphs and the geometry method for connected graphs, are proposed. The geometry method can be utilized to deal with more general connected graphs, while for the Lyapunov method, the global consensus can be obtained. The numerical simulation over a qubit network is demonstrated to verify the validity and the effectiveness of the theoretical results.

arXiv:2402.14256•IEEE Transactions on Cybernetics•Feb 19, 2024•7 citations

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

Milad Hasanzadeh, Amin Kargarian

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.

Southeast Symposium on Contemporary Engineering Topics (SSCET)•Aug 1, 2026•0 citations

Distributed Feedback Control of Quantum Networks**The Japanese version of this work was presented in Takeuchi (2015); Takeuchi & Tsumura (2015). This work is supported in part by Grant-in-Aid for Scientific Research (B) (25289127, 16H04382), Japan Society for the Promotion of Science.

Reiji Takeuchi, Koji Tsumura

: In this paper, we deal with a distributed feedback control of quantum networks called a quantum consensus algorithm (QCA) with local quantum observation and feedback proposed by Kamon & Ohki (2013, 2014) and prove strictly that QCA makes quantum states converge to a quantum state called symmetric state consensus (SSC) with probability one from arbitrary initial states keeping purity The difficulty of the proof is from that the objective system is stochastic and non-linear, and we solve it by employing the stochastic Lyapunov stability analysis. We also show that QCA can generate a desirable W-state, which is known as an important entangled quantum state and utilized for many applications of quantum information technology.

IFAC-PapersOnLine•Jan 1, 2016•4 citations

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
For a multi-agent quantum system, this work suggests a distributed consensus-based control to attain linear-quadratic (LQ) performance. When a bilinear problem arises during the problem formulation step, the State Dependent Riccati equation (SDRE) is used. Synchronization is achieved in the studied quantum networks by distributed control. Using Lyapunov theory, the asymptotic stability criterion is developed. The new approach is demonstrated by analyzing a network of spin-1/2 quantum entities. Convergence of state populations, along with the geometrical alignment of Bloch vectors, is demonstrated numerically, confirming the effectiveness of the method proposed. The novel framework offers a systematic approach to stabilization and coordination of quantum networks having finite dimensions.
This paper presents a control-theoretic survey of four representative quantum consensus algorithms, with a focus on their convergence properties and implementation feasibility. The selected algorithms—ranging from gossip-based method to measurement-based feedback method and geometric control methods—exhibit fundamentally different convergence targets, including symmetric state consensus and directional alignment of Bloch vectors. Each approach is analyzed in terms of its dynamical structure, physical requirements, and control complexity. To show their performance, numerical simulations are conducted on a 3-qubit network under a fully connected topology. The results imply the trade-offs between convergence strength, coherence preservation, and practical implementability, offering insights for the design of distributed control protocols in quantum networks.
In this paper, we consider the fixed-time stabilization control problem of quantum systems modeled by Schrödinger equations. Firstly, the Lyapunov-based fixed-time stability criterion is extended to finite-dimensional closed quantum systems in the form of coherence vectors. Then for a two-level quantum system with single control input, a non-smooth fractional-order control law is designed using the relative state distance. By integrating the fixed-time Lyapunov control technique and the bi-limit homogeneity theory, the quantum system is proved to be stabilized to an eigenstate of the inherent Hamiltonian in a fixed time. Comparing with existing methods in quantum system control, the proposed approach can guarantee stabilization in a fixed time without depending on the initial states.
In this article, we consider the partial quantum consensus problem of a qubit network in a distributed view. The local quantum operation is designed based on the Hamiltonian by using the local information of each quantum system in a network of qubits. We construct the unitary transformation for each quantum system to achieve the partial quantum consensus, that is, the directions of the quantum states in the Bloch ball will reach an agreement. A simple case of two-qubit quantum systems is considered first, and a minimum completing time of reaching partial consensus is obtained based on the geometric configuration of each qubit. Furthermore, we extend the approaches to deal with the more general N -qubit networks. Two partial quantum consensus protocols, based on the Lyapunov method for chain graphs and the geometry method for connected graphs, are proposed. The geometry method can be utilized to deal with more general connected graphs, while for the Lyapunov method, the global consensus can be obtained. The numerical simulation over a qubit network is demonstrated to verify the validity and the effectiveness of the theoretical results.
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.
: In this paper, we deal with a distributed feedback control of quantum networks called a quantum consensus algorithm (QCA) with local quantum observation and feedback proposed by Kamon & Ohki (2013, 2014) and prove strictly that QCA makes quantum states converge to a quantum state called symmetric state consensus (SSC) with probability one from arbitrary initial states keeping purity The difficulty of the proof is from that the objective system is stochastic and non-linear, and we solve it by employing the stochastic Lyapunov stability analysis. We also show that QCA can generate a desirable W-state, which is known as an important entangled quantum state and utilized for many applications of quantum information technology.
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.