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 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.