Quick Navigation
Topics
Quantum Simulation
The exact synthesis of 1- and 2-qubit Clifford+T circuits
arXiv
Authors: Travis Russell
Year
2014
Paper ID
47938
Status
Preprint
Abstract Read
~2 min
Abstract Words
72
Citations
N/A
Abstract
We describe a new method for the decomposition of an arbitrary n qubit operator with entries in mathbb{Z}\[i,frac{1}{sqrt{2}}\], i.e., of the form \(a+bsqrt{2}+i(c+dsqrt{2}\))/{sqrt{2}k}, into Clifford+T operators where nle 2. This method achieves a bound of O(k) gates using at most one ancilla using decomposition into 1- and 2-level matrices which was first proposed by Giles and Selinger.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2014 reference point for readers tracking recent quantum research.
- We describe a new method for the decomposition of an arbitrary n qubit operator with entries in mathbbZ[i,frac1sqrt2], i.e., of the form (a+bsqrt2+i(c+dsqrt2))/sqrt2^k, into...
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.