Graphs of unitary matrices and positive semidefinite zero forcing
From MaRDI portal
Publication:2447097
DOI10.1016/S0034-4877(14)60020-3zbMath1286.15036MaRDI QIDQ2447097
Craig E. Larson, Brian Lins, Lon H. Mitchell
Publication date: 24 April 2014
Published in: Reports on Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0034-4877(14)60020-3
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lower bounds in minimum rank problems
- A simple proof of Fiedler's conjecture concerning orthogonal matrices
- From quantum cellular automata to quantum lattice gases
- Sparse orthogonal matrices.
- Sign pattern matrices that allow orthogonality
- Positive semidefinite zero forcing
- Zero forcing sets and the minimum rank of graphs
- Unitary matrix digraphs and minimum semidefinite rank
- Locality for quantum systems on graphs depends on the number field
- Approximate Locality for Quantum Systems on Graphs
- A further look into combinatorial orthogonality
- Rational Orthogonal versus Real Orthogonal
- The possible numbers of zeros in a orthogonal matrix
- On the Digraph of a Unitary Matrix
- One-dimensional quantum walks
- Quantum walks on graphs
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks