Certified randomness from quantum speed limits

Here is an explanation of the paper "Certified randomness from quantum speed limits," translated into simple language with creative analogies.

The Big Idea: Turning a Speed Limit into a Lottery Ticket

Imagine you are trying to generate a truly random number (like flipping a coin) for a secure password. The problem is: How do you know the coin isn't rigged?

Maybe the coin is weighted, or maybe a sneaky hacker (let's call him "Eve") knows exactly how the coin was made and can predict the result before you even flip it. In the world of quantum physics, we usually solve this by trusting that the laws of physics are weird and unpredictable. But what if we don't trust our equipment? What if the machine making the "coin" is a black box built by a stranger?

This paper proposes a clever new trick. Instead of trusting the machine, we trust a fundamental rule of the universe: The Quantum Speed Limit.

The Analogy: The "Too Fast to Change" Rule

In our daily lives, if you want to change a car from "Red" to "Blue," you have to paint it. That takes time. You can't change the color instantly.

In the quantum world, particles have a similar rule. If a particle is in one state (like "Red"), it takes a minimum amount of time to evolve into a completely different state (like "Blue"). This minimum time depends on how much "energy uncertainty" the particle has.

High Energy Uncertainty: The particle is jittery and energetic. It can change states very quickly.
Low Energy Uncertainty: The particle is calm. It takes a long time to change.

This is the Quantum Speed Limit (QSL). It's like a cosmic speed limit sign that says, "You cannot evolve faster than this, no matter how hard you try."

The Experiment: The "Time-Triggered" Black Box

The authors imagine a scenario with two black boxes:

Preparation Box (P): It spits out a quantum particle.
Measurement Box (M): It measures the particle and gives a result (+1 or -1).

The Catch: We don't trust these boxes. They could be fake. They could be pre-programmed by Eve to give us a specific result.

The Trick: We get to decide when to press the button on Box P.

Input 0: We press the button immediately.
Input 1: We wait a tiny, specific amount of time ( $\Delta t$ ) before pressing the button.

Because of the Quantum Speed Limit, the particle prepared at time 0 and the particle prepared at time 1 cannot be too different from each other if the energy is low. They haven't had enough time to evolve into totally different states.

The "Gotcha": Why This Guarantees Randomness

Here is the magic part.

If the system were classical (like a normal, predictable machine), Eve could program the box to give the same answer every time, regardless of when we pressed the button. She could say, "I know exactly what the machine will do at time 0 and time 1."

However, if we observe that the answers from the machine are different in a way that violates the Quantum Speed Limit, we know something is up.

The Logic: If the machine gave us results that looked "too different" for the amount of time that passed, it would mean the machine evolved faster than the universe allows.
The Conclusion: Since the universe doesn't allow that, the only explanation is that the outcome was truly random. It wasn't pre-determined by Eve. The "jitteriness" of the quantum world forced the result to be unpredictable.

It's like a magician trying to switch a red card for a blue card in a split second. If the audience sees a red card at time 0 and a blue card at time 1, but the magician didn't have enough time to do the switch, the audience knows the blue card must have been there all along—or, in our case, the result was generated by genuine quantum randomness.

The "Energy Bill" Assumption

To make this work, we need one small promise: We need to know that the "energy bill" of the machine isn't too high.

Think of energy uncertainty as the "jitter" of the system.

If the machine is allowed to have infinite jitter, it could change states instantly, and the speed limit wouldn't matter.
But, if we can measure (or promise) that the machine's jitter is below a certain limit, then the speed limit applies.

The paper shows that even if we don't know exactly how the machine works, as long as we know its "jitter" is low, we can mathematically prove that the results it gives us are random.

Real-World Application: The Laser Light

The authors even sketched out how to do this in a real lab using coherent states of light (like a laser beam).

Imagine a laser pulse.
You send it through a device that delays it by a tiny fraction of a second for one input, but not the other.
You measure the light.
If the results show the right kind of "weirdness" that only quantum mechanics allows within that tiny time window, you have generated a certified random number.

Why This Matters

Security: It creates random numbers that are secure even if your hardware is bought from a suspicious vendor. You don't need to trust the device; you just need to trust the laws of physics (specifically, time and energy).
New Perspective: It flips the script on "Quantum Speed Limits." Usually, we think of speed limits as a restriction (a bad thing that slows us down). This paper shows that a speed limit is actually a feature (a good thing that guarantees security).
Simplicity: It doesn't require complex entanglement or huge quantum computers. It works with simple, single-particle setups.

Summary in One Sentence

By using the universe's "speed limit" for how fast a particle can change, we can prove that a mysterious black box is producing truly random numbers, even if we don't trust the box itself.

Here is a detailed technical summary of the paper "Certified randomness from quantum speed limits" by Caroline L. Jones et al.

1. Problem Statement

The paper addresses the challenge of generating certified randomness in a semi-device-independent (semi-DI) setting.

Context: In standard device-independent (DI) protocols, security relies on violating Bell inequalities, requiring entanglement and loophole-free setups. Semi-DI protocols relax these requirements by trusting certain physical assumptions while treating devices as "black boxes."
The Gap: Existing semi-DI protocols often rely on assumptions about the dimension of the Hilbert space (e.g., assuming the system is a qubit) or specific properties of state overlaps. These assumptions can be physically unmotivated or difficult to verify experimentally.
The Goal: The authors aim to devise a protocol that certifies randomness based on a fundamental physical constraint—the Quantum Speed Limit (QSL)—specifically an upper bound on the energy uncertainty ( $\Delta E$ ) of the prepared state, without assuming knowledge of the system's dimension, Hamiltonian, or specific state preparation details.

2. Methodology

A. Theoretical Framework: Prepare-and-Measure Scenario

The authors utilize a prepare-and-measure scenario (Figure 1) involving:

Preparation Device ( $P$ ): A black box that prepares a quantum state $\rho_x$ based on an input $x \in \{0, 1\}$ .
Measurement Device ( $M$ ): A black box that measures the state and outputs a bit $b \in \{+1, -1\}$ .
The "Trusted" Operation: The user controls the time at which the preparation is triggered.
- Input $x=0$ : Preparation occurs at time $t_0$ .
- Input $x=1$ : Preparation occurs at time $t_1 = t_0 + \Delta t$ .
The Assumption: The system evolves unitarily under an unknown Hamiltonian $\hat{H}$ . The only physical constraint is an upper bound $E$ on the energy uncertainty ( $\Delta E$ ) of the initial state: $\Delta E_{\rho_0} \leq E$ .
Adversarial Model: An adversary (Eve) may possess classical side information $\lambda$ correlated with the devices. The protocol must guarantee randomness even if Eve knows $\lambda$ , provided the average energy uncertainty constraint holds.

B. Characterization of Correlation Sets

The authors define two sets of correlations $(C_0, C_1)$ , where $C_x = P(+1|x) - P(-1|x)$ :

Quantum Set ( $Q_{E, \Delta t}$ ): The set of correlations achievable by quantum mechanics given the energy bound $E$ $E$ and time delay $\Delta t$ $Δ t$ .
- Derived from the Mandelstam-Tamm bound (a form of QSL): $\Delta t \geq \frac{\hbar \arccos|\langle \psi_0 | \psi_1 \rangle|}{\Delta E}$ .
- This imposes a lower bound on the overlap $\gamma = |\langle \psi_0 | \psi_1 \rangle|$ between the two states.
- The set is characterized by a non-linear inequality involving the square roots of probabilities (Eq. 8).
Classical Max-Average Set ( $\bar{C}_{E, \Delta t}$ ): The set of correlations achievable by a classical deterministic model where the adversary knows $\lambda$ $λ$ .
- Crucially, the adversary can use a mixture of "fast" states (high $\Delta E$ ) and "slow" states (low $\Delta E$ ), provided the average energy uncertainty satisfies the bound.
- Due to the concavity of the variance function, the classical set is defined by a linear wedge: $|C_0 - C_1| \leq \frac{4E\Delta t}{\pi}$ (for $E\Delta t < \pi/2$ ).

C. Randomness Certification

Certification Condition: Randomness is certified if the observed correlations lie in the region $Q_{E, \Delta t} \setminus \bar{C}_{E, \Delta t}$ . In this region, no classical model (even with side information) can reproduce the statistics while satisfying the average energy constraint.
Quantification: The amount of certifiable randomness is quantified by the conditional min-entropy (or Shannon entropy) $H(B|X, \Lambda)$ .
Optimization: The authors formulate an optimization problem to find the minimum entropy $H^*$ over all possible hidden-variable decompositions consistent with the observed correlations and the energy constraint. They solve this using a dual formulation and a discretization algorithm to provide rigorous lower bounds.

D. Open System Extension

The framework is extended to open systems interacting with an environment. By utilizing a generalized speed limit for open systems (Shiraishi & Saito), the authors show that the certification holds if the time-averaged energy uncertainty $\langle \Delta E \rangle_{\Delta t}$ is bounded by $E$ .

3. Key Contributions

New Physical Assumption for Semi-DI: The paper introduces the energy uncertainty bound ( $\Delta E$ ) as a viable, physically motivated assumption for semi-DI randomness generation, replacing the less intuitive Hilbert space dimension assumption.
Non-Linearity of Variance: The authors demonstrate that because energy uncertainty (variance) is concave rather than linear, the classical "max-average" set is not a subset of the quantum set in the same way as linear constraints. This creates a unique gap between classical and quantum correlations that can be exploited for certification.
Algorithm for Entropy Bounds: They develop a rigorous numerical algorithm based on Lagrange duality and discretization to compute certified lower bounds on the entropy $H^*$ for arbitrary observed correlations.
Experimental Feasibility with Coherent States: The paper proves that single-mode coherent states (classical-like states of a harmonic oscillator) can generate certified randomness in specific parameter regimes. This challenges the intuition that only highly non-classical states (like Fock states or squeezed states) are necessary for such protocols.

4. Results

Correlation Geometry: The study maps the geometry of quantum vs. classical correlations (Figure 2 & 3). For small $E\Delta t$ , the quantum set is strictly larger than the classical max-average set, allowing for randomness certification.
Entropy Bounds: Numerical simulations (Figure 4) show that for $E\Delta t = 0.5$ , the maximum certified entropy is approximately $H^* \approx 0.81$ bits per round.
Coherent State Implementation:
- The authors propose an implementation using a harmonic oscillator (e.g., a laser pulse).
- By preparing a coherent state $|\alpha\rangle$ and measuring the quadrature $q$ (sign of $q$ ), they derive specific correlations.
- They show that for specific parameters (e.g., $\hbar\omega\xi = 0.5, \omega\Delta t = 0.4$ ), the correlations fall outside the classical set, yielding a certified entropy of $H^* \approx 0.024$ bits.
- This demonstrates that non-zero randomness can be certified even from states often considered "classical" (coherent states), reinforcing the non-classical nature of the simple harmonic oscillator's dynamics under time constraints.

5. Significance

Foundational Insight: The work bridges the gap between fundamental physics (time-energy uncertainty relations) and information theory. It shows that the structure of spacetime (specifically the speed limit of evolution) imposes constraints on correlations that can be harnessed for cryptographic tasks.
Operational Value of QSL: While Quantum Speed Limits are traditionally viewed as limitations on computation speed, this paper reframes them as resources for security.
Robustness: The protocol is robust against environmental noise (open systems) and does not require precise knowledge of the Hamiltonian, only an upper bound on energy fluctuations.
Experimental Relevance: By showing that coherent states (easily generated with lasers) suffice, the paper lowers the experimental barrier for implementing semi-DI randomness generators, potentially enabling high-rate, secure random number generation in standard quantum optical setups.

In summary, the paper establishes a novel protocol where the time-energy uncertainty relation serves as the sole physical assumption to certify randomness, offering a robust, dimension-independent, and experimentally accessible route to secure quantum random number generation.