Graphs of unitary matrices and positive semidefinite zero forcing
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4080919 (Why is no real title available?)
- scientific article; zbMATH DE number 4080920 (Why is no real title available?)
- A further look into combinatorial orthogonality
- A simple proof of Fiedler's conjecture concerning orthogonal matrices
- Approximate locality for quantum systems on graphs
- From quantum cellular automata to quantum lattice gases
- Locality for quantum systems on graphs depends on the number field
- Lower bounds in minimum rank problems
- On the Digraph of a Unitary Matrix
- One-dimensional quantum walks
- Positive semidefinite zero forcing
- Quadrangularity and strong quadrangularity in tournaments
- Quantum walks on graphs
- Rational orthogonal versus real orthogonal
- Sign pattern matrices that allow orthogonality
- Sparse orthogonal matrices.
- The possible numbers of zeros in a orthogonal matrix
- Unitary matrix digraphs and minimum semidefinite rank
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- Zero forcing sets and the minimum rank of graphs
Cited in
(7)
This page was built for publication: Graphs of unitary matrices and positive semidefinite zero forcing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2447097)