Postselection technique for quantum channels with applications to quantum cryptography.

  title={Postselection technique for quantum channels with applications to quantum cryptography.},
  author={Matthias Christandl and Robert K{\"o}nig and Renato Renner},
  journal={Physical review letters},
  volume={102 2},
We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds for an arbitrary input, it is sufficient to consider the case where the input is a particular de Finetti-type state, i.e., a state which consists of n identical and independent copies of an (unknown) state on a single subsystem. Our technique can be applied… 

Security of Continuous-Variable Quantum Key Distribution via a Gaussian de Finetti Reduction.

This work considers a new type of Gaussian de Finetti reduction, that exploits the invariance of some continuous-variable protocols under the action of the unitary group U(n) (instead of the symmetric group S_{n} as in usual definetti theorems), and introduces generalized SU(2,2) coherent states.

Device-independent quantum key distribution

This thesis gives a generic security proof for device-independent quantum key distribution in these cases and applies it to an existing quantum key Distribution protocol, thus proving its security even in this setting.

Security of quantum key distribution from generalised entropy accumulation

This work shows that for a very broad class of QKD protocols, security against collective attacks implies security against general attacks, which can be applied much more broadly and easily.

Entanglement generation secure against general attacks

The approach relies on non-trivial properties of distillation protocols which are used in conjunction with de-Finetti and post-selection-type techniques to reduce a general quantum attack in a non-asymptotic scenario to an i.i.d. input states.

Entanglement cost of quantum channels

Here, it is shown that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.

Simplifying information-theoretic arguments by post-selection

  • R. Renner
  • Computer Science, Mathematics
    Quantum Cryptography and Computing
  • 2010
The Post-Selection Technique can be used to show that security of a Quantum Key Distribution scheme against general attacks—somewhat surprisingly—follows from its security against one specific attack.

Advances in quantum key distribution and quantum randomness generation

This thesis discusses some progress in quantum key distribution and quantum randomness generation, and presents a study on reference-frame-independent protocols whose knowledge can help design more efficient protocols, and a framework to the security analysis of distributed-phase-reference protocols, which have been missing for many years.

Simple proof of confidentiality for private quantum channels in noisy environments

A simple proof of confidentiality for parallel quantum channels established via entanglement distillation based on hashing, in the presence of noise, and a malicious eavesdropper who is restricted only by the laws of quantum mechanics is provided.

Mediated semiquantum key distribution

This paper designs a new quantum key distribution protocol, allowing two limited semi-quantum or "classical" users to establish a shared secret key with the help of a fully quantum server and proves the unconditional security of this protocol even in the worst case: when this quantum server is an all-powerful adversary.

Full Security of Quantum Key Distribution From No-Signaling Constraints

We analyze a cryptographic protocol for generating a distributed secret key from correlations that violate a Bell inequality by a sufficient amount, and prove its security against eavesdroppers,