Poster Type: ACM SRC Posters
Author: Salvatore Zammuto (Technical University of Munich), Martin Schulz (Technical University of Munich)
Abstract: Quantum processors sit beside CPUs and GPUs in HPC centers, yet nothing decides, before execution, which part of a workload belongs where, and on a noisy device that decision needs two currencies at once, wall-clock time and error. We supply the missing layer for matrix-product-state simulation. A computation is partitioned at one bond: the weakly entangled side is contracted exactly, the strongly entangled fragment becomes a single ancilla-free staircase circuit driven by a seam register of fewer qubits, whose sampling cost is bounded by chi^2 /epsilon^2 and adapts to the Schmidt spectrum. A planner prices every candidate: classical time and quantum time from transpiled gate durations, against a four-term error envelope, always retaining a classical fallback, and emits a per-run receipt comparing prediction with measurement. On 64-site Ising chains the envelope covers the realized error on every executed plan, and the planner correctly declines the QPU.
Best Poster Finalist (BP): no
Poster: PDF
Poster Summary: PDF