← Latest papers
⚛️ quantum physics

Quantum random-number generator with non-demolition measurements: semi-device-independent implementation

This paper proposes a semi-device-independent quantum random-number generator that utilizes a tripartite system with quantum non-demolition measurements to simultaneously certify genuine quantum effects and generate near-maximal entropy random numbers, thereby eliminating the need for spacelike separation and enabling practical, scalable miniaturization.

Original authors: Paolo Solinas, Giovanni Chesi

Published 2026-07-30
📖 5 min read🧠 Deep dive

Original authors: Paolo Solinas, Giovanni Chesi

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

The Magic of the Unseen Dice

Imagine you are trying to build a machine that rolls a truly fair die. In the world of classical physics, if you know exactly how hard you threw the die, the angle of the table, and the air resistance, you could predict the result every time. To get "randomness" in a normal computer, we have to rely on messy, hard-to-measure things like the timing of your keystrokes or the heat of the processor. But these aren't truly random; they are just too complicated for us to calculate.

Enter quantum mechanics, the rulebook for the very small. Here, nature has a built-in rule: some things are fundamentally unpredictable. You can't know the result of a quantum event before it happens, no matter how much you know about the setup. This is the holy grail for creating perfect random numbers, which are essential for unbreakable secret codes (cryptography) and secure communications.

However, there is a catch. How do you know your machine is actually using these magical quantum rules and not just a sneaky classical trick? Usually, scientists have to perform a "Bell test," which requires two detectors to be placed far apart from each other—so far that not even light could travel between them fast enough to cheat. This makes the devices huge, expensive, and impossible to shrink down for your phone or laptop. The big question is: Can we prove we have a quantum machine and get our random numbers without needing two giant, separated labs?

The One-Room Quantum Casino

In this paper, physicists Paolo Solinas and Giovanni Chesi propose a clever new way to build a Quantum Random-Number Generator (QRNG) that solves this problem. Instead of needing two detectors far apart, they use a single, compact system with three parts: one "actor" (a quantum system) and two "observers" (detectors). Think of it like a magic show where the magician (the quantum system) performs a trick, and two different judges watch from the same stage to verify the magic and collect the results.

The setup involves a three-level quantum system (our actor) and two detectors. The first detector, let's call it "Judge One," is there to certify that the magic is real. The second detector, "Judge Two," is the one that actually spits out the random numbers. The authors use a technique called "Quantum Non-Demolition Measurement" (QNDM). In plain English, this is like checking if a coin is spinning without stopping it or looking at which side is up. You can sense the "spin" (the quantum phase) without destroying the state, allowing the system to keep evolving.

Here is the clever part: Judge One looks for a specific signature of quantum magic called "negativity." In the quantum world, when paths interfere with each other (like waves in a pond), they can create a "quasi-probability" distribution. Sometimes, this distribution dips below zero. In our everyday world, probabilities can't be negative (you can't have a -50% chance of rain). But in this quantum simulation, if Judge One sees these negative numbers, it proves that the system is using genuine quantum superposition and not just a classical trick. If the numbers stay positive, the machine is just a fancy calculator.

Meanwhile, Judge Two is busy collecting the random outcomes. Because the system is in a quantum superposition, the path the system takes is a blur of possibilities. When Judge Two measures the system, it collapses this blur into a specific result. The authors show that by carefully tuning the system, they can make these results come out in a nearly perfect, uniform distribution. This means the random numbers generated are as unpredictable as possible, maximizing the "entropy" (a fancy word for true randomness).

The paper demonstrates this using a specific model with a three-level system and two detectors (one with two levels, one with three). Through calculations and simulations, they show that they can generate a string of random numbers that is almost perfectly uniform. In their example, they managed to get a distribution where the randomness was very close to the theoretical maximum, with a deviation of only about 9.81% from a perfectly uniform string. At the same time, the "negativity" detected by Judge One was strong enough to certify that the process was undeniably quantum.

What makes this so exciting is that it removes the need for the detectors to be far apart. Because the certification happens simultaneously with the generation within a single, compact setup, the device can be miniaturized. You could theoretically put this on a chip. The authors suggest that this "semi-device-independent" approach is a promising step toward scalable quantum technologies, allowing us to have secure, high-quality random number generators that don't require a massive laboratory to prove they work.

In short, Solinas and Chesi have designed a blueprint for a tiny, self-checking quantum machine. It doesn't just roll the dice; it proves the dice are fair and quantum-mechanical at the exact same moment, all while sitting in the palm of your hand.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →