Bounding the seed length of Miller and Shi's unbounded randomness expansion protocol

Built on

Combinatorial bounds for list decoding
Venkatesan Guruswami, Johan Håstad, Madhu Sudan, and David Zuckerman · 2000
Earlier work this paper cites.
Quantum and relativistic protocols for secure multi-party computation
Roger Colbeck · 2006
Earlier work this paper cites.
Kakeya Sets, New Mergers, and Old Extractors
Z. Dvir and A. Wigderson · 2008
Earlier work this paper cites.
Random numbers certified by Bell’s theorem
S. Pironio, A. Acín, S. Massar, A. Boyer de la Giroday, D. N. Matsukevich, P. Maunz, S. Olmschenk, D. Hayes, L. Luo, T. A. Manning, and C. Monroe · 2010
Earlier work this paper cites.

Trevisan’s extractor in the presence of quantum side information
A. De, C. Portmann, T. Vidick, and R. Renner · 2012
Cited alongside, same era.
A classical leash for a quantum system: Command of quantum systems via rigidity of chsh games
Original
Ben W. Reichardt, Falk Unger, and Umesh Vazirani · 2012
Cited alongside, same era.
Certifiable quantum dice
Umesh Vazirani and Thomas Vidick · 2012
Cited alongside, same era.
Robust randomness amplifiers: Upper and lower bounds
Original
Matthew Coudron, Thomas Vidick, and Henry Yuen · 2013
Cited alongside, same era.

Physical randomness extractors: Generating random numbers with minimal assumptions
Original
Kai-Min Chung, Yaoyun Shi, and Xiaodi Wu · 2014
Closest in time.
Infinite randomness expansion and amplification with a constant number of devices
Matthew Coudron and Henry Yuen · 2014
Closest in time.
Robust protocols for securely expanding randomness and distributing keys using untrusted quantum devices
Original
Carl A. Miller and Yaoyun Shi · 2014
Closest in time.