Almost-Optimal Computational Basis State Transpositions
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917744359768064 |
|---|---|
| author | Herbert, Steven Sorci, Julien Tang, Yao |
| author_facet | Herbert, Steven Sorci, Julien Tang, Yao |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_12820 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Almost-Optimal Computational Basis State Transpositions Herbert, Steven Sorci, Julien Tang, Yao Quantum Physics 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. |
| title | Almost-Optimal Computational Basis State Transpositions |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2309.12820 |