Nengkun Yu
where else to find them
no profile links on file
what they talk about
where they keep going back
- OOPSLA3 editions2020–2025
all 5 in the filters
on a stage with
- Jens Palsberg2×
- Thomas Reps2×
- Gushu Lionce
all 11 in the filters
who talks about the same things
- Mingsheng Ying9 talks
- Li Zhou9 talks
- Aws Albarghouthi14 talks
- Gushu Li4 talks
- Jens Palsberg17 talks
- Oded Padon11 talks
| title | conference | date |
|---|---|---|
| SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum(…) | PLDI 2026 | 2026-06-15 |
SAQR-QC combines quantum Hoare-style inequalities with quantum abstract interpretation to trade exactness for speed: each reasoning step touches only local… | ||
| Scalable Equivalence Checking and Verification of Shallow Quantum Circuits | OOPSLA 2025 | 2025-10-16 |
Projection-Based Equivalence Checking constructs a constraint representation of a shallow circuit’s output as a conjunction of local projections that act on… | ||
| Quantum program analysis: Verification and Testing | WQS 2024 | 2024-06-24 |
Survey of concrete program-analysis tools for quantum code: Quantum Hoare logic with sound and complete proof rules for partial and total correctness, a… | ||
| Quantum Abstract Interpretation | N40AI 2024 | 2024-01-20 |
Claims that abstract interpretation can verify quantum program assertions in polynomial time by representing abstract states as tuples of local projections and… | ||
| On incorrectness logic for Quantum programs | OOPSLA 2022 | 2022-12-05 |
Proposes an incorrectness logic for quantum programs that treats predicates as projections and defines an under-approximation by projections relation to… | ||
| Sample efficient identity testing and independence testing of quantum states | ITCS 2021 | 2021-01-06 |
Constructs an explicit independent measurement M on a D-dimensional state whose post-measurement classical distributions satisfy ||P-Q||_2 =… | ||
| Projection-Based Runtime Assertions for Testing and Debugging Quantum Programs | OOPSLA 2020 | 2020-11-15 |
Proposes projection-based assertions that express quantum-state predicates more richly than classical patterns while enabling efficient runtime checks by… | ||
| nothing matches | ||