Hard limits on the postselectability of optical graph states
| Autor: | Sam Morley-Short, Mark G. Thompson, Jeremy C. Adcock, Joshua W. Silverstone |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
Theoretical computer science
Physics and Astronomy (miscellaneous) photon sources Computer science Materials Science (miscellaneous) FOS: Physical sciences Quantum entanglement Graph state 01 natural sciences 010305 fluids & plasmas QETLabs 0103 physical sciences numerical methods postselection Electrical and Electronic Engineering 010306 general physics Quantum computer Quantum Physics Probabilistic logic photonic experiment design Linear optical quantum computing graph states Atomic and Molecular Physics and Optics Postselection linear optical quantum computing Qubit Graph (abstract data type) Quantum Physics (quant-ph) entanglement |
| Zdroj: | Adcock, J C, Morley-Short, S, Silverstone, J W & Thompson, M G 2019, ' Hard limits on the postselectability of optical graph states ', Quantum Science and Technology, vol. 4, no. 1, 015010 . https://doi.org/10.1088/2058-9565/aae950 |
| Popis: | 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. Our 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 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|