Michael Walter
where else to find them
no profile links on file
what they talk about
where they keep going back
- PLanQC2 editions2024–2026
on a stage with
all 5 in the filters
who talks about the same things
nobody close enough yet
| title | conference | date |
|---|---|---|
| Traq: Estimating the Quantum Cost of Classical Programs | PLanQC 2026 | 2026-01-12 |
Traq provides an automated pipeline that compiles a classical CPL source language to unitary quantum code, extracts three cost functions (worst-case have cost… | ||
| QbC: Quantum Correctness by Construction | OOPSLA 2025 | 2025-10-16 |
Presents a method that builds quantum programs from pre/postconditions by applying sound and complete refinement rules over a quantum while language, using… | ||
| QbC: Quantum Correctness by Construction | PLanQC 2024 | 2024-01-20 |
Constructs quantum programs from pre/postconditions using typed holes and a set of refinement rules that reduce holes to initializations, unitaries, sequences… | ||
| (Hidden) Symmetries of Computational Problems | Geometric Methods in Optimization and Sampling Boot Camp | 2021-08-30 |
Provides a polynomial-time algorithm for the non‑commutative singularity problem by converting it to an operator scaling instance and running an… | ||
| (Hidden) Symmetries of Computational Problems (continued) | Geometric Methods in Optimization and Sampling Boot Camp | 2021-08-30 |
Claims that geodesic convexity explains why greedy scaling (e.g., Sinkhorn) works, and that three problems — nullcone membership, norm minimization (capacity)… | ||
| nothing matches | ||