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.
A Spin-Optical Quantum Computing Architecture
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We introduce an adaptable and modular hybrid architecture designed for fault-tolerant quantum computing. It combines quantum emitters and linear-optical entangling gates to leverage the strength of both matter-based and photonic-based approaches. A key feature of the architecture is its practicality, grounded in the utilisation of experimentally proven optical components. Our framework enables the execution of any quantum error correcting code, but in particular maintains scalability for low-density parity check codes by exploiting built-in non-local connectivity through distant optical links. To gauge its efficiency, we evaluated the architecture using a physically motivated error model. It exhibits loss tolerance comparable to existing all-photonic architecture but without the need for intricate linear-optical resource-state-generation modules that conventionally rely on resource-intensive multiplexing. The versatility of the architecture also offers uncharted avenues for further advancing performance standards.
citation-role summary
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.