Rotem Arnon-Friedman: Entropy accumulation in device-independent protocols

Channel:
Microsoft Research
Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=4rwA_2aLnLc


Duration: 57:13
1,092 views
15

"Proving security of device-independent (DI) cryptographic protocols has been regarded a complex and tedious task. The main difficulty consists in analysing how the eavesdropper's uncertainty ``accumulates'' through many repetitions of a basic test, or ``entropy-generating'' block, on which the protocol is based. Previous satisfactory quantitative bounds were restricted to the case where the repetitions are independent, a strong and often unwarranted assumption.

Our main contribution is a general information-theoretic result, the ``entropy accumulation theorem'', which shows that entropy accumulation occurs in quite general settings in which there is no independence assumption. Our theorem is relevant for applications: we give simple and modular security proofs for DI randomness generation and quantum key distribution. For both tasks we establish essentially optimal key rates and noise tolerance. As loophole-free Bell tests are finally being realised, our results considerably decrease the gap between theory and experiments, thereby marking an important step towards practical DI protocols and their implementation."



Other Videos By Microsoft Research


2017-02-03Speakers Rui Chao, Andrea W. Coladangelo, Matthew Coudron
2017-02-03Jordi Tura Brugués: Energy as a detector of nonlocality of many-body spin systems
2017-02-01Quantum thermodynamics (II)
2017-01-31Dave Touchette:Exponential separation quantum communication & classical information complexity
2017-01-31Sam Roberts: Symmetry protected topological order at nonzero temperature
2017-01-31Anthony Leverrier: SU(p,q) coherent states and Gaussian de Finetti theorems
2017-01-31Michael Kastoryano: Finite correlation length implies efficient preparation quantum thermal states
2017-01-31Xin Wang: Semidefinite programming strong converse bounds for quantum channel capacities
2017-01-31Li Gao: Capacity estimates for TRO channels
2017-01-31Anna Vershynina: Geometric inequalities and contractivity of bosonic semigroups
2017-01-31Rotem Arnon-Friedman: Entropy accumulation in device-independent protocols
2017-01-31Giacomo De Palma: Gaussian optimizers in quantum information
2017-01-31Sergey Bravyi: Improved classical simulation of quantum circuits dominated by Clifford gates
2017-01-31William Slofstra:Tsirelson’s problem & an embedding theorem for groups arising from non-local games
2017-01-31Keisuke Fujii: Threshold theorem for quantum supremacy
2017-01-31Kai-Min Chung: General randomness amplification with non-signaling security
2017-01-31Anand Natarajan: Robust self-testing of many qubit states
2017-01-31Andras Gilyen: On preparing ground states of gapped Hamiltonians
2017-01-31David Gosset: Complexity of quantum impurity problems
2017-01-31Thomas Vidick: Rigorous RG algorithms and area laws for low energy eigenstates in 1D
2017-01-31Giulio Chiribella: Optimal compression for identically prepared qubit states


Tags:
microsoft research