Quick Navigation
Topics
Quantum Simulation
Almost-Optimal Computational Basis State Transpositions
arXiv
Authors: Steven Herbert, Julien Sorci, Yao Tang
Year
2023
Paper ID
54551
Status
Preprint
Abstract Read
~2 min
Abstract Words
45
Citations
N/A
Abstract
We give an explicit construction to perform any n-qubit computational basis state transposition using Θ(n) gates. This nearly coincides with the lower bound Ω\(n/log(nd\)) on worst-case and average-case gate complexity to perform transpositions using a d-element gate-set, which we also prove.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2023 reference point for readers tracking recent quantum research.
- We give an explicit construction to perform any n-qubit computational basis state transposition using Θ(n) gates.
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.