Closed-form sector length distributions for recursively definable graph states (paths, cycles, stars, grids) via generating functions, yielding analytical concentratable entanglement, depolarizing fidelity bounds, and multipartite entanglement criteria.
For the first case, we consider the contributions when all the vertices are white, from which we find from Equation (D3) that it is given by 1 1−xz
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sector length distributions of recursively definable graph states through analytic combinatorics
Closed-form sector length distributions for recursively definable graph states (paths, cycles, stars, grids) via generating functions, yielding analytical concentratable entanglement, depolarizing fidelity bounds, and multipartite entanglement criteria.