Real-Time Seedless Post-Processing for Quantum Random Number Generators
Abstract: Quantum-proof randomness extraction is essential for handling quantum side information possessed by a quantum adversary, which is widely applied in various quantum cryptography tasks. In this study, we introduce a real-time two-source quantum randomness extractor against quantum side information. Our extractor is tailored for forward block sources, a novel category of min-entropy sources introduced in this work. These sources retain the flexibility to accommodate a broad range of quantum random number generators. Our online algorithms demonstrate the extraction of a constant fraction of min-entropy from two infinitely long independent forward block sources. Moreover, our extractor is inherently block-wise parallelizable, presenting a practical and efficient solution for the timely extraction of high-quality randomness. Applying our extractors to the raw data of one of the most commonly used quantum random number generators, we achieve a simulated extraction speed as high as 64 Gbps.
- R. Impagliazzo and D. Zuckerman, in FOCS, Vol. 30 (1989) pp. 248–253.
- R. Konig and R. Renner, IEEE Transactions on Information Theory 57, 4760 (2011).
- M. Santha and U. V. Vazirani, J. Comput. Syst. Sci. 33, 75–87 (1986).
- N. Nisan and D. Zuckerman, Journal of Computer and System Sciences 52, 43 (1996).
- B. Chor and O. Goldreich, SIAM Journal on Computing 17, 230 (1988).
- R. Raz, in Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005) pp. 11–20.
- J. Bourgain, International Journal of Number Theory 01, 1 (2005).
- B. Barak, R. Impagliazzo, and A. Wigderson, SIAM Journal on Computing 36, 1095 (2006).
- R. Kasher and J. Kempe, Theory Comput. 8, 461 (2010).
- K.-M. Chung, X. Li, and X. Wu, arXiv preprint arXiv:1411.2315 (2014).
- J. G. Rarity, P. Owens, and P.R.Tapster, Journal of Modern Optics 41, 2435 (1994), http://dx.doi.org/10.1080/09500349414552281 .
- T. Symul, S. M. Assad, and P. K. Lam, Applied Physics Letters 98, 231103 (2011).
Paper Prompts
Sign up for free to create and run prompts on this paper.