Pith. sign in

REVIEW 1 cited by

Hybrid Schr\"odinger-Feynman Simulation of Quantum Circuits With Decision Diagrams

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2105.07045 v1 pith:K4ZLJMM2 submitted 2021-05-14 quant-ph cs.ET

classification quant-phcs.ET
keywords decisionsimulationdiagramscannotcircuitscomplexitydiagram-basedhybrid
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Classical simulations of quantum computations are vital for the future development of this emerging technology. To this end, decision diagrams have been proposed as a complementary technique which frequently allows to tackle the inherent exponential complexity of these simulations. In the worst case, however, they still cannot escape this complexity. Additionally, while other techniques make use of all the available processing power, decision diagram-based simulation to date cannot exploit the many processing units of today's systems. In this work, we show that both problems can be tackled together by employing a hybrid Schr\"odinger-Feynman scheme for the simulation. More precisely, we show that realizing such a scheme with decision diagrams is indeed possible, we discuss the resulting problems in its realization, and propose solutions how they can be handled. Experimental evaluations confirm that this significantly advances the state of the art in decision diagram-based simulation -- allowing to simulate certain hard circuits within minutes that could not be simulated in a whole day thus far.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Fewer Histories, Faster Paths: Distributed Quantum Circuit Feynman Simulation via History Reduction, Checkpointing, and Pruning

    cs.ET 2026-08 conditional novelty 6.0 of 10

    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.

Pith tools