Photonic resource state generation from a minimal number of quantum emitters

Abstract

Multi-photon entangled graph states are a fundamental resource in quantum communication networks, distributed quantum computing, and sensing. These states can in principle be created deterministically from quantum emitters such as optically active quantum dots or defects, atomic systems, or superconducting qubits. However, finding efficient schemes to produce such states has been a long-standing challenge. Here, we present an algorithm that, given a desired multi-photon graph state, determines the minimum number of quantum emitters and precise operation sequences that can produce it. The algorithm itself and the resulting operation sequence both scale polynomially in the size of the photonic graph state, allowing one to obtain efficient schemes to generate graph states containing hundreds or thousands of photons.

14 pages, 8 figures

References in corpus (11)

• Multi-party entanglement in graph states
• Quantum Optical Metrology -- The Lowdown on High-N00N States
• Resource-efficient linear optical quantum computation
• Efficient quantum state tomography
• Deterministic Generation of a Cluster State of Entangled Photons
• A photonic cluster state machine gun
• Optically generated 2-dimensional photonic cluster state from coupled quantum dots
• Sequential Generation of Matrix-Product States in Cavity QED
• Fundamentals of universality in one-way quantum computation
• Realizing a Deterministic Source of Multipartite-Entangled Photonic Qubits
• Multidimensional cluster states using a single spin-photon interface coupled strongly to an intrinsic nuclear register

Cited by in corpus (29)

• Quantum repeaters: From quantum networks to the quantum internet
• Fusion of deterministically generated photonic graph states
• High-threshold quantum computing by fusing one-dimensional cluster states
• Near-deterministic hybrid generation of arbitrary photonic graph states using a single quantum emitter and linear optics
• Performance analysis of quantum repeaters enabled by deterministically generated photonic graph states
• A Spin-Optical Quantum Computing Architecture
• Deterministic generation of entangled photonic cluster states from quantum dot molecules
• Deterministic generation of qudit photonic graph states from quantum emitters
• Encoded-Fusion-Based Quantum Computation for High Thresholds with Linear Optics
• Extracting perfect GHZ states from imperfect weighted graph states via entanglement concentration
• Generalized Quantum Repeater Graph States
• Loss-tolerant architecture for quantum computing with quantum emitters
• Modular architectures to deterministically generate graph states
• Optimization of deterministic photonic graph state generation via local operations
• Architecture and protocols for all-photonic quantum repeaters
• Efficient percolation simulations for lossy photonic fusion networks
• Minimizing resource overhead in fusion-based quantum computation using hybrid spin-photon devices
• GraphiQ: Quantum circuit design for photonic graph states
• Transforming graph states via Bell state measurements
• Many-Body Entanglement in Solid-State Emitters
• Generating graph states with a single quantum emitter and the minimum number of fusions
• Measurement-Based Entanglement Distillation and Constant-Rate Quantum Repeaters over Arbitrary Distances
• Atom-mediated deterministic generation and stitching of photonic graph states
• Resource-efficient loss-aware photonic graph state preparation using atomic emitters
• Robustness of Bell Violation of Graph States to Qubit Loss
• Heralded photonic graph states with inefficient quantum emitters
• Minimising the number of edges in LC-equivalent graph states
• Hierarchical Generation and Design of Tree-Codes for Resource-Efficient Loss-Tolerant Quantum Communications
• Integrating Entanglement Purification into All-Photonic Quantum Repeaters