Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
From MaRDI portal
(Redirected from Publication:5353339)
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.
Cited in
(31)- Constructing a controllable graph under edge constraints
- The zero forcing polynomial of a graph
- Approximating the minimum rank of a graph via alternating projection
- Logic circuits from zero forcing
- On the relationships between zero forcing numbers and certain graph coverings
- Tight bounds on probabilistic zero forcing on hypercubes and grids
- On the zero forcing number and spectral radius of graphs
- On the zero forcing number and propagation time of oriented graphs
- Probabilistic zero forcing on random graphs
- On leaky forcing and resilience
- Graphs of unitary matrices and positive semidefinite zero forcing
- On the universality of the quantum approximate optimization algorithm
- Fractional zero forcing via three-color forcing games
- Failed skew zero forcing on a graph
- Zero forcing number, constrained matchings and strong structural controllability
- k-forcing number for Cartesian product of some graphs
- Failed zero forcing and critical sets on directed graphs
- Proper colorings from positive semidefinite zero forcing sets
- Controllability of NEPSes of graphs
- Zero forcing propagation time on oriented graphs
- Leaky forcing: a new variation of zero forcing
- Controlled transport in chiral quantum walks on graphs
- On the zero forcing number of the complement of graphs with forbidden subgraphs
- Quantum speed limits from symmetries in quantum control
- Well-failed graphs
- Minimum leader selection for controllability of undirected graphs with leader-follower framework
- Leaky positive semidefinite forcing on graphs
- Exploring the influence of graph operations on zero forcing sets
- The controllability and structural controllability of Laplacian dynamics
- Zero forcing of generalized hierarchical products
- The zero forcing number of expanded paths and cycles
This page was built for publication: Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5353339)
