Can a quantum simulator skip long waits between only a few irreversible decays? This project gives a full-channel simulation algorithm for purely dissipative processes with a bounded downward excitation grading. It reproduces the coherence changes caused by unobserved emission times, including unknown and arbitrarily slow decay rates.
With controlled and inverse access to a normalized encoding of the stacked
jump operators, a process of normalized duration
oracle calls. A scalar one-event family requires
| Result | Meaning | Scientific account |
|---|---|---|
| Complete-channel algorithm | Preserves arbitrary input and reference coherences; no successful-run postselection | Simulation theorem |
| Global waiting-time compiler | Dyadic time bands have logarithmic stack normalization | Compiler |
| Uniform discretization | Error accumulates over decay depth rather than elapsed time | Time-grid proof |
| Charged filter circuits | Finite coefficient registers, reversible arithmetic and controlled simulation without QRAM | Filters and resources |
| Matching time exponent | Explicit close oracle completions force square-root horizon cost | Lower bound |
| Noncommuting examples | Tests unequal-rate coherence and why triangular jumps alone do not suffice | Examples |
Start with the scientific guide, model and physical interpretation. For attribution and the precise difference from previous simulation methods, read related work and the bibliography.
The single educational anchor is John Watrous, The Theory of Quantum Information (2018). The source-to-project bridge starts with two excited states of unequal lifetime: their final populations are unchanged by forgetting emission time, but their coherence is not. It connects this example to channel error, the finite clock and the compiler.
The 30-milestone map has 12 background milestones and 18 narrative milestones. It builds the complete scientific story from local channel and access concepts to the simulation theorem, resource accounting and lower bound. The learning guide connects the two routes without replacing the authoritative proofs.
python -m pip install -r requirements.txt
python verification/verify.py --checkThe verification guide explains the deterministic fixtures, independent comparisons, saved results and numerical tolerances. These checks exercise small complete channels and expose specific failure modes. They do not implement the full fault-tolerant filter/amplification circuit or certify asymptotic results independently of the proofs.
There is no Hamiltonian term. Every jump strictly lowers a known grading, and the total loss operator preserves that grading. Homogeneous excitation loss is a sufficient subclass. Individual rate matrices need not commute; no decay-rate floor or known rate eigenbasis is assumed.
For physical jumps encoded with normalization
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.