Showing quant-phShow all
3 papers · 1 filter
quant-ph2026
Universality of a standard two-qubit gate by catalytic embedding
Robin Kaarsgaard
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While si…
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…
quant-ph2025
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…