Charles Yuan
where else to find them
no profile links on file
what they talk about
where they keep going back
- OOPSLA3 editions2021–2024
- PLanQC2 editions2022–2026
- PLDI Workshop Honoring Andreas Podelski2 editions2024–2026
all 4 in the filters
on a stage with
all 7 in the filters
who talks about the same things
- Michael Carbin14 talks
- Robert Rand11 talks
- Aws Albarghouthi14 talks
- Christopher McNally3 talks
- Mingsheng Ying9 talks
- Amanda Xu6 talks
| title | conference | date |
|---|---|---|
| Cobble: Compiling Block Encodings for Quantum Computational Linear Algebra | PLDI 2026 | 2026-06-15 |
Cobble compiles high-level matrix expressions into correct quantum circuits by representing matrices as block encodings, computing time and space costs… | ||
| Programming Abstractions for Quantum Linear Algebra | PLanQC 2026 | 2026-01-12 |
Cobble is a domain language that compiles algebraic matrix expressions into circuits operating on block encodings, tracking both query count and the crucial… | ||
| Quantum Assertion Testing Without Mid-Circuit Measurement: Strategies and Lower Bounds | PLanQC 2026 | 2026-01-12 |
Defines FirstFail and exist-fail tasks and proves concrete time‑space limits: any strategy without mid‑circuit measurement satisfies T × S = Ω(log n). Provides… | ||
| Quantum Control Machine: The Limits of Control Flow in Quantum Programming | OOPSLA 2024 | 2024-10-20 |
Proves that a straightforward conditional jump impossibility holds: lifting classical conditional jumps into superposition is nonrealizable, with a formal… | ||
| The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation | PLDI 2024 | 2024-06-24 |
Identifies that common control-flow constructs cause polynomial increases in T-complexity under surface-code error correction and gives a precise cost model… | ||
| Tower: Data Structures in Quantum Superposition | OOPSLA 2022 | 2022-12-05 |
Language Tower provides a reversible semantics that compiles every program to a unitary circuit and enforces reversible operations, a type system that bounds… | ||
| Semi-symbolic Inference for Efficient Streaming Probabilistic Programming | OOPSLA 2022 | 2022-12-05 |
Semi-symbolic inference implements an automatic Rao-Blackwellized particle filter in ProbZelus by manipulating symbolic expression trees, using a central swap… | ||
| Invited talk: Twist: Sound Reasoning for Purity and Entanglement in Quantum P... | PLanQC 2022 | 2022-09-15 |
Twist is a quantum language that encodes a type system for purity so programs can assert lack of entanglement and have those assertions checked by a mix of… | ||
| Analyzing quantum programs using the power of interaction | PLanQC 2022 | 2022-09-15 |
Proposes two concrete verification routes: embed execution into a circuit-to-Hamiltonian embedding so the correct run is the ground-state witness and avoid… | ||
| Tower: Data Structures in Quantum Superposition | PLanQC 2022 | 2022-09-15 |
Implements a language and runtime that realize reversible, history‑independent, bounded‑time data structures for quantum algorithms: Tower provides reversible… | ||
| Twist: Sound Reasoning for Purity and Entanglement in Quantum Programs | POPL 2022 | 2022-01-16 |
Twist presents a concrete language and the semantic property purity that guarantees an expression is unentangled from the rest of the program, implemented via… | ||
| Statically Bounded-Memory Delayed Sampling for Probabilistic Streams | OOPSLA 2021 | 2021-10-17 |
Defines two dataflow conditions, m-consumed and unseparated path, and proves they are necessary and sufficient for delayed sampling to use bounded memory on… | ||
| nothing matches | ||