Kai-Min Chung: General randomness amplification with non-signaling security

Subscribers:
344,000
Published on ● Video Link: https://www.youtube.com/watch?v=jjWc2kGS8yc



Duration: 40:20
402 views
2


Highly unpredictable events appear to be abundant in life. However, when modeled rigorously, their existence in nature is far from evident. In fact, the world can be deterministic while at the same time the predictions of quantum mechanics are consistent with observations. Assuming that randomness does exist but only in a weak form, could highly random events be possible? This fundamental question was first raised by Colbeck and Renner~({\em Nature Physics}, 8:450--453, 2012). In this work, we answer this question positively, without the various restrictions assumed in the previous works. More precisely, our protocol uses quantum devices, a single weak randomness source quantified by a general notion of non-signaling min-entropy, tolerates a constant amount of device imperfection, and the security is against an all-powerful non-signaling adversary. Unlike the previous works proving non-signaling security, our result does not rely on any structural restrictions or independence assumptions. Thus it implies a stronger interpretation of the dichotomy statement articulated by Gallego et al.~({\em Nature Communications}, 4:2654, 2013): ``[e]ither our world is fully deterministic or there exist in nature events that are fully random.''




Other Videos By Microsoft Research


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
2017-01-31James Lee: Spectrahedral lifts and quantum learning
2017-01-31Optimal Hamiltonian simulation by quantum signal processing
2017-01-31Shalev Ben-David: Sculpting quantum speedups
2017-01-31David Sutter: Multivariate trace inequalities
2017-01-31Mischa Woods: Applications of recoverability in quantum information



Tags:
microsoft research