Top Mathematics discussions
Webb Wright@Quanta Magazine
//
Researchers are making significant strides in reducing the costs associated with quantum randomness, a crucial element for cryptography and simulations. Traditionally, obtaining true quantum randomness has been complex and expensive. However, the exploration of "pseudorandomness" offers a practical alternative, allowing researchers to utilize computational algorithms that mimic randomness, thus sidestepping the high costs of pure quantum randomness. This development broadens the accessibility of randomness, enabling researchers to pursue new scientific investigations.
The team from JPMorganChase, Quantinuum, multiple national labs, and UT Austin demonstrated a certified quantum randomness protocol. They showcased the first successful demonstration of a quantum computing method to generate certified randomness. Using a 56-qubit quantum machine, they output more randomness than they initially put in. What makes this truly remarkable is that this feat is considered impossible for even the most powerful classical supercomputers. This groundbreaking achievement could open new doors for quantum computing and cryptography research.
References :
- The Quantum Insider: Joint Research Team Achieves Certified Quantum Randomness, Turns Once Theoretical Experiments Into First Commercial Applications For Quantum Computing
- Quanta Magazine: The High Cost of Quantum Randomness Is Dropping
- hetarahulpatel.medium.com: Random Numbers Just Got Real, Thanks to Quantum Magic!
Classification: