Photonic resource state generation from a minimal number of quantum emitters

TL;DR

This paper introduces an efficient algorithm that determines the minimal number of quantum emitters and operation sequences needed to generate large multi-photon entangled graph states, advancing quantum communication and computing capabilities.

Contribution

The paper presents a polynomial-scaling algorithm that finds optimal emitter configurations and sequences for creating large multi-photon graph states.

Findings

Algorithm scales polynomially with graph state size

Enables generation of graph states with hundreds or thousands of photons

Provides a systematic method for minimal resource state generation

Abstract

Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically active quantum dots or defects, atomic systems, or superconducting qubits. However, finding efficient schemes to produce such states has been a long-standing challenge. Here, we present an algorithm that, given a desired multi-photon graph state, determines the minimum number of quantum emitters and precise operation sequences that can produce it. The algorithm itself and the resulting operation sequence both scale polynomially in the size of the photonic graph state, allowing one to obtain efficient schemes to generate graph states containing hundreds or thousands of photons.