arXiv:2609.30400
Generation of Photonic Graph States with minimal number of quantum emitters
Konstantinos-Rafail Revis, Nils Tomke Ottink, Pierre-Emmanuel Emeriau, Paul Hilaire
Abstract
Graph states are a fundamental resource for measurement and fusion-based quantum computing, quantum networks, and sensing. Preparing them in a photonic system deterministically is, in principle, possible, but finding efficient schemes to prepare them was a long-standing problem addressed recently. Additionally, heuristic optimization schemes for reducing the required number of two-qubit gates were developed. However, the problem of reducing the number of emitters by optimizing the emission ordering was not addressed, due to its computational complexity, as it is connected to a well-known NP-hard problem from graph theory, the linear rank width computation. In this work, we focus on developing heuristic polynomial algorithms to reduce the number of emitters required. In total, we propose four distinct algorithms, which demonstrate up to $30\%$ emitter reduction on random graphs. Furthermore, we provide numerical and statistical evidence that the combination of our optimization schemes with the preexisting algorithms for optimizing the two-qubit gates of the preparation protocol can further reduce them by around $20\%$. Finally, we examine the developed algorithms for various useful graph state families, such as graphs useful for measurement-based quantum algorithms, and cluster states and graph codes used for quantum error correction, to determine the performance of each algorithm.
AI Summary
The paper studies how choosing the photon-emission order can reduce the matter-qubit resources needed for deterministic emitter-based preparation of photonic graph states. For a fixed order, the minimum emitter count is the maximum binary cut-rank across successive cuts; minimizing this over orders gives the graph’s linear rank-width, an NP-hard optimization problem. The contribution is heuristic ordering optimization rather than an exact solution. Four methods are developed: bottleneck-focused hill climbing, simulated annealing of the maximum cut-rank, path-based clustering with local and global annealing, and annealing using minimum linear arrangement as a proxy objective. The pipeline also uses greedy local-complementation edge reduction and structured initial orderings. Evaluation combines numerical benchmarks on Erdős–Rényi graphs, comparisons with existing emitter-CNOT optimizers, and tests on MBQC resource states, RHG lattices, and error-correcting-code graphs containing up to 490 vertices. Against random emission orders, emitter reductions reach approximately 30%. Adding ordering optimization before existing CNOT-reduction algorithms gives mean additional CNOT reductions of roughly 20–26%, depending on the method. For the 90-photon $(2,2,2)$ RHG lattice, the best reported result uses 11 emitters versus 12 in the cited comparison. The methods have no global-optimality guarantees and can miss known minima. Performance depends on graph family and resource metric: minimizing emitters need not minimize CNOTs or total gates, and some total-gate counts increase. Percentage improvements diminish with graph size in the random-graph tests. Tailored generation protocols can outperform these general heuristics; joint resource optimization and theoretical explanations of the observed correlations remain open.
Error found: The optional reheating implementation can loop forever for permitted parameters, so its polynomial-time characterization requires additional parameter restrictions or an iteration cap. The induced path-neighborhood clusters need not be caterpillars or have bounded linear rank-width, invalidating the stated structural justification for their low emitter requirements.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 45 pages, 33 figures