Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
140 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Zero forcing, linear and quantum controllability for systems evolving on networks (1111.1475v1)

Published 7 Nov 2011 in quant-ph, cond-mat.dis-nn, cond-mat.stat-mech, and math.CO

Abstract: We study the dynamics of systems on networks from a linear algebraic perspective. The control theoretic concept of controllability describes the set of states that can be reached for these systems. Under appropriate conditions, there is a connection between the quantum (Lie theoretic) property of controllability and the linear systems (Kalman) controllability condition. We investigate how the graph theoretic concept of a zero forcing set impacts the controllability property. In particular, we prove that if a set of vertices is a zero forcing set, the associated dynamical system is controllable. The results open up the possibility of further exploiting the analogy between networks, linear control systems theory, and quantum systems Lie algebraic theory. This study is motivated by several quantum systems currently under study, including continuous quantum walks modeling transport phenomena. Additionally, it proposes zero forcing as a new notion in the analysis of complex networks.

Summary

We haven't generated a summary for this paper yet.