Quantum amplitude amplification of improbable futures

Abstract Some consequential futures consist of plausible steps arranged into an unlikely sequence, which simulation seldom produces. Here ideal amplitude amplification, which raises the chance of drawing such futures while preserving their relative likelihoods, becomes a gate-level circuit that marks a future by its coherently accumulated surprisal, with a finite-precision analysis of the marking and the circuit’s logical cost. For a five-state Markov process six steps ahead, a 30-qubit circuit verified against exact enumeration raised the share of rare futures drawn from 2.5% to 98.0% in four iterations, leaving their relative likelihoods unchanged. The known process is an exactly verifiable testbed; the claim is a construction and a hardware demonstration, not a computational advantage. On IBM Kingston, compact reference circuits with matched controls showed the structure of amplification at 228 routed two-qubit gates (\(\:z=50\), per-future \(\:\rho\:=0.98\)) but not at about 1,170, including after a pre-registered test of noise suppression.

Authors

Publication Details

Journal
Research Square
Published
2026-11-13
DOI
https://doi.org/10.21203/rs.3.rs-11588189/v1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Quantum amplitude amplification of improbable futures

Peter Catt
2 links
Research Square
Quantum Computing Algorithms and Architecture
preprint

Quantum amplitude amplification of improbable futures

Peter Catt
preprint en

Abstract

Abstract Some consequential futures consist of plausible steps arranged into an unlikely sequence, which simulation seldom produces. Here ideal amplitude amplification, which raises the chance of drawing such futures while preserving their relative likelihoods, becomes a gate-level circuit that marks a future by its coherently accumulated surprisal, with a finite-precision analysis of the marking and the circuit’s logical cost. For a five-state Markov process six steps ahead, a 30-qubit circuit verified against exact enumeration raised the share of rare futures drawn from 2.5% to 98.0% in four iterations, leaving their relative likelihoods unchanged. The known process is an exactly verifiable testbed; the claim is a construction and a hardware demonstration, not a computational advantage. On IBM Kingston, compact reference circuits with matched controls showed the structure of amplification at 228 routed two-qubit gates (\(\:z=50\), per-future \(\:\rho\:=0.98\)) but not at about 1,170, including after a pre-registered test of noise suppression.

Research Square
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon