Add to BibSonomy
Abstract
Quantum random number generators (QRNGs) play an increasingly important role in cryptography systems. Specifically, QRNG performed in prepare-and-measure scenarios with independent devices has attracted intensive study, since it can be intrinsically loss tolerant and its assumptions on devices seem to be quite natural. However, the estimations of min-entropy given in previous works are not optimal. As a result, the performance of quantum randomness certification in practice is still severely depressed. Here, we present a novel method to estimate the min-entropy through developing a reduced device model and proving its equivalence to the original one. Benefitting from this reduction, we can solve the min-entropy estimation problem using mixed integer programming effectively. Furthermore, we derive an optimal bound of analytic form in the case that constraints are made up of symmetric observed probabilities. Simulation results show that our work gives an optimal solution in this case and brings a significant performance improvement compared to previous works.
© 2018 Optical Society of America
Full Article | PDF ArticleMore Like This
Yao Zhou, Zhen-Qiu Zhong, Zhen-Qiang Yin, Rong Wang, Xiao-Hai Zhan, Shuang Wang, Wei Chen, Wei Huang, Bing-Jie Xu, Guang-Can Guo, and Zheng-Fu Han
J. Opt. Soc. Am. B 39(5) 1364-1369 (2022)
Nicolò Leone, Stefano Azzini, Sonia Mazzucchi, Valter Moretti, Matteo Sanna, Massimo Borghi, Gioele Piccoli, Martino Bernard, Mher Ghulinyan, and Lorenzo Pavesi
Photon. Res. 11(9) 1484-1499 (2023)
Jialin Cheng, Jiliang Qin, Shaocong Liang, Jiatong Li, Zhihui Yan, Xiaojun Jia, and Kunchi Peng
Photon. Res. 10(3) 646-652 (2022)