works on
ancilla qubits 1complexity bounds 1program debugging 1quantum assertions 1time-space tradeoff 1

From the 1 of 1 linked paper with an AI index.

collaborators

1 paper

cs.PL2026

The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs

Shengyuan Yang, Charles Yuan

The paper studies how much time and auxiliary qubits (space) are needed to check multiple runtime assertions in quantum programs, showing that while reporting all outcomes requires…