Device-independent Shannon entropy certification
Gespeichert in:
| Titel: | Device-independent Shannon entropy certification |
|---|---|
| Autoren: | Robert Okula, Piotr Mironowicz |
| Quelle: | New Journal of Physics, Vol 27, Iss 11, p 114519 (2025) |
| Verlagsinformationen: | IOP Publishing |
| Publikationsjahr: | 2025 |
| Bestand: | Directory of Open Access Journals: DOAJ Articles |
| Schlagwörter: | quantum random number generation, Shannon entropy, semi-definite programming, Science, Physics, QC1-999 |
| Beschreibung: | Quantum technologies promise information processing and communication technology advancements, including random number generation (RNG). Using Bell inequalities, a user of a quantum RNG hardware can certify that the values provided by an untrusted device are truly random. This problem has been extensively studied for von Neumann and min-entropy as a measure of randomness. However, in this paper, we analyze the feasibility of such verification for Shannon entropy. We investigate how the usability of various Bell inequalities differs depending on the presence of noise. Moreover, we present the benefit of certification for Shannon compared to min-entropy, as well as the tight analytical lower bound for Shannon entropy in randomness certification. |
| Publikationsart: | article in journal/newspaper |
| Sprache: | English |
| Relation: | https://doi.org/10.1088/1367-2630/ae20b2; https://doaj.org/toc/1367-2630; https://doaj.org/article/d048efdd0b0343d5b01002f60f9cd2e6 |
| DOI: | 10.1088/1367-2630/ae20b2 |
| Verfügbarkeit: | https://doi.org/10.1088/1367-2630/ae20b2 https://doaj.org/article/d048efdd0b0343d5b01002f60f9cd2e6 |
| Dokumentencode: | edsbas.255B5CAC |
| Datenbank: | BASE |
Nájsť tento článok vo Web of Science | Abstract: | Quantum technologies promise information processing and communication technology advancements, including random number generation (RNG). Using Bell inequalities, a user of a quantum RNG hardware can certify that the values provided by an untrusted device are truly random. This problem has been extensively studied for von Neumann and min-entropy as a measure of randomness. However, in this paper, we analyze the feasibility of such verification for Shannon entropy. We investigate how the usability of various Bell inequalities differs depending on the presence of noise. Moreover, we present the benefit of certification for Shannon compared to min-entropy, as well as the tight analytical lower bound for Shannon entropy in randomness certification. |
|---|---|
| DOI: | 10.1088/1367-2630/ae20b2 |