Adil Yafsayov

Learn More
1. Introduction. Recently P. Shor [1] discovered an efficient quantum " polynomial-time algorithm " (length (lg 2 N) k for some finite k) for factoring large numbers N in the form of a product of prime factors. This event makes the implementation of more efficient quantum gates (see [2]) an actual problem of quantum engineering. The quality of the(More)
  • 1