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

Quantum Advantage without Entanglement

We study the advantage of pure-state quantum computation without entanglement over classical computation. For the Deutsch-Jozsa algorithm we present the maximal subproblem that can be solved without entanglement, and show that the algorithm still has an advantage over the classical ones. We further show that this subproblem is of greater significance, by proving that it contains all the Boolean functions whose quantum phase-oracle is non-entangling. For Simon's and Grover's algorithms we provide simple proofs that no non-trivial subproblems can be solved by these algorithms without entanglement.Comment: 10 page

Security Against Collective Attacks of a Modified BB84 QKD Protocol with Information only in One Basis

The Quantum Key Distribution (QKD) protocol BB84 has been proven secure against several important types of attacks: the collective attacks and the joint attacks. Here we analyze the security of a modified BB84 protocol, for which information is sent only in the z basis while testing is done in both the z and the x bases, against collective attacks. The proof follows the framework of a previous paper (Boyer, Gelles, and Mor, 2009), but it avoids the classical information-theoretical analysis that caused problems with composability. We show that this modified BB84 protocol is as secure against collective attacks as the original BB84 protocol, and that it requires more bits for testing.Comment: 6 pages; 1 figur