Abstract: A method and device for performing a quantum algorithm where the superposition, entanglement with interference operators determined for performing selection, crossover, and mutation operations based upon a genetic algorithm. Moreover, entanglement vectors generated by the entanglement operator of the quantum algorithm may be processed by a wise controller implementing a genetic algorithm before being input to the interference operator. This algorithm may be implemented with a hardware quantum gate or with a software computer program running on a computer. Further, the algorithm can be used in a method for controlling a process and a relative control device of a process which is more robust, requires very little initial information about dynamic behavior of control objects in the design process of an intelligent control system, or random noise insensitive (invariant) in a measurement system and in a control feedback loop.

Abstract: A hardware device is for performing crossover and mutation operations based upon a genetic algorithm. The hardware device may include a random or pseudo-random number generator, and a crossover block, conditioned with a random crossover index, for generating output crossover bit-strings from current bit-strings. The device may also include a mutation block, conditioned with a random mutation index, for generating output bit-strings by switching at least one bit of each input bit-string pointed to by the mutation index. A memory may temporarily store the current bit-strings and the output bit-strings. In addition, the hardware device may include a control unit, interfaced with the random number generator, the crossover block, the mutation block and the memory and managing their functioning by generating respective control signals therefor.

Abstract: A method for performing a Simon's or Shor's quantum algorithm over a function encoded with n qubits is provided. The method includes performing a superposition operation over a set of input vectors for generating a superposition vector, performing an entanglement operation for generating a corresponding entanglement vector, and performing an interference operation for generating a corresponding output vector. The superposition operation is carried out in a comparably fast manner by generating the superposition vector by identifying the non-null components thereof and by calculating, as a function of the n qubits, the value ½n/2 of all the non-null components of the superposition vector, and by calculating indices of these components according to an arithmetic succession. The seed of this calculation is 1 and the common difference is 2n. The method may be implemented in a quantum gate.

Abstract: A quantum gate for running a Grover's quantum algorithm using a binary function having a vector basis of n qubits is provided. The quantum gate includes a superposition subsystem, an entanglement subsystem and an interference subsystem. The interference subsystem performs an interference operation on components of entanglement vectors for generating components of output vectors. The interference subsystem performs the interference operation in a very fast manner by using an adder receiving as input signals representing even or odd components of an entanglement vector, and generating a sum signal representing a weighted sum with a scale factor of the even or odd components.