Pith. sign in

REVIEW

Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2309.02837 v2 pith:QCZJHW7A submitted 2023-09-06 quant-ph cs.ITmath.IT

Quantum Two-Way Protocol Beyond Superdense Coding: Joint Transfer of Data and Entanglement

classification quant-ph cs.ITmath.IT
keywords protocoldecoherencecodingdataquantumsuperdensecommunicationentangled
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In this article, we introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of entangled pairs and superdense coding, introducing an integrated approach for managing entanglement within the communication protocol. To assess the performance of the proposed protocol, we consider its data rate and resource usage, and we analyze this both in an ideal setting with no decoherence and in a more realistic setting where decoherence must be taken into account. In the ideal case, the proposal offers a 50% increase in both data rate and resource usage efficiency compared to conventional protocols. Even when decoherence is taken into consideration, the quantum protocol performs better as long as the decoherence time is not extremely short. Finally, we present the results of implementing the protocol in a computer simulation based on the NetSquid framework. We compare the simulation results with the theoretical values.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.