activity
20072026
most citedSemantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints

113 citations · 1.3k across the 83 of their papers we have counts for

collaborators

89 papers

quant-ph2026

Weakly Measured Loops for Quantum Amplitude Amplification: Oracle Savings and Adaptive Search with Unknown Target Probability

Wang Fang, Chris Heunen

We present a family of quantum amplitude amplification algorithms that interleave ordinary Grover rotations with tunable weak measurements in loops. A successful measurement yields…

cs.PL2026

A Dynamic Intermediate Representation for Hybrid Quantum-Classical Programs

Alex Rice, Chris Heunen, Tobias Grosser

Quantum compilers typically follow the circuit model, representing programs as fixed sequences of gates. This static view breaks down in hybrid quantum-classical applications, wher…

quant-ph2026

Unitary Synthesis with Near-Optimal T-Count for Near-Clifford Unitaries

Wang Fang, Chris Heunen, Qisheng Wang

We present an approach to unitary synthesis that implements an arbitrary -qubit unitary operator by a Clifford+T circuit with T-count $\widetilde{O}(2^n d_F^{\mathcal{C}}(U)…

quant-ph2026

Free Quantum Computing

Jacques Carette, Chris Heunen, Robin Kaarsgaard +2

Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is…

math-ph2025

Causal Coverage in Ordered Locales and Spacetimes

Chris Heunen, Nesta van der Schaaf

We develop relativistic causality theory in the setting of point-free topology by introducing a notion of causal coverage in ordered locales, generalising their canonical coverage…

cs.LO2025

One rig to control them all

Chris Heunen, Robin Kaarsgaard, Louis Lemonnier

Controlled commands -- computations whose execution depends on a separate input -- play a central role in reversible Boolean circuits and quantum circuits. However, existing formal…