Certified randomness · Independent lesson
Random-looking output and certified randomness answer different questions
An independent QubitWire lesson on this topic, based on the source reading below. It is not a transcript or a summary of the recording.
A sequence of bits can pass simple statistical tests while still being predictable to someone who knows how it was generated. Certification asks a more specific question: under stated assumptions, what evidence supports the unpredictability of the output to a relevant adversary?
The Quantinuum and JPMorganChase material concerns a protocol using quantum circuit sampling and classical verification. The company’s explanatory source describes timing and statistical checks as part of that protocol. Those checks matter because a claim about the source of randomness is different from observing a balanced count of zeros and ones.
Read the security assumptions carefully. A certification procedure may rely on limits to an adversary’s computation, trusted choices made by the verifier or a prescribed interaction with the device. The guarantee applies within that model. It should not be rewritten as a claim that any bit generated by any quantum device is automatically certified.
Nor does the existence of a quantum approach make properly designed classical cryptographic random-bit generators generally unusable. The practical comparison concerns the entropy source, trust assumptions, implementation and application. A useful companion explains the kind of assurance being added and the resources required to obtain it, without repeating a broad marketing dismissal of other methods.
Questions to work through
Why is a statistical test insufficient by itself?
It can detect some patterns but cannot establish unpredictability against every possible observer. A predictable sequence may still look statistically ordinary to limited tests.
What should a certification claim disclose?
State the protocol, adversary assumptions, failure probability, verification work and output length to which the guarantee applies.
Does verification have a cost?
Yes. Classical computation, communication and repeated interactions can be part of the protocol. Include them when discussing practical throughput or deployment.
Source reading
- youtube.com ↗
https://www.youtube.com/watch?v=av1IBnyL-E8
- quantinuum.com ↗
https://www.quantinuum.com/blog/quantinuum-introduces-first-commercial-application-for-quantum-computers
- csrc.nist.gov ↗
https://csrc.nist.gov/projects/random-bit-generation