Quantum Computing with Very Noisy Devices | NIST

In this work, we analyze the randomness of a bit stream generated by a quantum dot-based quantum random number generator (QRNG) implemented by a noisy Hadamard gate. We observe that the decoherence of the physical system affects the randomness of the bit stream. Further, to enhance the randomness, we employ various linear corrector functions, which (in theory) act on an input string of bits to give an output string of bits with improved randomness. We use certain tests recommended by NIST to characterize the randomness of the generated and the corrected bit strings. A comparison of these test results shows that linear correctors with high $t$ values (around 16) can enhance the randomness of the bit strings generated by a noisy quantum random number generator (QRNG). Therefore, even a noisy QRNG, when combined with an appropriate corrector, will make such devices feasible for true random number generators. This randomness enhancement comes at the cost of reduced bit rates and potential computation time overheads for the QRNG.In this work, we analyze the randomness of a bit stream generated by a quantum dot-based quantum random number generator (QRNG) implemented by a noisy Hadamard gate. We observe that the decoherence of the physical system affects the randomness of the bit stream. Further, to enhance the randomness, we employ various linear corrector functions, which (in theory) act on an input string of bits to give an output string of bits with improved randomness. We use certain tests recommended by NIST to characterize the randomness of the generated and the corrected bit strings. A comparison of these test results shows that linear correctors with high$t$values (around 16) can enhance the randomness of the bit strings generated by a noisy quantum random number generator (QRNG). Therefore, even a noisy QRNG, when combined with an appropriate corrector, will make such devices feasible for true random number generators. This randomness enhancement comes at the cost of reduced bit rates and potential computation time overheads for the QRNG.

IEEE International Conference on Nanotechnology (IEEE-NANO)Jul 2, 20230 citations

Stepping up to quantum computing

Researchers in the US claim to have created the first small-scale device that can perform all the steps needed for large-scale quantum computation. Although each of the individual steps has been demonstrated previously, this new ion-based device can do them all – without losing significant amounts of data in the process. It has been developed by physicists at the US National Institute of Standards and Technology (NIST) in Boulder, Colorado, who say it a key step towards a practical quantum computer.Researchers in the US claim to have created the first small-scale device that can perform all the steps needed for large-scale quantum computation. Although each of the individual steps has been demonstrated previously, this new ion-based device can do them all – without losing significant amounts of data in the process. It has been developed by physicists at the US National Institute of Standards and Technology (NIST) in Boulder, Colorado, who say it a key step towards a practical quantum computer.

Physics WorldSep 1, 20090 citations

Building Quantum Computers | NIST

Emanuel H. Knill

Dec 1, 20080 citations

Quantum Computing | NIST

Emanuel H. Knill

NatureJan 28, 20100 citations

t

values (around 16) can enhance the randomness of the bit strings generated by a noisy quantum random number generator (QRNG). Therefore, even a noisy QRNG, when combined with an appropriate corrector, will make such devices feasible for true random number generators. This randomness enhancement comes at the cost of reduced bit rates and potential computation time overheads for the QRNG.