Scalable & Noise-Robust Communication Advantage of Multipartite Quantum Entanglement
- URL: http://arxiv.org/abs/2409.13223v2
- Date: Tue, 24 Sep 2024 04:47:40 GMT
- Title: Scalable & Noise-Robust Communication Advantage of Multipartite Quantum Entanglement
- Authors: Ananya Chakraborty, Ram Krishna Patra, Kunika Agarwal, Samrat Sen, Pratik Ghosal, Sahil Gopalkrishna Naik, Manik Banik,
- Abstract summary: Quantum resources offer advantages over classical methods in addressing this challenge.
We show that when the receiver and the senders share a multi-qubit Greenberger-Horne-Zeilinger (GHZ) state, certain global functions of the distributed inputs can be computed with only one bit of classical communication from each sender.
We also show that the entanglement-based protocol exhibits significant robustness under white noise.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing inter-server communication -- an issue central to the study of communication complexity. Quantum resources offer advantages over classical methods in addressing this challenge. In this work, we investigate a distributed computing scenario with multiple senders and a single receiver, establishing a scalable advantage of multipartite quantum entanglement in mitigating communication complexity. Specifically, we demonstrate that when the receiver and the senders share a multi-qubit Greenberger-Horne-Zeilinger (GHZ) state -- a quintessential form of genuine multipartite entanglement -- certain global functions of the distributed inputs can be computed with only one bit of classical communication from each sender. In contrast, without entanglement, two bits of communication are required from all but one sender. Consequently, quantum entanglement reduces communication overhead by (n-1) bits for n senders, allowing for arbitrary scaling with an increasing number of senders. We also show that the entanglement-based protocol exhibits significant robustness under white noise, thereby establishing the potential for experimental realization of this novel quantum advantage.
Related papers
- Unbounded quantum advantage in communication complexity measured by
distinguishability [0.0]
In this study, we adopt a novel perspective, measuring the complexity of the communication by the distinguishability of the sender's input.
We focus on two important categories of communication complexity tasks - the general version of random access codes and equality problems defined by graphs.
We show that the ratio between the distinguishability in classical and quantum communication to achieve the same success metric escalates with the complexity of these tasks.
arXiv Detail & Related papers (2024-01-23T16:48:59Z) - 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) - Oblivious Quantum Computation and Delegated Multiparty Quantum
Computation [61.12008553173672]
We propose a new concept, oblivious computation quantum computation, where secrecy of the input qubits and the program to identify the quantum gates are required.
Exploiting quantum teleportation, we propose a two-server protocol for this task.
Also, we discuss delegated multiparty quantum computation, in which, several users ask multiparty quantum computation to server(s) only using classical communications.
arXiv Detail & Related papers (2022-11-02T09:01:33Z) - Classical analogue of quantum superdense coding and communication advantage of a single quantum system [0.0]
We show that a qubit communication without any assistance of classical shared randomness can achieve the goal.
We also study communication utility of a class of non-classical toy systems described by symmetric polygonal state spaces.
arXiv Detail & Related papers (2022-02-14T15:29:59Z) - Private Classical Communication over Quantum Multiple-Access Channels [5.203329540700176]
We study private classical communication over quantum multiple-access channels.
We decouple the reliability and privacy constraints, which are handled via source coding with quantum side information and universal hashing.
arXiv Detail & Related papers (2022-01-28T02:23:50Z) - Quantum communication complexity beyond Bell nonlocality [87.70068711362255]
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks.
Quantum resources are well-suited to this task, offering clear strategies that can outperform classical counterparts.
We prove that a new class of communication complexity tasks can be associated to Bell-like inequalities.
arXiv Detail & Related papers (2021-06-11T18:00:09Z) - Computation-aided classical-quantum multiple access to boost network
communication speeds [61.12008553173672]
We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC.
We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
arXiv Detail & Related papers (2021-05-30T11:19:47Z) - Delegating Multi-Party Quantum Computations vs. Dishonest Majority in
Two Quantum Rounds [0.0]
Multi-Party Quantum Computation (MPQC) has attracted a lot of attention as a potential killer-app for quantum networks.
We present a composable protocol achieving blindness and verifiability even in the case of a single honest client.
arXiv Detail & Related papers (2021-02-25T15:58:09Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Experimental quantum conference key agreement [55.41644538483948]
Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale.
Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement.
We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre.
arXiv Detail & Related papers (2020-02-04T19:00:31Z)
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.