Distributing graph states over arbitrary quantum networks

Clément Meignant, Damian Markham, and Frédéric Grosshans
Phys. Rev. A 100, 052333 – Published 27 November 2019

Abstract

Multipartite entangled states are great resources for quantum networks. In this work, we study the distribution, or routing, of entangled states over fixed, but arbitrary, physical networks. Our simplified model represents each use of a quantum channel as the sharing of a Bell pair; local operations and classical communications are considered to be free. We introduce two protocols to distribute, respectively, Greenberger-Horne-Zeilinger (GHZ) states and arbitrary graph states over arbitrary quantum networks. The GHZ states' distribution protocol takes a single step and is optimal in terms of the number of Bell pairs used; the graph states' distribution protocol uses, at most, twice as many Bell pairs and steps as the optimal routing protocol for the worst-case scenario.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
2 More
  • Received 30 January 2019
  • Revised 20 September 2019

DOI:https://doi.org/10.1103/PhysRevA.100.052333

©2019 American Physical Society

Physics Subject Headings (PhySH)

NetworksQuantum Information, Science & Technology

Authors & Affiliations

Clément Meignant1, Damian Markham1, and Frédéric Grosshans2,1

  • 1Laboratoire d'Informatique de Paris 6, CNRS, Sorbonne Université, 4 place Jussieu, 75005 Paris, France
  • 2Laboratoire Aimé Cotton, CNRS, Université Paris-Sud, ENS Cachan, Université Paris-Saclay, 91405 Orsay Cedex, France

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 100, Iss. 5 — November 2019

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×