The fusion-minimization problem for photonic graph states is formalized as minimum trail cover; most bounded variants are NP-hard, but heuristics plus a TSP reduction give near-optimal fusion counts in benchmarks.
All- photonic architecture for scalable quantum com- puting with greenberger-horne-zeilinger states
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Finding trail covers: near-optimal decompositions of graph states as linear fusion networks
The fusion-minimization problem for photonic graph states is formalized as minimum trail cover; most bounded variants are NP-hard, but heuristics plus a TSP reduction give near-optimal fusion counts in benchmarks.