clifford+T circuits 1frobenius norm distance 1near-clifford unitaries 1t-count optimization 1unitary synthesis 1
From the 1 of 15 linked papers with an AI index.
1 citations · 2 across the 7 of their papers we have counts for
Showing cs.PLShow all
2 papers · 1 filter
cs.PL2025
Quantum Circuits Are Just a Phase
Chris Heunen, Louis Lemonnier, Christopher McNally +1
Quantum programs today are written at a low level of abstraction - quantum circuits akin to assembly languages - and the unitary parts of even advanced quantum programming language…
cs.PL2024
Qurts: Automatic Quantum Uncomputation by Affine Types with Lifetime
Kengo Hirata, Chris Heunen
Uncomputation is a feature in quantum programming that allows the programmer to discard a value without losing quantum information, and that allows the compiler to reuse resources.…