13 citations · 31 across the 10 of their papers we have counts for
Showing 2025 · quant-phShow all
2 papers · 2 filters
quant-ph2025
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-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…