Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks

Date
2013-09-01
Authors
Burgarth, Daniel
D'Alessandro, Domenico
Hogben, Leslie
Severini, Simone
Young, Michael
Journal Title
Journal ISSN
Volume Title
Publisher
Altmetrics
Authors
Research Projects
Organizational Units
Mathematics
Organizational Unit
Journal Issue
Series
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. Our main result says that controllability in the quantum sense, expressed by the Lie algebra rank condition, and controllability in the sense of linear systems, expressed by the controllability matrix rank condition, are equivalent conditions. We also investigate how the graph theoretic concept of a zero forcing set impacts the controllability property; if a set of vertices is a zero forcing set, the associated dynamical system is controllable. These 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.

Description

This is a manuscript of an article published as Burgarth, Daniel, Domenico D'Alessandro, Leslie Hogben, Simone Severini, and Michael Young. "Zero forcing, linear and quantum controllability for systems evolving on networks." IEEE Transactions on Automatic Control 58, no. 9 (2013): 2349-2354. DOI: 10.1109/TAC.2013.2250075. Posted with permission.

Keywords
Control, graph, Lie algebra, quantum system, walk matrix, zero forcing
Citation
DOI
Collections