Heralded photonic graph states with inefficient quantum emitters

Abstract

Quantum emitter-based schemes for the generation of photonic graph states offer a promising, resource efficient methodology for realizing distributed quantum computation and communication protocols on near-term hardware. We present a heralded scheme for making photonic graph states that is compatible with the typically poor photon collection from state-of-the-art coherent quantum emitters. We demonstrate that the construction time for large graph states can be polynomial in the photon collection efficiency, as compared to the exponential scaling of current emitter-based schemes, which assume deterministic photon collection. The additional overhead here consists of an extra spin qubit plus one additional spin-spin entangling gate per photon added to the graph. While the proposed scheme requires both non-demolition measurement and efficient storage of photons in order to generate graph states for arbitrary applications, we show that many useful tasks, including measurement-based quantum computation, can be implemented without these requirements. As a use-case of our scheme, we construct a protocol for secure two-party computation that can be implemented efficiently on current hardware. Estimates of the fidelity to produce graph states used in the computation are given assuming current and near-term fidelities for highly coherent quantum emitters.

28 pages, 10 figures

References in corpus (25)

• Resource-efficient linear optical quantum computation
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Deterministic Generation of a Cluster State of Entangled Photons
• A photonic cluster state machine gun
• Entanglement of trapped-ion qubits separated by 230 meters
• High-fidelity laser-free universal control of two trapped ion qubits
• High-Fidelity Bell-State Preparation with ${}^{40}$Ca${}^{+}$ Optical Qubits
• Optically generated 2-dimensional photonic cluster state from coupled quantum dots
• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Quantum networks with neutral atom processing nodes
• Towards a deterministic interface between trapped-ion qubits and travelling photons
• A dual-species Rydberg array
• Deterministic Generation of Loss-Tolerant Photonic Cluster States with a Single Quantum Emitter
• Cavity enhanced telecom heralded single photons for spin-wave solid state quantum memories
• Fusion of deterministically generated photonic graph states
• Quantum nondemolition measurements with optical parametric amplifiers for ultrafast universal quantum information processing
• Photonic resource state generation from a minimal number of quantum emitters
• Dual-Species, Multi-Qubit Logic Primitives for Ca+/Sr+ Trapped-Ion Crystals
• Suppression of mid-circuit measurement crosstalk errors with micromotion
• Near-deterministic hybrid generation of arbitrary photonic graph states using a single quantum emitter and linear optics
• Physical-depth architectural requirements for generating universal photonic cluster states
• Tailoring fusion-based photonic quantum computing schemes to quantum emitters
• Verification of graph states in an untrusted network
• Loss-tolerant architecture for quantum computing with quantum emitters
• Minimizing resource overhead in fusion-based quantum computation using hybrid spin-photon devices