Classical Simulation of Quantum Circuits with Partial Interference Effects
summary
Presents a simulation that truncates interference by running branch histories concurrently and halting when a collected amplitude crosses a chosen threshold 0.7, trading exactness for work saved. Tests on Grover, Simon (k=3,4) and small Shor instances (n=15,21) report 86% success at 0.7, ~30% success at 0.1, and measured savings like saved 10 million interference computations (Shor, low thresholds) and up to 200,000 saved steps for an 8‑qubit three‑SAT case. The runtime model uses a chemical abstract machine for randomized interference accumulation and early termination.
AI-written summary · about
chapters (10)
- 0:00Quantum interference basics
- 1:05Interference in quantum circuits
- 2:31Execution tree visualization
- 4:59Amplitude cancellation observations
- 6:02Membrane model for computation
- 7:28Threshold termination strategy
- 9:14Chemical abstract machines
- 10:37Grover and Simon results
- 13:07Conclusion and future research
- 15:04Q&A on thresholds
related talks
20mMarQSim: Reconciling Determinism and Randomness in Compiler Optimization for Quantum(…)
01h 10mQuantum Advantage with Shallow Clifford Circuits
23mCommunity keynote - Quantum Computing: Mind-bogglingly weird!
53mThe quantum computers are coming
19mAvenues for Quantum Error Correction and Mitigation
01h 28mHow Simulating Balls and Springs Captures the Power of Quantum Computing
15mScalable Equivalence Checking and Verification of Shallow Quantum Circuits
48mStatistics In Quantum Computational Supremacy