Provable quantum advantage in randomness processing

  • Dale H
  • Jennings D
  • Rudolph T
  • 28


    Mendeley users who have this article in their library.
  • 3


    Citations of this article.


Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics exactly coincides with the class computable quantum mechanically. It is strongly believed, but not proven, that quantum computing provides exponential speed-up for a range of problems, such as factoring. Here we address a computational scenario of randomness processing in which quantum theory provably yields, not only resource reduction over classical stochastic physics, but a strictly larger class of problems which can be solved. Beyond new foundational insights into the nature and malleability of randomness, and the distinction between quantum and classical information, these results also offer the potential of developing classically intractable simulations with currently accessible quantum technologies.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Howard Dale

  • David Jennings

  • Terry Rudolph

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free