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.
Van den Nest, Measurement-based quantum compu- tation, Nature Physics5, 19 (2009)
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.