Entanglement Coordination Rates in Multi-User Networks
- URL: http://arxiv.org/abs/2403.11893v3
- Date: Wed, 1 May 2024 10:46:02 GMT
- Title: Entanglement Coordination Rates in Multi-User Networks
- Authors: Hosen Nator, Uzi Pereg,
- Abstract summary: The optimal coordination rates are determined in three primary settings of multi-user quantum networks.
We show the implications of our results on nonlocal games with quantum strategies.
- Score: 16.025002076222002
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The optimal coordination rates are determined in three primary settings of multi-user quantum networks, thus characterizing the minimal resources required in order to simulate a joint quantum state among multiple parties. We study the following models: (1) a cascade network with rate-limited entanglement, (2) a broadcast network, which consists of a single sender and two receivers, (3) a multiple-access network with two senders and a single receiver. We establish the necessary and sufficient conditions on the asymptotically-achievable communication and entanglement rates in each setting. At last, we show the implications of our results on nonlocal games with quantum strategies.
Related papers
- Coordination Capacity for Classical-Quantum Correlations [16.025002076222002]
Network coordination is considered in three basic settings.
We consider the simulation of a classical-quantum state between two nodes with rate-limited common randomness (CR) and communication.
At last, we consider a broadcast setting, where a sender and two receivers simulate a classical-quantum-quantum state using rate-limited CR and communication.
arXiv Detail & Related papers (2024-04-28T19:47:24Z) - Entangled Pair Resource Allocation under Uncertain Fidelity Requirements [59.83361663430336]
In quantum networks, effective entanglement routing facilitates communication between quantum source and quantum destination nodes.
We propose a resource allocation model for entangled pairs and an entanglement routing model with a fidelity guarantee.
Our proposed model can reduce the total cost by at least 20% compared to the baseline model.
arXiv Detail & Related papers (2023-04-10T07:16:51Z) - Multi-User Entanglement Distribution in Quantum Networks Using Multipath
Routing [55.2480439325792]
We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing.
The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
arXiv Detail & Related papers (2023-03-06T18:06:00Z) - Multiparty Entanglement Routing in Quantum Networks [0.0]
A protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks.
The protocol only requires local measurements at the network nodes and just a single qubit memory per user.
arXiv Detail & Related papers (2022-11-12T15:40:34Z) - A scheme for multipartite entanglement distribution via separable
carriers [68.8204255655161]
We develop a strategy for entanglement distribution via separable carriers that can be applied to any number of network nodes.
We show that our protocol results in multipartite entanglement, while the carrier mediating the process is always in a separable state with respect to the network.
arXiv Detail & Related papers (2022-06-20T10:50:45Z) - Optimized Quantum Networks [68.8204255655161]
Quantum networks offer the possibility to generate different kinds of entanglement prior to network requests.
We utilize this to design entanglement-based quantum networks tailored to their desired functionality.
arXiv Detail & Related papers (2021-07-21T18:00:07Z) - Experimental multi-state quantum discrimination through a Quantum
network [63.1241529629348]
We have experimentally implemented two discrimination schemes in a minimum-error scenario based on a receiver featured by a network structure and a dynamical processing of information.
The first protocol achieves binary optimal discrimination, while the second one provides a novel approach to multi-state quantum discrimination, relying on the dynamical features of the network-like receiver.
arXiv Detail & Related papers (2021-07-21T09:26:48Z) - A Reconfigurable Quantum Local Area Network Over Deployed Fiber [1.1713998235451095]
We implement flex-grid entanglement distribution in a deployed network for the first time.
We quantify the quality of the distributed polarization entanglement via log-negativity.
We demonstrate one possible quantum protocol enabled by the distributed entanglement network.
arXiv Detail & Related papers (2021-02-26T17:08:03Z) - Realization of a multi-node quantum network of remote solid-state qubits [0.45823749779393547]
We report on the experimental realization of a three-node entanglement-based quantum network.
We achieve real-time communication and feed-forward gate operations across the network.
We capitalize on the novel capabilities of this network to realize two canonical protocols without post-selection.
arXiv Detail & Related papers (2021-02-08T19:00:03Z) - Deterministic distribution of multipartite entanglement and steering in
a quantum network by separable states [14.388536745297214]
Einstein-Podolsky-Rosen entanglement and steering play important roles in quantum-enhanced communication protocols.
We experimentally demonstrate the deterministic distribution of two- and three-mode Gaussian entanglement and steering by transmitting separable states in a network consisting of a quantum server and multiple users.
arXiv Detail & Related papers (2021-01-05T09:15:54Z) - Genuine quantum networks: superposed tasks and addressing [68.8204255655161]
We show how to make quantum networks, both standard and entanglement-based, genuine quantum.
We provide them with the possibility of handling superposed tasks and superposed addressing.
arXiv Detail & Related papers (2020-04-30T18:00:06Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.