A novel $2$ \& $3$ player scheme for Quantum Direct Communication
Theodore Andronikos, Alla Sirokofskich

TL;DR
This paper presents new scalable quantum secure direct communication protocols for two and three players, using a novel encoding method that is practical, extensible, and implementable on current quantum computers.
Contribution
The paper introduces a novel encoding technique for quantum direct communication that is scalable to multiple players and does not require pre-shared keys or quantum signatures.
Findings
Protocols are information-theoretically secure.
Encoding method is easily scalable and extendable.
Implementation uses standard quantum gates like CNOT and Hadamard.
Abstract
This paper introduces two information-theoretically secure protocols that achieve quantum secure direct communication between Alice and Bob in the first case, and among Alice, Bod and Charlie in the second case. Both protocols use the same novel method to embed the secret information in the entangled compound system. The way of encoding the information is the main novelty of this paper and the distinguishing feature compared to previous works in this field. The most critical advantage of this method is that it is easily scalable and extensible because it can be seamlessly generalized to a setting involving three, or even more, players, as demonstrated with the second protocol. This trait can be extremely beneficial when many spatially separated players posses only part the secret information that must be combined and transmitted to Alice, so that she can obtain the complete secret.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
