For a class of graph states with commuting controlled-rotation gates, the Fubini-Study entanglement distance depends only on the vertex degree sequence, and this paper works out explicit formulas for four example graph families.
Entanglement in Directed Graph States
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We investigate a family of quantum states defined by directed graphs, where the oriented edges represent interactions between ordered qubits. As a measure of entanglement, we adopt the Entanglement Distance - a quantity derived from the Fubini - Study metric on the system's projective Hilbert space. We demonstrate that this measure is entirely determined by the vertex degree distribution and remains invariant under vertex relabeling, underscoring its topological nature. Consequently, the entanglement depends solely on the total degree of each vertex, making it insensitive to the distinction between incoming and outgoing edges. These findings offer a geometric interpretation of quantum correlations and entanglement in complex systems, with promising implications for the design and analysis of quantum networks.
citation-role summary
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Entanglement in Quantum Systems Based on Directed Graphs
For a class of graph states with commuting controlled-rotation gates, the Fubini-Study entanglement distance depends only on the vertex degree sequence, and this paper works out explicit formulas for four example graph families.