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: | Owidiusz Makuta, Laurens T. Ligthart, Remigiusz Augusiak |
---|---|
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 |
Similar Items
-
Self-testing maximally-dimensional genuinely entangled subspaces within the stabilizer formalism
by: Owidiusz Makuta, et al.
Published: (2021-01-01) -
Fully non-positive-partial-transpose genuinely entangled subspaces
by: Owidiusz Makuta, et al.
Published: (2023-02-01) -
The Bipartite-Splittance of a Bipartite Graph
by: Yin Jian-Hua, et al.
Published: (2019-02-01) -
Size Ramsey number of bipartite graphs and bipartite Ramanujan graphs
by: Ramin Javadi, et al.
Published: (2019-06-01) -
Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs
by: G. Sethuraman, et al.
Published: (2020-07-01)