Hard limits on the postselectability of optical graph states
arXiv:1806.03263 · doi:10.1088/2058-9565/aae950
Abstract
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.
arXiv commentOur manuscript comprises 4843 words, 6 figures, 1 table, 47 references, and a supplementary material of 1741 words, 2 figures, 1 table, and a Mathematica code listing
References in corpus (34)
- Significant-loophole-free test of Bell's theorem with entangled photons
- A strong loophole-free test of local realism
- Experimental One-Way Quantum Computing
- Multi-party entanglement in graph states
- Observation of three-photon Greenberger-Horne-Zeilinger entanglement
- Multidimensional quantum entanglement with large-scale integrated optics
- Resource-efficient linear optical quantum computation
- Experimental entanglement of six photons in graph states
- Experimental Four-photon Entanglement and High-fidelity Teleportation
- Experimental ten-photon entanglement
- Graph States for Quantum Secret Sharing
- Observation of eight-photon entanglement
- Quantum error-correcting codes associated with graphs
- Linear Optical CNOT Gate in the Coincidence Basis
- Silicon Quantum Photonics
- Graphical description of the action of local Clifford transformations on graph states
- A quantum delayed choice experiment
- From three-photon GHZ states to ballistic universal quantum computation
- Breeding the optical Schroedinger's cat state
- Quantum phase gate for photonic qubits using only beam splitters and post-selection
- Fast simulation of stabilizer circuits using a graph state representation
- Resource costs for fault-tolerant linear optical quantum computing
- Quantum Experiments and Graphs: Multiparty States as coherent superpositions of Perfect Matchings
- On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12
- Scalable Generation of Graph-State Entanglement through Realistic Linear Optics
- Quantum Experiments and Graphs II: Quantum Interference, Computation and State Generation
- Optimal preparation of graph states
- Transforming graph states using single-qubit operations
- Physical-depth architectural requirements for generating universal photonic cluster states
- Which multiphoton states are related via linear optics?
- Weaving independently generated photons into an arbitrary graph state
- Experimental characterization of photonic fusion using fiber sources
- Edge Local Complementation and Equivalence of Binary Linear Codes
- Complexity of Graph State Preparation
Cited by in corpus (16)
- Programmable four-photon graph states on a silicon chip
- Error protected qubits in a silicon photonic chip
- Graph States as a Resource for Quantum Metrology
- Advances in silicon quantum photonics
- A scheme for universal high-dimensional quantum computation with linear optics
- Mapping graph state orbits under local complementation
- Improved Heralded Schemes to Generate Entangled States From Single Photons
- High photon-loss threshold quantum computing using GHZ-state measurements
- Quantum verification and estimation with few copies
- Graph-theoretical optimization of fusion-based graph state generation
- Expanding the Quantum Photonic Toolbox in AlGaAsOI
- Efficient Entanglement Measure for Graph States
- Heralded generation of entanglement with photons
- Mitigating indistinguishability issues in photon pair sources by delayed-pump Intermodal Four Wave Mixing
- Optimization of deterministic photonic graph state generation via local operations
- Heralded Optical Entanglement Generation via the Graph Picture of Linear Quantum Networks