http://dcherukhin.i2p/research/research.htm
(статья: pdf ;
рукопись: ps.gz , tex.tgz ) On the complexity of unitary transformations // Discrete Mathematics and Applications.
13(6): 601-606 (2003) [links: mathnet , Zbl 1088.68609 , ams , doi ] Abstract: 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...