Quantum computation, in particular Grover’s algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an N element database require at most O(N) time complexity. Grover’s algorithm is able to find a solution with high probability in O( √ N ) time through an amplitude amplification scheme. In this ...

Abstract Quantum walks are powerful tools for building quantum search algorithms. However, these success probabilities far below 1. Amplitude amplification is usually used to amplify probability, but the souffl'e problem follows. Only stop at right step can we achieve a maximum probability. Otherwise, as number of steps increases, probability may decrease, which will cause troubles in practical...

A new quantum algorithm for a search problem and its computational complexity are discussed. It is shown in the search problem containing 2n objects that our algorithm runs in polynomial time.

Deep neural networks have proven to be effective in solving computer vision and natural language processing problems. To fully leverage its power, manually designed network templates, i.e., Residual Networks, are introduced deal with various tasks. These hand-crafted rely on a large number of parameters, which both data-dependent laborious. On the other hand, architectures suitable for specific...

The process of disguising a plaintext into ciphertext is called encryption and back into plaintext is called decryption. A cryptographic algorithm, is also called a cipher, is the mathematical function used for encryption and decryption. Many algorithms are available for this purpose. Triple DES is such an algorithm. Encryption using triple DES is possible in two different ways; they are triple...

Abstract. The Subset Sum Problem is a member of the NP-complete class, so no known polynomial time algorithm exists for it. Although there are polynomial time approximations and heuristics, these are not always acceptable, yet exact-solution algorithms are unfeasible for large input. Quantum computation offers new insights for not only the Subset Sum Problem but also the entire NP-complete clas...