A Feynman path-sum simulator reduces the history space via boundary-value propagation and checkpointing, enabling exact sparse-output simulation of 100-qubit quantum walks.
qHiPSTER: The quantum high performance software testing environment,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.ET 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning
A Feynman path-sum simulator reduces the history space via boundary-value propagation and checkpointing, enabling exact sparse-output simulation of 100-qubit quantum walks.