Quantum Fast Fourier Transform Viewed as a Special Case of Recursive Application of Cosine-Sine Decomposition
| dc.creator | Tucci, Robert R. | |
| dc.date | 2004-11-15 | |
| dc.date.accessioned | 2026-07-07T06:11:31Z | |
| dc.date.available | 2026-07-07T06:11:31Z | |
| dc.description | A quantum compiler is a software program for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). Coppersmith showed that the $\nb$-bit Discrete Fourier Transform matrix $U_{FT}$ can be decomposed in a very efficient way, as a sequence of order($\nb^2$) elementary operations. Can a quantum compiler that doesn't know a priori about Coppersmith's decomposition nevertheless decompose $U_{FT}$ as a sequence of order($\nb^2$) elementary operations? In other words, can it rediscover Coppersmith's decomposition by following a much more general algorithm? Yes it can, if that more general algorithm is the recursive application of the Cosine-Sine Decomposition (CSD). | |
| dc.description | 14 pages (files: 1 .tex, 2 .sty, 5 .eps) | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0411097 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0411097 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/92508 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Fast Fourier Transform Viewed as a Special Case of Recursive Application of Cosine-Sine Decomposition | |
| dc.type | text |