A quantum computer has been used for the first time to generate strings of certifiably random numbers, with potential applications in various fields.
Classical computers can only generate pseudorandom numbers, while quantum computers excel at producing genuinely random numbers due to the inherent randomness in quantum mechanics.
This breakthrough opens up possibilities for applications in fields like lotteries and cryptography.
Certifying the randomness of the numbers generated by a quantum computer involves cross-entropy benchmarking to verify their quantum origin.
The study used a 56-qubit high-fidelity Quantum H2-1 quantum computer for generating random numbers and exploring quantum magnetism and knot theory problems.
Verifying the authenticity of random numbers from quantum computers can be computationally intensive, requiring further research for more efficient methods.
The research advances the understanding and application of quantum computing in solving complex problems with real-world implications.
Quantum computing's value is now assessed based on the problems it can solve rather than just the technical specifications of the hardware.
The potential for quantum computers to tackle larger models and expand their capabilities is evident in the development of a 96-qubit device named Helios.
The research showcases the shift in focus from the hardware capabilities of quantum computers to the practical problems they can address effectively.