Quantum cloning transformation unlocks the potential of W class of states in a quantum secure direct communication protocol
Rashi Jain, Satyabrata Adhikari

TL;DR
This paper introduces a novel controlled quantum secure direct communication protocol using W class states, demonstrating how quantum cloning machines can retrieve secrets and analyzing success probabilities linked to entanglement and state parameters.
Contribution
The work presents the first controlled QSDC protocol based on W class states and explores how quantum cloning enhances secret retrieval and protocol efficiency.
Findings
Success probability is related to entanglement in W states.
Quantum cloning machine efficiency can be optimized using shared state parameters.
Less entangled W states can still effectively facilitate secure communication.
Abstract
In a controlled quantum secure direct communication (Controlled QSDC) protocol between three parties, the sender sends the encoded secured message to one of the two receivers, which can be decoded only when the other receiver agrees to cooperate. A lot of studies have been done on it using the three-qubit GHZ state, and only a few works have involved the W state. In this work, we introduce a controlled QSDC protocol exploiting a three-qubit W class of state shared between three parties, Alice (Sender), Bob (Controller), and Charlie (Receiver). In the proposed protocol, the shared state parameters and the secret are linked in such a way that it is very difficult to factor them. We will show that these parameters can be factored out easily if the receiver uses a quantum cloning machine (QCM) and thus can retrieve the secret. We find that the protocol is probabilistic and have calculated…
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
