• Corpus ID: 119372117

Parallel DIQKD from parallel repetition

  title={Parallel DIQKD from parallel repetition},
  author={Thomas Vidick},
  journal={arXiv: Quantum Physics},
  • Thomas Vidick
  • Published 24 March 2017
  • Computer Science
  • arXiv: Quantum Physics
We give an arguably simpler and more direct proof of a recent result by Miller, Jain and Shi, who proved device-independent security of a protocol for quantum key distribution in which the devices can be used in parallel. Our proof combines existing results on immunization (Kempe et al., SICOMP 2011) and parallel repetition (Bavarian et al., STOC 2017) of entangled games. 

Security of device-independent quantum key distribution protocols: a review

This review will provide an introduction to DI-QKD, an overview of the related experiments performed, and the theory and techniques required to analyse its security, and concludes with an outlook on future DI- QKD research.

Advances in device-independent quantum key distribution

The state of the art of DI-QKD is reviewed by highlighting its main theoretical and experimental achievements, discussing the recent proof-of-principle demonstrations, and emphasizing the existing challenges in the technology.

De Finetti Theorems for Quantum Conditional Probability Distributions with Symmetry

The aim of device-independent quantum key distribution (DIQKD) is to study protocols that allow the generation of a secret shared key between two parties under minimal assumptions on the devices that

Device-independent certification of tensor products of quantum states using single-copy self-testing protocols

It is proved that self-testing protocols that certify a state and rank-one measurements can always be parallelized to certify many copies of the state, suggesting a method to achieve device-independent unbounded randomness expansion with high-dimensional quantum states.

Parallel Device-Independent Quantum Key Distribution

This work proves the security of a protocol where all games are executed in parallel, the first parallel security proof for a fully device-independent QKD protocol that tolerates a constant level of device imprecision and achieves a linear key rate.

Device-independent uncloneable encryption

This work introduces a variant of uncloneable encryption in which several possible decryption keys can decrypt a particular encryption, and the security requirement is that two parties who receive independently generated dec encryption keys cannot both learn the underlying ciphertext.

Composably secure device-independent encryption with certified deletion.

It is shown that it is possible to achieve this task even when the honest parties do not trust their quantum devices, and security for the ECD task is defined in a composable manner and the protocol satisfies conditions that lead to composable security.

A direct product theorem for quantum communication complexity with applications to device-independent QKD

  • Rahul JainSrijita Kundu
  • Computer Science, Mathematics
    2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
  • 2022
It is shown that it is possible to do device-independent quantum key distribution (DIQKD) without the assumption that devices do not leak any information after inputs are provided to them, and a direct product theorem is given for two-input functions or relations whose outputs are non-boolean as well.

Self-testing of quantum systems: a review

This work gives a thorough and self-contained introduction and review of self-testing and its application to other areas of quantum information.



A Rigorous and Complete Proof of Finite Key Security of Quantum Key Distribution

This work provides a largely self-contained, rigorous proof of the security of quantum key distribution in the finite key regime by careful to model all the randomness that is used throughout the protocol and take care of all the transcripts of the communication over the public channel.

A largely self-contained and complete security proof for quantum key distribution

In this work we present a security analysis for quantum key distribution, establishing a rigorous tradeoff between various protocol and security parameters for a class of entanglement-based and

Anchoring games for parallel repetition

A simple transformation on games called anchoring is introduced and it is shown that this transformation turns any game into an anchored game, and exponential-decay parallel repetition theorems for anchored games in the multiplayer and entangled-player settings are proved.

Entangled Games are Hard to Approximate

This work implies that, unless P = NP, the values of entangled-player games cannot be computed by semidefinite programs that are polynomial in the size of the referee's system, a method that has been successful for more restricted quantum games.

The Operational Meaning of Min- and Max-Entropy

The results establish a direct connection between min- and max-entropies, known to characterize information-processing tasks such as randomness extraction and state merging, and basic operational problems.

The magic squares and Bell''s theorem

The apparatus has a vessel filled with a fluid and arranged so as to accommodate that part of a homogeneous object which is to be measured and is inseparable from same. The vessel is provided with a