|
| | | | |
| | | |
| Stat |
Members: 3645
Articles: 2'504'585
Articles rated: 2609
25 April 2024 |
|
| | | | |
|
Article overview
| |
|
|
A Practical Quantum Algorithm for the Schur Transform | | William M. Kirby
; Frederick W. Strauch
; | | Date: |
21 Sep 2017 | | Abstract: | We describe an efficient quantum algorithm for the quantum Schur transform.
The Schur transform is an operation on a quantum computer that maps the
standard computational basis to a basis composed of irreducible representations
of the unitary and symmetric groups. We simplify and extend the algorithm of
Bacon, Chuang, and Harrow, and provide a new practical construction as well as
sharp theoretical and practical analyses. Our algorithm decomposes the Schur
transform on $n$ qubits into $O(n^4 log(n/{epsilon}))$ operators in the
Clifford+T fault-tolerant gate set. We extend our qubit algorithm to decompose
the Schur transform on $n$ qudits of dimension $d$ into $O(d^{1+p} n^{2d+1}
log^p (dn/{epsilon})$) primitive operators from any universal gate set, for
$p {approx} 3.97$. | | Source: | arXiv, 1709.7119 | | Services: | Forum | Review | PDF | Favorites | |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
|
News, job offers and information for researchers and scientists:
| |
REGISTER