| 摘要 |
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. <IMAGE>
|
