2 papers
cs.PL2026
The Time-Space Complexity of Checking Multiple Assertions in Quantum Programs
Shengyuan Yang, Charles Yuan
Runtime assertions are a promising mechanism for testing and debugging quantum programs. But unlike the classical world, checking a quantum program that contains multiple assertion…
cs.PL2025
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…