Automated discovery of heralded ballistic graph state generators for fusion-based photonic quantum computation

Abstract

Designing photonic circuits that prepare graph states with high fidelity and success probability is a central challenge in linear optical quantum computing. Existing approaches rely on hand-crafted designs or fusion-based assemblies. In the absence of multiplexing/boosting, both post-selected ballistic circuits and sequential fusion exhibit exponentially decreasing single-shot yields - a fundamental limitation that makes optimizing individual resource state generators particularly important, as these serve as building blocks in larger FBQC architectures. We present a general-purpose optimization framework for automated photonic circuit discovery using a novel polynomial-based simulation approach, enabling efficient strong simulation and gradient-based optimization. Our framework employs a two-pass optimization procedure: the first pass identifies a unitary transformation that prepares the desired state with perfect fidelity and maximal success probability, and the second pass implements a novel sparsification algorithm that reduces this solution to a compact photonic circuit with minimal beamsplitter count while preserving performance. This sparsification procedure often reveals underlying mathematical structure, producing highly simplified circuits with rational reflection coefficients. We demonstrate our approach by discovering optimized circuits for $3$-, $4$-, and $5$-qubit graph states across multiple equivalence classes. For 4-qubit states, our circuits achieve success probabilities of $2.053\times 10^{-3}$ to $7.813\times 10^{-3}$, outperforming the fusion baseline by up to $4.7\times$. For 5-qubit states, we achieve $5.926\times 10^{-5}$ to $1.157\times 10^{-3}$, demonstrating up to $7.5\times$ improvement. These results include the first known state preparation circuits for certain 5-qubit graph states.

arXiv comment24 pages, 10 figures

References in corpus (21)

• Measurement-based quantum computation with cluster states
• Multi-party entanglement in graph states
• Resource-efficient linear optical quantum computation
• Experimental entanglement of six photons in graph states
• Optical quantum computation using cluster states
• 12-photon entanglement and scalable scattershot boson sampling with optimal entangled-photon pairs from parametric down-conversion
• Graphical description of the action of local Clifford transformations on graph states
• Hudson's Theorem for finite-dimensional quantum systems
• Repeat-Until-Success Quantum Computing
• Automated Search for new Quantum Experiments
• From three-photon GHZ states to ballistic universal quantum computation
• Percolation, renormalization, and quantum computing with non-deterministic gates
• Perceval: A Software Platform for Discrete Variable Photonic Quantum Computing
• An efficient algorithm to recognize local Clifford equivalence of graph states
• Conceptual understanding through efficient inverse-design of quantum optical experiments
• Improved Heralded Schemes to Generate Entangled States From Single Photons
• Digital Discovery of 100 diverse Quantum Experiments with PyTheus
• Generating entanglement with linear optics
• Strong Simulation of Linear Optical Processes
• Piquasso: A Photonic Quantum Computer Simulation Software Platform
• Heralded gate search with genetic algorithms for quantum computation