Optimization of deterministic photonic graph state generation via local operations

TL;DR

This paper presents an optimization technique for deterministic photonic graph state generation that significantly reduces the required quantum gates by leveraging local Clifford equivalency and graph theory.

Contribution

It introduces a novel optimization method based on local Clifford equivalency and graph correlations to reduce gate counts in photonic graph state generation.

Findings

50% reduction in 2-qubit gate usage for large repeater graph states

Significant gate count reductions for random dense graphs

Enhanced efficiency in photonic graph state protocols

Abstract

Realizing photonic graph states, crucial in various quantum protocols, is challenging due to the absence of deterministic entangling gates in linear optics. To address this, emitter qubits have been leveraged to establish and transfer the entanglement to photons. We introduce an optimization method for such protocols based on the local Clifford equivalency of states and the graph theoretical correlations of the generation cost parameters. Employing this method, we achieve a 50% reduction in use of the 2-qubit gates for generation of the arbitrary large repeater graph states and similar significant reductions in the total gate count for generation of random dense graphs.