Distributing Graph States Across Quantum Networks

Abstract

Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which local operations are free-and EPR pairs shared between nodes that can continually be generated. We prove upper bounds for our approach on the number of EPR pairs consumed, number of timesteps taken, and amount of classical communication required, all of which are equal to or better than that of prior work. We also reduce the problem of minimizing the number of timesteps taken to distribute a graph state using our approach to a network flow problem having polynomial time complexity.

10 pages, 9 figures. Published in QCE2021. This version fixes a typo in the introduction

References in corpus (10)

• Measurement-based quantum computation
• Multi-party entanglement in graph states
• A quantum network stack and protocols for reliable entanglement-based networks
• Modular architectures for quantum networks
• Distributing Graph States Over Arbitrary Quantum Networks
• Graph States as a Resource for Quantum Metrology
• Distributed quantum information processing with minimal local resources
• Growth of graph states in quantum networks
• Probabilistic growth of large entangled states with low error accumulation
• Bounds on the radius and status of graphs

Cited by in corpus (10)

• Influence of noise in entanglement-based quantum networks
• Quantum MAC: Genuine Entanglement Access Control via Many-Body Dicke States
• Imperfect quantum networks with tailored resource states
• Generating $k$ EPR-pairs from an $n$-party resource state
• Fidelity-Aware Multipath Routing for Multipartite State Distribution in Quantum Networks
• Many-body quantum resources of graph states
• Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network
• Quantum Advantage in Distributed Sensing with Noisy Quantum Networks
• A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks
• Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations