Can a quantum algorithm find the previous checkpoint in an unknown reversible process using only forward calls? Two traversals implement one clean first-return query even when different paths spend different amounts of time outside the checkpoints. The resulting quantum search is quadratically faster in checkpoint count in the query model.
Let
| Task | Quantum forward queries | Classical forward queries |
|---|---|---|
| Apply the first-return permutation coherently |
|
|
| Find the previous checkpoint of |
||
| Decide whether the immediate predecessor of |
The search upper bound holds throughout the promise. Matching search lower bounds are realized when
The first traversal records its duration
The induced permutation lets Holman, Ramachandran and Yirka's forward-only inversion algorithm search over the checkpoints. For the lower bound, the layered construction applies Belovs and Yolcu's cycle adversary to each layer and bounds the progress of a single query even in a superposition of layers. Related work
- Science overview links the exact model, compiler, search and lower bounds.
- Childs bridge and the 30 milestones give a learning route.
- LLM reading guide maps specific questions to the scientific sources.
- Verification explains the finite checks. Run
python3 verification/verify_first_return.pyfrom the root.
The compiler uses an exact basis permutation and a supplied return cap. It preserves coherence on any input supported on the checkpoint set, including input entangled with a reference. For direct predecessor membership at growing
This repository serves as a record of the work and a guide for the author’s self-directed learning. For discussion or potential collaboration, please contact Ruge Lin at gogoko699@gmail.com.