DART-Q shows that cached state organization, overload policies, and service capacity determine whether real-time QLDPC decoders can meet deadlines under finite memory and varying load.
Available: https://arxiv.org/abs/2108.06569
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
Shallow Trotter circuits qualitatively simulate resonant tunneling (up to 4 steps) and localization (dozens of steps) in continuous-time spin evolution.
citing papers explorer
-
DART-Q : A Deadline-Driven Framework for Real-Time QLDPC Decoding
DART-Q shows that cached state organization, overload policies, and service capacity determine whether real-time QLDPC decoders can meet deadlines under finite memory and varying load.
-
Qualitative quantum simulation of resonant tunneling and localization with the shallow quantum circuits
Shallow Trotter circuits qualitatively simulate resonant tunneling (up to 4 steps) and localization (dozens of steps) in continuous-time spin evolution.