Related papers: Classical communication through quantum causal structures

Classical communication through quantum causal structures

URL: http://arxiv.org/abs/2007.05051v1
Date: Thu, 9 Jul 2020 20:33:17 GMT
Title: Classical communication through quantum causal structures
Authors: Kaumudibikash Goswami and Fabio Costa
Abstract summary: We formulate different classical capacities for a bi-partite quantum process. A one-way communication protocol through an arbitrary process cannot outperform a causally separable process. A bi-directional protocol cannot exceed the limit of one way communication protocol.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: Quantum mechanics allows operations to be in indefinite causal order. Recently there have been active discussions on enhanced communication strategies through exotic causal structures. In light of this, through the process matrix formalism, we formulate different classical capacities for a bi-partite quantum process. We find that a one-way communication protocol through an arbitrary process cannot outperform a causally separable process, i.e., we can send at most one bit per qubit. Next, we study bi-directional communication through a causally separable process. Our result shows, a bi-directional protocol cannot exceed the limit of one way communication protocol. Finally, we generalise this result to multi-party broadcast communication protocol through a definite ordered process.

Related papers

Quantifying protocol efficiency: a thermodynamic figure of merit for classical and quantum state-transfer protocols [0.0]
We focus on classical and quantum protocols transferring a state across a double-well potential. The classical protocols are achieved by deforming the potential, while the quantum ones are assisted by a counter-diabatic driving. We show that quantum protocols perform more quickly and accurately.
arXiv Detail & Related papers (2022-12-20T09:19:51Z)
Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
arXiv Detail & Related papers (2022-05-20T12:37:09Z)
Entanglement-assisted quantum communication with simple measurements [0.0]
Dense coding is the seminal example of how entanglement can boost qubit communication. We show that measurements enable strong and sometimes even optimal entanglement-assisted qubit communication protocols. Our results reveal that there are scenarios in which the power of entanglement in enhancing quantum communication can be harvested in simple and scalable optical experiments.
arXiv Detail & Related papers (2022-05-19T14:47:38Z)
Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation. We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z)
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)
Simple and maximally robust processes with no classical common-cause or direct-cause explanation [0.0]
We analyze the minimum requirements for a quantum process to fail to admit a CCDC explanation. We present "simple" processes, which we prove to be the most robust ones against general noise. We also present a semi-definite hierarchy that can detect and quantify the non-classical CCDC programminges of every non-classical CCDC process.
arXiv Detail & Related papers (2021-01-27T19:00:05Z)
Direct Quantum Communications in the Presence of Realistic Noisy Entanglement [69.25543534545538]
We propose a novel quantum communication scheme relying on realistic noisy pre-shared entanglement. Our performance analysis shows that the proposed scheme offers competitive QBER, yield, and goodput.
arXiv Detail & Related papers (2020-12-22T13:06:12Z)
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)
Parallel entangling gate operations and two-way quantum communication in spin chains [0.0]
We propose a protocol to parallelize the implementation of two-qubit entangling gates. The proposed protocol can serve for realizing two-way quantum communication.
arXiv Detail & Related papers (2020-08-28T17:50:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.