From the 1 of 2 linked papers with an AI index.
2 papers
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…
cs.PL2026
Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra
Charles Yuan
Quantum algorithms for computational linear algebra promise up to exponential speedups for applications such as simulation and regression, making them prime candidates for hardware…