Generation of graph-state streams
Daniel Ballester, Jaeyoon Cho, and M. S. Kim

TL;DR
This paper introduces a protocol for generating streams of mobile qubits in graph states using a stationary qubit, with practical implementations for photonic and atomic systems, aiming to advance fault-tolerant quantum computing.
Contribution
It presents a novel protocol for creating graph-state streams with feasible physical implementations, reducing resource needs for linear optics quantum computation.
Findings
Proposes a protocol for graph-state stream generation.
Discusses physical implementations with atom-like and cavity-mode photonic qubits.
Introduces a heralded scheme for high-fidelity states under photon loss.
Abstract
We propose a protocol to generate a stream of mobile qubits in a graph state through a single stationary parent qubit and discuss two types of its physical implementation, namely, the generation of photonic graph states through an atom-like qubit and those of flying atoms through a cavity-mode photonic qubit. The generated graph states fall into an important class that can hugely reduce the resource requirement of fault-tolerant linear optics quantum computation, which was previously known to be far from realistic. In regard to the flying atoms, we also propose a heralded generation scheme, which allows for high-fidelity graph states even under the photon loss.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
