Heralded arbitrary graph states with inefficient quantum emitters

Photonic graph states produced from quantum emitters is a promising approach in quantum computation and communication. We introduce a heralded scheme for making photonic graph states that relaxes the high photon collection efficiency requirements on the emitters. We demonstrate the scaling advantage of this scheme and outline additional overheads. Furthermore, we show that our scheme can be simplified for measurement-based computation, leading to significantly higher rates. Additionally, we present estimates of the fidelity to produce graph states of various sizes.