On the complexity of unitary transformations
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 378855646 | ||
| 003 | CHVBK | ||
| 005 | 20180305123334.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 161128e20031201xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1515/156939203322733291 |2 doi |
| 035 | |a (NATIONALLICENCE)gruyter-10.1515/156939203322733291 | ||
| 100 | 1 | |a Cherukhin |D D. Yu | |
| 245 | 1 | 0 | |a On the complexity of unitary transformations |h [Elektronische Daten] |c [D. Yu. Cherukhin] |
| 520 | 3 | |a In this paper, we suggest a method to derive lower bounds for the complexity of non-branching programs whose elementary operations are unitary transformations over two complex numbers. This method provides us with estimates of the form Ω(n log n) for unitary operators Cn → Cn , in particular, for the Fourier and Walsh transformations. For n = 2 k we find precise values of the complexity of those transformations. | |
| 540 | |a Copyright 2003, Walter de Gruyter | ||
| 773 | 0 | |t Discrete Mathematics and Applications |d Walter de Gruyter |g 13/6(2003-12-01), 601-606 |x 0924-9265 |q 13:6<601 |1 2003 |2 13 |o dma | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/156939203322733291 |q text/html |z Onlinezugriff via DOI |
| 908 | |D 1 |a research article |2 jats | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1515/156939203322733291 |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 100 |E 1- |a Cherukhin |D D. Yu | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Discrete Mathematics and Applications |d Walter de Gruyter |g 13/6(2003-12-01), 601-606 |x 0924-9265 |q 13:6<601 |1 2003 |2 13 |o dma | ||
| 900 | 7 | |b CC0 |u http://creativecommons.org/publicdomain/zero/1.0 |2 nationallicence | |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-gruyter | ||