From the 1 of 12 linked papers with an AI index.
12 papers
Unitary Synthesis with Near-Optimal T-Count for Near-Clifford Unitaries
Wang Fang, Chris Heunen, Qisheng Wang
The paper proposes a method to synthesize any n‑qubit unitary as a Clifford+T circuit whose T‑gate count scales as ~2^n times the Frobenius distance to the Clifford group, achievin…
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…
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…
Hilbert -categories: Where limits in analysis and category theory meet
Matthew Di Meglio, Chris Heunen
This article introduces Hilbert -categories: an abstraction of categories with similar algebraic and analytic properties to the categories of real, complex, and quaternionic Hil…
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…
Hadamard-Pi: Equational Quantum Programming
Wang Fang, Chris Heunen, Robin Kaarsgaard
Quantum computing offers advantages over classical computation, yet the precise features that set the two apart remain unclear. In the standard quantum circuit model, adding a 1-qu…