5 citations · 5 across the 4 of their papers we have counts for
4 papers
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…
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…
Semi-Symbolic Inference for Efficient Streaming Probabilistic Programming
Eric Atkinson, Charles Yuan, Guillaume Baudart +2
Efficient inference is often possible in a streaming context using Rao-Blackwellized particle filters (RBPFs), which exactly solve inference problems when possible and fall back on…
Statically Bounded-Memory Delayed Sampling for Probabilistic Streams
Eric Atkinson, Guillaume Baudart, Louis Mandel +2
Probabilistic programming languages aid developers performing Bayesian inference. These languages provide programming constructs and tools for probabilistic modeling and automated…