On the Complexity of Quantum Languages
The standard inputs given to a quantum machine are classical binary strings. In this view, any quantum complexity class is a collection of subsets of {0, 1} � . However, a quantum machine can also accept quantum states as its input. T. Yamakami has introduced a general framework for quantum operators and inputs [18]. In this paper we present several quantum languages within this model and by generalizing the complexity classes QMA and QCMA we analyze the complexity of the introduced languages. We also discuss how to derive a classical language from a given quantum language and as a result we introduce new QCMA and QMAlanguages.
The generation and behavior of the fractal Koch array factor from a Kaiser window generator is studied. The main advantage of using Kaiser windows is that pattern parameters become much more flexible through altering the Kaiser window. The mainlobe width, current distribution, side-lobe ratio are now adjustable. Different reduced array structures can be obtained by using different threshold levels. Higher threshold values result in a highly reduced number of elements but they may highly distort the pattern and, hence, the multiband behavior. Finally, we study the effect of quantization of the feeding values. Quantization is necessary for implementation and simplification purposes. Several configurations of current distributions with the corresponding patterns are illustrated for different quantization levels. It is shown that moderate quantization keeps the same interesting similarity properties at several bands.