Tomographic Quantum Cryptography: Equivalence of Quantum and Classical Key Distillation

We consider the class of reference frame independent protocols in d dimensions for quantum key distribution, in which Alice and Bob have one natural basis that is aligned and the rest of their frames are unaligned. We relate existing approaches to tomographically complete protocols. We comment on two different approaches to finite key bounds in this setting, one direct and one using the entropic uncertainty relation and suggest that the existing finite key bounds can still be...

Prepare and measure quantum key distribution protocols can be decomposed into two basic steps: delivery of the signals over a quantum channel and distillation of a secret key from the signal and measurement records by classical processing and public communication. Here we formalize the distillation process for a general protocol in a purely quantum-mechanical framework and demonstrate that it can be viewed as creating an ``effective'' quantum channel between the legitimate us...

We introduce the Singapore protocol, a qubit protocol for quantum key distribution that is fully tomographic, more efficient than other tomographic protocols, and very robust. Under ideal circumstances the efficiency is log_2(4/3)=0.415 key bits per qubit sent. This is 25% more than the efficiency of 1/3=0.333 for the standard six-state protocol, which sets the benchmark. We describe a simple two-way communication scheme that extracts 0.4 key bits per qubit and thus gets clos...

We report experimental generation of a noisy entangled four-photon state that exhibits a separation between the secure key contents and distillable entanglement, a hallmark feature of the recently established quantum theory of private states. The privacy analysis, based on the full tomographic reconstruction of the prepared state, is utilized in a proof-of-principle key generation. The inferiority of distillation-based strategies to extract the key is exposed by an implementa...

After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In principle, both classical and quantum protocols can be used for this processing. It is a natural question which type of protocols is more powerful. We prove for general states but under the assumption of incoherent eavesdropping that Alice and B...

Entanglement distillation is a fundamental task in quantum information processing. It not only extracts entanglement out of corrupted systems but also leads to protecting systems of interest against intervention with environment. In this work, we consider a realistic scenario of entanglement distillation where noisy quantum operations are applied. In particular, the two-way distillation protocol that tolerates the highest error rate is considered. We show that among all types...

When the 4-state or the 6-state protocol of quantum cryptography is carried out on a noisy (i.e. realistic) quantum channel, then the raw key has to be processed to reduce the information of an adversary Eve down to an arbitrarily low value, providing Alice and Bob with a secret key. In principle, quantum algorithms as well as classical algorithms can be used for this processing. A natural question is: up to which error rate on the raw key is a secret-key agreement at all pos...

PhD thesis (University of York). The thesis covers in a unified way the material presented in quant-ph/0403073, quant-ph/0502040, quant-ph/0504160, quant-ph/0510035, quant-ph/0512012 and quant-ph/0603283. It includes two large review chapters on entanglement and distillation.

States with private correlations but little or no distillable entanglement were recently reported. Here, we consider the secure distribution of such states, i.e., the situation when an adversary gives two parties such states and they have to verify privacy. We present a protocol which enables the parties to extract from such untrusted states an arbitrarily long and secure key, even though the amount of distillable entanglement of the untrusted states can be arbitrarily small.

It is proven that recently introduced states with perfectly secure bits of cryptographic key (private states representing secure bit) [K. Horodecki et al., Phys. Rev. Lett. 94, 160502 (2005)] as well as its multipartite and higher dimension generalizations always represent distillable entanglement. The corresponding lower bounds on distillable entanglement are provided. We also present a simple alternative proof that for any bipartite quantum state entanglement cost is an upp...