cryptographically secure random bits

1 statements across 1 episodes · 1 bullish · 0 bearish · 1 people on the record · first statement Jun 29, 2018 by Scott Aaronson · across every show →

Everything said about cryptographically secure random bits, oldest first

Jun 29, 2018 bullish
Prediction Not checkable as stated
Aaronson: Certified randomness may be quantum computing's first near-term application
“As far as I can see, may be the first application of quantum computing that people could actually be able to realize with, like, near-term devices with 50 or 60 or 70 qubits. And this application is to generate cryptographically secure random bits.”
Scott Aaronson Jun 29, 2018 ▶ 12:38 Scott Aaronson on Computational Complexity Theory and Quantum Computers · Y Combinator
Made with StarZero

Turn any episode into a week of clips.

This entire site, over 300 episodes transcribed, diarized, checked and made playable, runs on the StarZero media pipeline. Drop in your own episode and the podcast clipper finds the moments worth sharing, cuts them, captions them, and reframes them for every feed.