  A quantum processor (the programmable gate array) is a quantum network with a
fixed structure. A space of states is represented as tensor product of data and
program registers. Different unitary operations with the data register
correspond to "loaded" programs without any changing or "tuning" of network
itself. Due to such property and undesirability of entanglement between program
and data registers, universality of quantum processors is subject of rather
strong restrictions. By different authors was developed universal "stochastic"
quantum gate arrays. It was proved also, that "deterministic" quantum
processors with finite-dimensional space of states may be universal only in
approximate sense. In present paper is shown, that using hybrid system with
continuous and discrete quantum variables, it is possible to suggest a design
of strictly universal quantum processors. It is shown also that "deterministic"
limit of specific programmable "stochastic" U(1) gates (probability of success
becomes unit for infinite program register), discussed by other authors, may be
essentially same kind of hybrid quantum systems used here.
