We describe a quantum algorithm for computing the intersection of two sets and its application to associative memory. The algorithm is based on a modification of Grover’s quantum search algorithm (Grover, 1996). We present algorithms for pattern retrieval, pattern completion, and pattern correction. We show that the quantum associative memory can store an exponential number of memories and retr...

In this paper, we consider a quantum algorithm for solving the following problem: “Suppose f is a function given as a black box (that is also called an oracle) and f is invariant under some AND-mask. Examine a property of f by querying the oracle.” We compare the efficiency of our quantum algorithm with that of classical algorithms by evaluating the expected number of queries for each algorithm...

Round Robin CPU scheduling algorithm use fixed time quantum in timeshared system. In timeshared system performance is totally depends upon the selection of time quantum. Static time quantum and selection of time quantum both reason in RR CPU scheduling algorithm is disadvantage for the CPU performance. In this paper study the different dynamic RR CPU scheduling algorithm and discuss the selecti...

Quantum computers have the potential to out-perform classical computers—certain quantum algorithms run much faster than any known alternative classical algorithm. For example, Grover showed that a quantum computer can search an unordered list ofN items in timeO( √ N), providing a quadratic speed-up over the classical algorithm. In this paper, we show that we can modify Grover’s search algorithm...

Making use of an universal quantum network – QCPU proposed by me [6], I obtain the whole quantum network which can implement some known quantum algorithms including Deutsch algorithm, quantum Fourier transformation, Shor’s algorithm and Grover’s algorithm. PACS Numbers: 03.67.Lx, 89.80.+h, 03.67-a Typeset using REVTEX Supported by National Natural Science Foundation of China under Grant No. 697...

Making use of an universal quantum network – QCPU proposed by me [6], I obtain the whole quantum network which can implement some known quantum algorithms including Deutsch algorithm, quantum Fourier transformation, Shor’s algorithm and Grover’s algorithm. PACS Numbers: 03.67.Lx, 89.80.+h, 03.67-a Typeset using REVTEX Supported by National Natural Science Foundation of China under Grant No. 697...

In classical computation, a problem can be solved in multiple steps where calculated results of each step copied and used repeatedly. While quantum it is difficult to realize similar multi-step computation process because the no-cloning theorem forbids making copies an unknown state perfectly. We find method based on resonant transition protect reuse that encodes intermediate without state, pre...

In this paper, we give a quantum algorithm which solves collision problem in an expected polynomial time. Especially, when the function is two-to-one, we present a quantum algorithm which can find a collision with certainty in a worst-case polynomial time. We also give a quantum algorithm which solves claw problem with certainty in a worst-case polynomial time.

We present an exact quantum algorithm for solving the Exact Satisfiability problem, which is known to belong to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: The first step consists in the identification and efficient characterization of a restricted subspace that contains all the valid assignments (if any solutio...