ExistFail and FirstFail for n quantum assertions need only Θ(log n) ancillas (or S=Θ(log(1+n/T)) over T rounds), while ListAll requires linear S·T=Θ(n).
Title resolution pending
1 Pith paper cite this work, alongside 28 external citations. Polarity classification is still indexing.
1
Pith paper citing it
28
external citations · OpenAlex
fields
cs.PL 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs
ExistFail and FirstFail for n quantum assertions need only Θ(log n) ancillas (or S=Θ(log(1+n/T)) over T rounds), while ListAll requires linear S·T=Θ(n).