On Classical Teleportation and Classical Nonlocality

An interesting protocol for classical teleportation of an unknown classical state was recently suggested by Cohen, and by Gour and Meyer. In that protocol, Bob can sample from a probability distribution P that is given to Alice, even if Alice has absolutely no knowledge about P. Pursuing a similar line of thought, we suggest here a limited form of nonlocality - "classical nonlocality". Our nonlocality is the (somewhat limited) classical analogue of the Hughston-Jozsa-Wootters (HJW) quantum nonlocality. The HJW nonlocality tells us how, for a given density matrix rho, Alice can generate any rho-ensemble on the North Star. This is done using surprisingly few resources - one shared entangled state (prepared in advance), one generalized quantum measurement, and no communication. Similarly, our classical nonlocality presents how, for a given probability distribution P, Alice can generate any P-ensemble on the North Star, using only one correlated state (prepared in advance), one (generalized) classical measurement, and no communication. It is important to clarify that while the classical teleportation and the classical non-locality protocols are probably rather insignificant from a classical information processing point of view, they significantly contribute to our understanding of what exactly is quantum in their well established and highly famous quantum analogues.Comment: 8 pages, Version 2 is using the term "quantum remote steering" to describe HJW idea, and "classical remote steering" is the main new result of this current paper. Version 2 also has an additional citation (to Gisin's 89 paper

Comment on "Semiquantum-key distribution using less than four quantum states"

Comment on Phys. Rev. A 79, 052312 (2009), http://pra.aps.org/abstract/PRA/v79/i5/e05231

Attacks against a Simplified Experimentally Feasible Semiquantum Key Distribution Protocol

A semiquantum key distribution (SQKD) protocol makes it possible for a quantum party and a classical party to generate a secret shared key. However, many existing SQKD protocols are not experimentally feasible in a secure way using current technology. An experimentally feasible SQKD protocol, "classical Alice with a controllable mirror" (the "Mirror protocol"), has recently been presented and proved completely robust, but it is more complicated than other SQKD protocols. Here we prove a simpler variant of the Mirror protocol (the "simplified Mirror protocol") to be completely non-robust by presenting two possible attacks against it. Our results show that the complexity of the Mirror protocol is at least partly necessary for achieving robustness.Comment: 9 page