Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Nature

The certainty of quantum randomness

Stefano Pironio

Published Apr 10, 2018• 16 citations
Publisher
DOI
10.1038/d41586-018-04105-4

Related papers

Subjective probability and quantum certainty

Carlton M. Caves, Christopher A. Fuchs, Rüdiger Schack

arXiv:quant-ph/0608190•Studies in History and Philosophy of Science Part B Studies in History and Philosophy of Modern Physics•May 10, 2007•185 citations

On the central limit theorem for unsharp quantum random variables

Aleksandra Dimić, Borivoje Dakić

We study the weak-convergence properties of random variables generated by unsharp quantum measurements. More precisely, for a sequence of random variables generated by repeated unsharp quantum measurements, we study the limit distribution of relative frequency. We provide a representation theorem for all separable states, showing that the distribution can be well approximated by a mixture of normal distributions. Furthermore, we investigate the convergence rates and show that the relative frequency can stabilize to some constant at best at the rate of order for all separable inputs. On the other hand, we provide an example of a strictly unsharp quantum measurement where the better rates are achieved by using entangled inputs. This means that in certain cases the noise generated by the measurement process can be suppressed by using entanglement. We deliver our result in the form of quantum information task where the player achieves the goal with certainty in the limiting case by using entangled inputs or fails with certainty by using separable inputs.

arXiv:1609.01680•New Journal of Physics•Jun 19, 2018•3 citations

ON QUANTUM RANDOMNESS

WORLD SCIENTIFIC eBooks•Apr 1, 1998•0 citations

Quantum Randomness

Art Hobson

Springer eBooks•Jan 1, 2024•0 citations

Quantum Advantage in Identifying the Parity of Permutations with Certainty

A. Diebra, S. Llorens, D. González-Lociga +4 more

We establish a sharp quantum advantage in determining the parity (even-odd) of an unknown permutation applied to any number n≥3 of particles. Classically, this is impossible with fewer than n labels, being that the success is limited to random guessing. Quantum mechanics does it with certainty with as few as ⌈sqrt[n] ⌉ distinguishable states per particle, thanks to entanglement. Below this threshold, not even quantum mechanics helps: both classical and quantum success are limited to random guessing. For small n, we provide explicit expressions for states that ensure perfect parity identification. We also assess the minimum entanglement these states need to carry, finding it to be close to maximal, and even maximal in some cases. The task requires no oracles or contrived setups and provides a simple, rigorous example of genuine quantum advantage.

arXiv:2508.04310•Physical Review Letters•Nov 17, 2025•1 citation

Quantum Randomness

Yale University Press eBooks•Nov 11, 2025•0 citations
We study the weak-convergence properties of random variables generated by unsharp quantum measurements. More precisely, for a sequence of random variables generated by repeated unsharp quantum measurements, we study the limit distribution of relative frequency. We provide a representation theorem for all separable states, showing that the distribution can be well approximated by a mixture of normal distributions. Furthermore, we investigate the convergence rates and show that the relative frequency can stabilize to some constant at best at the rate of order for all separable inputs. On the other hand, we provide an example of a strictly unsharp quantum measurement where the better rates are achieved by using entangled inputs. This means that in certain cases the noise generated by the measurement process can be suppressed by using entanglement. We deliver our result in the form of quantum information task where the player achieves the goal with certainty in the limiting case by using entangled inputs or fails with certainty by using separable inputs.
We establish a sharp quantum advantage in determining the parity (even-odd) of an unknown permutation applied to any number n≥3 of particles. Classically, this is impossible with fewer than n labels, being that the success is limited to random guessing. Quantum mechanics does it with certainty with as few as ⌈sqrt[n] ⌉ distinguishable states per particle, thanks to entanglement. Below this threshold, not even quantum mechanics helps: both classical and quantum success are limited to random guessing. For small n, we provide explicit expressions for states that ensure perfect parity identification. We also assess the minimum entanglement these states need to carry, finding it to be close to maximal, and even maximal in some cases. The task requires no oracles or contrived setups and provides a simple, rigorous example of genuine quantum advantage.