Abstract:
A hardware quantum gate for performing quantum algorithms in a very fast manner exploits the fact that a large number of multiplications required by the entanglement operation of quantum algorithms gives a null result, because only one component per row of the entanglement matrix U F is non null. The entanglement operation generates an entanglement vector by permuting or not the places of couples of opposite components of a linear superposition vector, depending on the value assumed by the function f(.) . More specifically, if function f(.) is null in correspondence of the vector identified by the first (leftmost) n qubits in common of the two n +1 qubit vectors to which a couple of opposite components that of the superposition vector is referred to, then the corresponding couple of components of the entanglement vector is equal to that of the superposition vector, otherwise is the opposite. Therefore, it is not necessary to calculate the entanglement matrix U F to generate an entanglement vector from a superposition vector, but it is sufficient copying or inverting components of a superposition vector to generate corresponding components of an entanglement vector, depending on the values of the function f(.) processed by the quantum algorithm. This can be easily done using driven switches input with a pair of components of opposite value of a superposition vector.
Abstract:
A method for performing a Simon's or Shor's quantum algorithm over a certain function f ( x ) encoded with a certain number n of qubits, comprises
performing a superposition operation over a set of input vectors, generating a superposition vector, performing an entanglement operation, generating a corresponding entanglement vector, performing an interference operation, generating a corresponding output vector.
This method carries out the superposition operation in a comparably fast manner because it contemplates the operation of generating the superposition vector by identifying only the non null component thereof and by calculating, in function of the number n of qubits, the value 1/2 n /2 of all the non null components of the superposition vector, and by calculating indices of these components according to an arithmetical succession, the seed of which is 1 and the common difference is 2 n . This method is implemented in a relative quantum gate.
Abstract:
A circuit implementing a non-integer order dynamic system includes a neural network (1 to 5) adapted to receive at least one input signal (IS) and to generate therefrom at least one output signal (OS). The input and output signals (IS, OS) are related to each by a non-integer order integro-differential relationship through the coefficients of the neural network (1 to 5). A plurality (I, II) of such circuits, implementing respective non-integer order (PI λ D µ ) controllers can be interconnected in an arrangement wherein any of the integral (200) or differential (202) blocks included in one of those circuits generates a signal which is fed to any of the integral (200) or differential (204) blocks of another circuit in the system.
Abstract:
A method of performing a Grover's or a Deutsch-Jozsa's quantum algorithm using a certain binary function defined on a space having a basis of vectors of n of qubits, comprises carrying out a superposition operation over input vectors for generating components of linear superposition vectors referred on a second basis of vectors of n +1 qubits, an entanglement operation over components of the linear superposition vectors for generating components of numeric entanglement vectors, and an interference operation over components of the numeric entanglement vectors for generating components of output vectors. The method allows a non negligible time saving because the entanglement operation is carried out by generating, for components of each superposition vector, corresponding components of a numeric entanglement vector, each component referred to a respective vector of the second basis being
equal to the corresponding component of the respective superposition vector, if the binary function is null in correspondence of the vector of the first basis constituted by the first n qubits of the respective vector of the second basis, or the opposite of the corresponding component of the respective superposition vector, if the binary function is non null in correspondence of the vector of the first basis constituted by the first n qubits of the respective vector of the second basis. This method can be implemented in a relative quantum gate for running a Grover's or a Deutsch-Jozsa's quantum algorithm.
Abstract translation:使用在具有量子位n的向量的基础的空间上定义的特定二进制函数来执行Grover或Deutsch-Jozsa的量子算法的方法包括对输入向量执行叠加操作,用于生成参考的线性叠加向量的分量 n + 1个量子位的向量的第二基础,对于产生数字纠缠矢量的分量的线性叠加矢量的分量的纠缠操作,以及对于产生输出矢量的分量的数字纠缠矢量的分量的干扰操作。 该方法允许不可忽略的时间节省,因为纠缠操作是通过对每个叠加向量的分量产生数字纠缠矢量的对应分量来执行的,每个分量被称为第二基础的相应矢量相等 对应于相应叠加矢量的相应分量,如果二进制函数对应于由第二基元的相应矢量的第一n个量子位构成的第一基准矢量或与相应叠加矢量的相应分量相反的二进制函数为零 如果二进制函数对应于由第二基础的相应向量的第一n个量子位构成的第一基数的向量,则该二进制函数是非零的。 该方法可以在相对量子门中实现,用于运行Grover或Deutsch-Jozsa的量子算法。
Abstract:
A quantum gate carries out the superposition operation of a Grover's or of a Deutsch-Jozsa's quantum algorithm in a very fast manner because it performs all multiplications by using logic gates, that immediately output the result. The superposition operation of a Grover's and a Deutsch-Jozsa's quantum algorithm substantially consists in performing the Hadamard rotation over an input set of vectors producing a set of rotated vectors, calculating the tensor product of all the rotated vectors among them outputting a linear superposition set of vectors. The tensor product of all rotated vectors among them is carried out by logic gates. Moreover, a method of performing the superposition operation of a Grover's or of a Deutsch-Jozsa's quantum algorithm over an input set of vectors is disclosed.
Abstract:
A quantum gate for carrying out a Grover's quantum algorithm using a certain binary function ( f ) defined on a space having a vector basis of n qubits, comprises a superposition subsystem carrying out a superposition operation on components of input vectors for generating components of superposition vectors on a second vector basis of n +1 qubits, an entanglement subsystem carrying out an entanglement operation on components of said linear superposition vectors for generating components of entanglement vectors, and an interference subsystem carrying out an interference operation on components of said entanglement vectors for generating components of output vectors. This quantum gate is capable of performing the interference operation of Grover's algorithm in an extremely fast manner by employing an adder input with 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, and an array of adders each input with a respective signal representative of an even or odd component, respectively, of an entanglement vector, and with the weighted sum signal, and generating a signal representative of an even or odd component, respectively, of an output vector as the difference between the weighted sum signal and the signal representing an even or odd component of an entanglement vector. A method for carrying out an interference operation of a Grover's quantum algorithm is also disclosed.
Abstract:
A method for generating a random number sequence whose randomness properties are determined a priori , comprises the steps of defining a parametric map; calculating, in function of parameters of the map, the entropy and the Lyapunov exponent of random number sequences obtainable using the parametric map; identifying at least a set of values of parameters for which the entropy and the Lyapunov exponent are positive numbers the map has no attracting point; assigning a pre-established value as a first feedback value and carrying out cyclically the following steps for generating a random number sequence:
(i) determining said parameters inside the set as the numerical values of respective physical quantities; (ii) outputting a random number, according to said map with the parameters and the assigned feedback value; (iii) assigning as new feedback value said output random number.
A circuit, preferably realized using a switched current technique, implements the method of the invention for generating a random bit sequence.