Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Recurso digital |
| Sprache: | |
| Veröffentlicht: |
Zenodo
2026
|
| Schlagworte: | |
| Online-Zugang: | https://doi.org/10.5281/zenodo.20076446 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866901557961818112 |
|---|---|
| author | Thompson, Eric |
| author_facet | Thompson, Eric |
| contents | <p>Quantum random number generators provide physical randomness by converting intrinsically probabilistic measurement outcomes into usable digital values. This white paper presents a simple five-bit protocol for generating uniformly distributed decimal digits from an ideal 50/50 quantum source. Five independent binary outcomes produce 2⁵ = 32 possible sequences. By rejecting the two extreme runs, 00000 and 11111, exactly 30 admissible sequences remain, allowing a direct uniform mapping onto the ten decimal digits.<br><br>The main contribution of this note is not entropy-optimal extraction, but transparency: the protocol is easy to inspect, easy to implement, and easy to explain to nontechnical users. This makes it especially relevant for trust-critical public-facing applications where visible fairness may matter more than maximum entropy efficiency. A small efficiency improvement is also introduced. Instead of discarding a rejected extreme run entirely, the rejected all-A or all-B sequence is recycled as a single fair starting bit for the next five-bit candidate block. Under the assumption of independent fair input bits, this carry-forward rule preserves exact decimal uniformity while improving the expected raw-bit cost from 16/3 ≈ 5.333 bits per digit to 79/15 ≈ 5.267 bits per digit.<br><br>The paper also discusses practical implementation using a beam-splitter-style quantum randomness source, limitations under detector imbalance, and the proper cryptographic positioning of the method. The protocol can serve as a transparent entropy source or educational QRNG digitization scheme, but cryptographic deployment would still require standard health testing, calibration, and extraction.</p> |
| format | Recurso digital |
| id | zenodo_https___doi_org_10_5281_zenodo_20076446 |
| institution | Zenodo |
| language | |
| publishDate | 2026 |
| publisher | Zenodo |
| record_format | zenodo |
| spellingShingle | A Simple Five-Bit Quantum Random Digit Generator Thompson, Eric Quantum Random Number Generation QRNG Quantum Cryptography Rejection Sampling Modulo Bias Randomness Recycling <p>Quantum random number generators provide physical randomness by converting intrinsically probabilistic measurement outcomes into usable digital values. This white paper presents a simple five-bit protocol for generating uniformly distributed decimal digits from an ideal 50/50 quantum source. Five independent binary outcomes produce 2⁵ = 32 possible sequences. By rejecting the two extreme runs, 00000 and 11111, exactly 30 admissible sequences remain, allowing a direct uniform mapping onto the ten decimal digits.<br><br>The main contribution of this note is not entropy-optimal extraction, but transparency: the protocol is easy to inspect, easy to implement, and easy to explain to nontechnical users. This makes it especially relevant for trust-critical public-facing applications where visible fairness may matter more than maximum entropy efficiency. A small efficiency improvement is also introduced. Instead of discarding a rejected extreme run entirely, the rejected all-A or all-B sequence is recycled as a single fair starting bit for the next five-bit candidate block. Under the assumption of independent fair input bits, this carry-forward rule preserves exact decimal uniformity while improving the expected raw-bit cost from 16/3 ≈ 5.333 bits per digit to 79/15 ≈ 5.267 bits per digit.<br><br>The paper also discusses practical implementation using a beam-splitter-style quantum randomness source, limitations under detector imbalance, and the proper cryptographic positioning of the method. The protocol can serve as a transparent entropy source or educational QRNG digitization scheme, but cryptographic deployment would still require standard health testing, calibration, and extraction.</p> |
| title | A Simple Five-Bit Quantum Random Digit Generator |
| topic | Quantum Random Number Generation QRNG Quantum Cryptography Rejection Sampling Modulo Bias Randomness Recycling |
| url | https://doi.org/10.5281/zenodo.20076446 |