Papers › Hard limits on the postselectability of optical graph states
Hard limits on the postselectability of optical graph states
Jeremy C. Adcock, Sam Morley-Short, Joshua W. Silverstone, Mark G. Thompson
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Coherent control of large entangled graph states enables a wide variety of quantum information processing tasks, including error-corrected quantum computation. The linear optical approach offers excellent control and coherence, but today most photon sources and entangling gates---required for the construction of large graph states---are probabilistic and rely on postselection. In this work, we provide proofs and heuristics to aid experimental design using postselection. We derive a fundamental limitation on the generation of photonic qubit states using postselected entangling gates: experiments which contain a cycle of postselected gates cannot be postselected. Further, we analyse experiments that use photons from postselected photon pair sources, and lower bound the number of classes of graph state entanglement that are accessible in the non-degenerate case---graph state entanglement classes that contain a tree are are always accessible. Numerical investigation up to 9-qubits shows that the proportion of graph states that are accessible using postselection diminishes rapidly. We provide tables showing which classes are accessible for a variety of up to nine qubit resource states and sources. We also use our methods to evaluate near-term multi-photon experiments, and provide our algorithms for doing so.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections