No graph state is preparable in quantum networks with bipartite sources and no classical communication
Abstract In research concerning quantum networks, it is often assumed that the parties can classically communicate with each other. However, classical communication might introduce a substantial delay to the network, especially if it is large. As the latency of a network is one of its most important...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Nature Portfolio
2023-11-01
|
| Series: | npj Quantum Information |
| Online Access: | https://doi.org/10.1038/s41534-023-00789-3 |
| _version_ | 1797557467336409088 |
|---|---|
| author | Owidiusz Makuta Laurens T. Ligthart Remigiusz Augusiak |
| author_facet | Owidiusz Makuta Laurens T. Ligthart Remigiusz Augusiak |
| author_sort | Owidiusz Makuta |
| collection | DOAJ |
| description | Abstract In research concerning quantum networks, it is often assumed that the parties can classically communicate with each other. However, classical communication might introduce a substantial delay to the network, especially if it is large. As the latency of a network is one of its most important characteristics, it is interesting to consider quantum networks in which parties cannot communicate classically and ask what limitations this assumption imposes on the possibility of preparing multipartite states in such networks. We show that graph states of an arbitrary prime local dimension known for their numerous applications in quantum information cannot be generated in a quantum network in which parties are connected via sources of bipartite quantum states and the classical communication is replaced by some pre-shared classical correlations. We then generalise our result to arbitrary quantum states that are sufficiently close to graph states. |
| first_indexed | 2024-03-10T17:17:27Z |
| format | Article |
| id | doaj.art-b24624e72c4148eb84f3b443a316b59a |
| institution | Directory Open Access Journal |
| issn | 2056-6387 |
| language | English |
| last_indexed | 2024-03-10T17:17:27Z |
| publishDate | 2023-11-01 |
| publisher | Nature Portfolio |
| record_format | Article |
| series | npj Quantum Information |
| spelling | doaj.art-b24624e72c4148eb84f3b443a316b59a2023-11-20T10:28:18ZengNature Portfolionpj Quantum Information2056-63872023-11-01911510.1038/s41534-023-00789-3No graph state is preparable in quantum networks with bipartite sources and no classical communicationOwidiusz Makuta0Laurens T. Ligthart1Remigiusz Augusiak2Center for Theoretical Physics, Polish Academy of SciencesInstitute for Theoretical Physics, University of CologneCenter for Theoretical Physics, Polish Academy of SciencesAbstract In research concerning quantum networks, it is often assumed that the parties can classically communicate with each other. However, classical communication might introduce a substantial delay to the network, especially if it is large. As the latency of a network is one of its most important characteristics, it is interesting to consider quantum networks in which parties cannot communicate classically and ask what limitations this assumption imposes on the possibility of preparing multipartite states in such networks. We show that graph states of an arbitrary prime local dimension known for their numerous applications in quantum information cannot be generated in a quantum network in which parties are connected via sources of bipartite quantum states and the classical communication is replaced by some pre-shared classical correlations. We then generalise our result to arbitrary quantum states that are sufficiently close to graph states.https://doi.org/10.1038/s41534-023-00789-3 |
| spellingShingle | Owidiusz Makuta Laurens T. Ligthart Remigiusz Augusiak No graph state is preparable in quantum networks with bipartite sources and no classical communication npj Quantum Information |
| title | No graph state is preparable in quantum networks with bipartite sources and no classical communication |
| title_full | No graph state is preparable in quantum networks with bipartite sources and no classical communication |
| title_fullStr | No graph state is preparable in quantum networks with bipartite sources and no classical communication |
| title_full_unstemmed | No graph state is preparable in quantum networks with bipartite sources and no classical communication |
| title_short | No graph state is preparable in quantum networks with bipartite sources and no classical communication |
| title_sort | no graph state is preparable in quantum networks with bipartite sources and no classical communication |
| url | https://doi.org/10.1038/s41534-023-00789-3 |
| work_keys_str_mv | AT owidiuszmakuta nographstateispreparableinquantumnetworkswithbipartitesourcesandnoclassicalcommunication AT laurenstligthart nographstateispreparableinquantumnetworkswithbipartitesourcesandnoclassicalcommunication AT remigiuszaugusiak nographstateispreparableinquantumnetworkswithbipartitesourcesandnoclassicalcommunication |