🧬 biology

Quantum amplitude amplification of improbable futures

This paper presents a gate-level quantum circuit that uses ideal amplitude amplification to coherently mark and significantly increase the sampling probability of rare, improbable futures in a Markov process while preserving their relative likelihoods, demonstrating successful amplification in simulation and partial hardware verification on IBM's Kingston processor despite current noise limitations.

Original author: Peter M. Catt

Published 2026-11-13

📖 5 min read🧠 Deep dive

CC BY 4.0

Original author: Peter M. Catt

Original paper licensed under CC BY 4.0 (https://creativecommons.org/licenses/by/4.0/). ⚕️ This is an AI-generated explanation of a preprint that has not been peer-reviewed. It is not medical advice. Do not make health decisions based on this content. Read full disclaimer

In the vast landscape of probability, some outcomes are so unlikely that they seem to vanish into the noise of chance. Imagine trying to predict a specific sequence of weather events that leads to a rare flood, or a particular chain of financial decisions that triggers a market crash. These "improbable futures" are often composed of steps that are individually ordinary, but when strung together in a specific order, they become statistical outliers. For scientists and risk analysts, finding these rare sequences is a critical challenge. Traditional computer simulations often miss them entirely because they simply do not happen often enough to be noticed in a standard run. To solve this, researchers have long sought ways to "amplify" the signal of these rare events, making them appear more frequently in a simulation without distorting the underlying rules of how the system works. This is the realm of quantum computing, where the strange laws of physics allow for a different kind of calculation, one that can theoretically boost the odds of finding these hidden patterns.

A recent study by Peter M. Catt explores whether this theoretical power can be turned into a working reality on today's quantum machines. The researcher focused on a specific type of mathematical model known as a Markov process, which describes systems that move from one state to another based on fixed probabilities, like a board game where the next move depends only on the current position. The goal was to build a quantum circuit—a set of instructions for a quantum computer—that could identify and boost the frequency of "rare futures" within this system. These rare futures are defined not by being impossible, but by being surprisingly unlikely compared to the average behavior of the system. The study aimed to construct a precise digital tool that could mark these rare sequences and then use a technique called amplitude amplification to make them much more likely to be drawn in a simulation, all while keeping their relative chances of occurring exactly the same as they were in the original model.

The researchers first built a complete, gate-level circuit designed to handle a six-step journey through a five-state system. In a perfect, noise-free simulation, this circuit worked exactly as intended. It successfully identified the rare sequences and, after just four rounds of amplification, increased the probability of drawing one of these rare futures from a mere 2.5 percent to nearly 98 percent. Crucially, the simulation confirmed that the circuit did not just pick the rare events randomly; it preserved the specific likelihoods of each individual rare path, ensuring the statistical integrity of the result. This part of the work served as a rigorous proof of concept, demonstrating that the mathematical construction was sound and that the logic of the circuit was correct down to the smallest detail.

However, the true test came when the researchers moved from the perfect world of simulation to the messy reality of actual hardware. They took a simplified version of their circuit and ran it on a superconducting quantum processor called IBM Kingston. The experiment was designed with extreme care to distinguish the quantum effect from the background noise that plagues all current quantum computers. They compared the results of their "oracle" circuit, which was designed to find the rare events, against a "control" circuit that looked almost identical but lacked the specific logic to mark those events. This matched control was essential because noise alone can sometimes make rare events appear more often simply by scrambling the data.

The results on the hardware revealed a clear boundary between what is possible today and what remains out of reach. When the researchers tested a shorter, two-step version of the circuit, which involved 228 two-qubit gates, the experiment was a success. The oracle circuit drew rare futures significantly more often than the control circuit, with a statistical signal strong enough to confirm that the amplification mechanism was working. The pattern of the results matched the theoretical prediction, showing that the quantum computer was indeed boosting the rare events as designed. Yet, when they increased the complexity to a three-step version, which required about 1,170 two-qubit gates, the signal disappeared. The amplification effect was lost in the noise, and the results no longer showed the expected advantage. Even when the researchers applied standard techniques to suppress errors, such as dynamical decoupling and gate twirling, they could not recover the signal for the deeper circuit.

The study concludes that while the logic for amplifying rare futures is sound and has been verified in simulation, current quantum hardware is not yet powerful enough to run the full, complex version of the algorithm. The researchers found that the amplification signature was detectable at a gate count of 228 but vanished at roughly 1,170. This does not mean the method is flawed; rather, it highlights the current physical limits of the technology. The work provides a verified blueprint for how such a system should be built and demonstrates that the first steps of the process work on real machines. It stands as a precise measurement of where the field stands today: the theoretical machinery is ready, but the hardware needs to grow significantly stronger before it can tackle the full complexity of rare-event sampling in the real world.

Technical Summary: Quantum Amplitude Amplification of Improbable Futures

Problem Statement
Many consequential outcomes in fields such as climate science, finance, and power-grid reliability are path-dependent and arise from sequences of individually plausible steps that form an unlikely trajectory. Classical rare-event simulation techniques (e.g., importance sampling, multilevel splitting) are effective when the specific event is known in advance. However, sampling from a distribution conditioned on all outcomes whose probability falls below a specific threshold—without pre-specifying those outcomes—remains challenging. While theoretical work (Guo et al., Gupta et al.) suggests quantum algorithms could offer asymptotic advantages in sampling complexity for such "rare sets," a constructive, gate-level implementation that verifies the marking of these futures and measures the hardware cost has been lacking.

Methodology
The author constructs a gate-level quantum circuit to mark and amplify the probability of "rare futures" in a known five-state Markov process. The approach involves three primary components:

State Preparation: A trajectory distribution is prepared using a cascade of uniformly controlled $R_y$ rotations. For a horizon of $n$ steps, the path register uses $3n$ qubits (three qubits per step to encode five states).
Rarity Oracle (Marking): The core innovation is an oracle that identifies futures where the per-step surprisal (negative log-probability) exceeds a threshold defined by the stationary entropy rate plus a margin ( $\epsilon$ $ϵ$ ).
- Surprisal Accumulation: Transition surprisals are accumulated in a Fourier-basis register. Fixed-point arithmetic is used to represent surprisals with $t$ fractional bits.
- Thresholding: An offset is pre-loaded into the accumulator, and the sum of surprisals is computed via phase rotations conditioned on step registers. The comparison to the threshold is reduced to checking the sign of the most significant bit of the accumulator, eliminating the need for a complex comparator.
- Precision Analysis: A finite-precision analysis (Proposition 1) determines the required number of fractional bits ( $t$ ) to ensure the fixed-point classification matches the real-valued definition exactly, separating circuit errors from rounding errors.
Amplitude Amplification: The standard Grover-like amplification operator ( $Q = -A R_0 A^\dagger S$ ) is applied, where $A$ is the state preparation, $R_0$ is a reflection about the zero state, and $S$ is the rarity oracle. This rotates the state vector to increase the probability of marked (rare) futures while preserving their relative likelihoods.

Key Contributions

Explicit Construction: The paper provides the first explicit, gate-level circuit construction for a rarity oracle based on surprisal accumulation in the Fourier basis, verified against exact enumeration.
Finite-Precision Analysis: It establishes a sufficient condition for the number of fractional bits required to guarantee exact classification of rare sets, distinguishing between circuit implementation errors and precision-induced misclassifications.
Resource Accounting: The logical cost of the circuit is analyzed, showing that the oracle (specifically the diagonal gates coupling step registers to the accumulator) dominates the resource count, scaling as $O(n \cdot t)$ , where $n$ is the horizon and $t$ is the precision.
Hardware Validation with Matched Controls: The author performs controlled experiments on IBM's superconducting hardware (Kingston). To distinguish amplification from noise-induced flattening of the distribution, they utilize "matched control" circuits. These controls have identical routed two-qubit gate counts and physical layouts but apply random phases to unused indices, ensuring they experience similar noise profiles without performing the amplification logic.

Results

Simulation: A 30-qubit statevector simulation of a six-step process ( $n=6$ ) with 7 fractional bits of precision successfully amplified the probability of rare futures from 2.5% to 98.0% in four iterations. The simulation confirmed that the relative likelihoods within the rare set remained unchanged, and the circuit matched exact amplitude amplification to within $10^{-15}$ .
Hardware Performance (2-Step vs. 3-Step):
- 2-Step ( $n=2$ ): A compact reference circuit with 228 routed two-qubit gates successfully detected the amplification signal. The oracle drew rare futures with a probability of 0.6836 compared to 0.4351 for the control, yielding a signal of +0.2485 ( $z=50.1$ ), well above the pre-registered detection threshold ( $z \ge 5$ ). The per-future frequency changes correlated strongly ( $\rho=0.98$ ) with ideal amplification predictions.
- 3-Step ( $n=3$ ): A deeper circuit with approximately 1,170 routed two-qubit gates failed to detect the signal. The measured signal was negative ($-0.0230$), and the per-future correlation collapsed.
Noise Suppression: A follow-up run on October 30, 2026, tested standard noise suppression techniques (dynamical decoupling and Pauli twirling). These methods did not recover the 3-step signal; in fact, twirling pushed the output toward a uniform random distribution. The 2-step signal remained detectable under all conditions, though its magnitude varied.

Significance and Claims
The paper modestly claims a construction and a hardware demonstration, not a computational advantage.

Verifiability: Because the underlying Markov process is known, the author can compute the exact rare-set probability and sample from it classically. Thus, the work serves as a "testbed" where every quantum result is checkable against exact values.
Hardware Regime: The primary finding is the identification of a practical regime for these specific reference circuits. The amplification signature is detectable at 228 two-qubit gates but disappears at approximately 1,170 gates on current superconducting hardware, even with noise suppression.
Limitations: The author explicitly states that no quantum advantage is claimed for this specific problem, as the transition matrix is known and classical dynamic programming can solve it exactly. The construction is intended as a proof-of-principle for how such oracles might be built for larger, unknown simulators (e.g., climate or epidemic models) where the generator itself must be run coherently. The current work separates the correctness of the algorithm from the limitations of present-day hardware depth.

More like this