Write
153
edits
Quantum Random Number Generator: Difference between revisions
Jump to navigation
Jump to search
no edit summary
No edit summary |
|||
| Line 5: | Line 5: | ||
* Apply a Hadamard gate for putting it into a superposition of equal probability of being 0 and 1. This step can be equal that tossing a coin in air. | * Apply a Hadamard gate for putting it into a superposition of equal probability of being 0 and 1. This step can be equal that tossing a coin in air. | ||
* Measurement: This is the final step and now we can learn now the coin's result like head or tail | * Measurement: This is the final step and now we can learn now the coin's result like head or tail | ||
==Use Case== | |||
Randomness expansion is useful in the case where one already has access to a private source for true randomness, but whose use is prohibitively expensive or whose access is limited. This is not possible classically. | |||
In a similar vein, it is only possible to extract uniform, private randomness by combining multiple weak sources together classically. Randomness amplification enables the extraction of such randomness from only a single weak source - useful in any situation where only some randomness has been provided but absolute security is required. | |||
==Notations== | ==Notations== | ||