Article
Licensed
Unlicensed
Requires Authentication
On the complexity of unitary transformations
-
D. Yu. Cherukhin
Published/Copyright:
December 1, 2003
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 = 2k we find precise values of the complexity of those transformations.
Published Online: 2003-12-01
Published in Print: 2003-12-01
Copyright 2003, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Constantin Constantinovich Mardzhanishvili (to the centenary of the birth)
- Structural equivalence of s-tuples in random discrete sequences
- Limit theorems and testing hypotheses on Markov chains
- On the complexity of unitary transformations
- Inert matrices and matchings in partially oriented trees
- On primitive subgroups of full affine groups of finite semi-fields
- A semi on-line algorithm for the partition problem
- On limit theorems for the generalised allocation scheme
- On the number and structure of sum-free sets in a segment of positive integers
Articles in the same Issue
- Constantin Constantinovich Mardzhanishvili (to the centenary of the birth)
- Structural equivalence of s-tuples in random discrete sequences
- Limit theorems and testing hypotheses on Markov chains
- On the complexity of unitary transformations
- Inert matrices and matchings in partially oriented trees
- On primitive subgroups of full affine groups of finite semi-fields
- A semi on-line algorithm for the partition problem
- On limit theorems for the generalised allocation scheme
- On the number and structure of sum-free sets in a segment of positive integers
