Quick Navigation
Topics
Quantum Algorithms
Unitary Synthesis with Near-Optimal T-Count for Near-Clifford Unitaries
arXiv
Authors: Wang Fang, Chris Heunen, Qisheng Wang
Year
2026
Paper ID
72781
Status
Preprint
Abstract Read
~2 min
Abstract Words
96
Citations
N/A
Abstract
We present an approach to unitary synthesis that implements an arbitrary n-qubit unitary operator U by a Clifford+T circuit with T-count widetilde{O}\(2n dF^{mathcal{C}}(U\)), where dF^{mathcal{C}}(U) is the Frobenius norm distance of U to the Clifford group. The T-count is shown to be near-optimal when dF^{mathcal{C}}(U) is a constant. Our approach improves the previous best upper bound widetilde{O}\(24n/3\) due to Tan (2025) for a large class of unitary operators U as long as dF^{mathcal{C}}(U) ll 2n/3.
Why This Paper Matters
- It adds a 2026 reference point for readers tracking recent quantum research.
- We present an approach to unitary synthesis that implements an arbitrary n-qubit unitary operator U by a Clifford+T circuit with T-count widetildeO(2^n dF^mathcalC(U)), where...
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.