Searcharxiv⌕ Search

arXiv subjects

Chengyang Jiang

Publications and source records attributed to Chengyang Jiang.

2 recordsLinked to original sources

Quantum Network Flows That Solve Linear Equations

We develop a distributed quantum network flow for solving linear equations from locally stored row data. Local pumping enforces each node's equation constraint, while neighboring registers interact through swaps. The node marginals obey an exact, closed flow combining consensus with local constraint enforcement. For consistent equations, all node states converge exponentially to a common state supported on the solution space; a unique solution yields full-network convergence to the product solution state. For inconsistent equations of full column rank, scaled encoding and readout recover the least-squares solution through successive large-gain and small-scale limits. For consistent systems, the marginal convergence rate is nondecreasing and concave in the swap gain, approaching a graph-independent limit for fixed local dissipators. Its leading finite-gain correction couples graph topology and row placement through the Laplacian pseudoinverse, enabling semidefinite optimization of edge rates under a fixed total swap-rate budget. For invertible systems, a dissipative HHL-type construction using the same pumping law provides a comparison of solution-state encodings, decay rates, and row-update locality under squared-row-norm pumping. Numerical examples are provided to validate the presented results.

eess.SY↗

Distributed Nash Equilibrium Seeking with Logarithmic Bit Rates over Digital Channels

This paper introduces quantization techniques to reduce the communication complexity in the distributed Nash equilibrium (NE) seeking problem, achieving an exponential reduction in bit rates over digital channels. The goal of distributed NE seeking algorithms is to coordinate agents in a network game toward equilibrium through iterative message exchanges among them via a communication network. The computational complexity of this distributed algorithm critically depends on network communication overhead in the digital channel, motivating the development of communication reduction mechanism. Regarding this, we proposed some quantizers based on sparsification and uniform quantization through a general class of ultimate-boundedness-based quantizers. Based on this, we propose a Passivity-Based NE seeking Algorithm with Time-varying scaling Error state Quantization (PBA-TEQ), and show that the linear convergence can be achieved under a sufficient condition. Moreover, when employing either the scalarization quantizer or the greedy quantizer, both belonging to the ultimate-boundedness-based quantizers, within the PBA-TEQ framework, we establish a lower bound on communication complexity of $\log_2(\mathcal{O}(nd))$ bit rates per transmission to achieve unbiased linear convergence, with $n$ being the number of agents and $d$ being the dimension of the decision state of the network game. Numerical simulation examples are provided to validate our theoretical results.

eess.SY↗