pith. sign in

arxiv: 0906.2518 · v1 · submitted 2009-06-14 · 🪐 quant-ph

On Ping-Pong protocol and its variant

classification 🪐 quant-ph
keywords inequalityprotocolholdsinitialmessagesping-pongaliceanother
0
0 comments X
read the original abstract

We discuss the Ping-Pong protocol which was proposed by Bostroem and Felbinger. We derive a simple trade-off inequality between distinguishability of messages for Eve and detectability of Eve for legitimate users. Our inequality holds for arbitrary initial states. That is, even if Eve prepares an initial state, she cannot distinguish messages without being detected. We show that the same inequality holds also on another protocol in which Alice and Bob use one-way quantum communication channel twice.

This paper has not been read by Pith yet.

discussion (0)

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