clifford+T circuits 1frobenius norm distance 1near-clifford unitaries 1t-count optimization 1unitary synthesis 1
From the 1 of 2 linked papers with an AI index.
2 papers
quant-ph2026
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…
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…