Miniaturisation of computers components is taking us from classical to quantum physics domain. Further reduction in computer components size eventually will lead to the development of computer systems whose components will be on such a small scale that quantum physics intrinsic properties must be taken into account. The expression quantum computation and a first formal model of a quantum comput...

The performance of CPU is essentially depends on the scheduling algorithms. These algorithms provide a schedule for execution of processes waiting in ready queue. There are various scheduling algorithms; Round Robin is one of them. The performance of Round Robin algorithm is majorly depends on the quantum, generally which is static for all processes. There is not any standard way to decide the ...

Quantum game theory [1–3] is a new field of science having its roots in both game theory and quantum information theory. For about a decade quantum computer scientists have been searching for new methods of quantum algorithm design. Thorough investigation of different quantum games may bring new insight into the development of quantum algorithms. It was shown that Grover’s algorithm [4] can be ...

Current processes validation methods rely on diverse input states and exponential applications of state tomography. Through generalization of classical test theory exceptions to this rule are found. Instead of expanding a complete operator basis to validate a process, the objective is to utilize quantum effects making each gate realized in the process act on a complete set of characteristic sta...

The current paper presents a new quantum algorithm for finding multicollisions, often denoted by l-collisions, where an l-collision for a function is a set of l distinct inputs having the same output value. Although it is fundamental in cryptography, the problem of finding multicollisions has not received much attention in a quantum setting. The tight bound of quantum query complexity for findi...

In this paper, the authors present a modified convergent analytic algorithm for the solution of nonlinear boundary value problems by means of a variable parameter method and briefly, the method is called optimal variable parameter method. This method, based on the embedding of a parameter and an auxiliary operator, provides a computational advantage for the convergence of the approximate soluti...

Quantum mechanical computers can solve certain problems asymptotically faster than classical computers. One of the major advantages of quantum computation comes from a fast algorithm for the problem of finding a marked item among N items. Whereas a classical computer requires Θ(N) steps to solve this problem, Grover showed that a quantum computer can solve it using only O( √ N) steps [1], which...

It is often said that the strength of quantum computation lies in the phenomena of quantum superposition and quantum entanglement. These features of quantum computation allow performing the computation on all possible inputs that fit the quantum register. One of the greatest achievements in the theory of quantum algorithms is the quantum search algorithm introduced by Grover. A detailed descrip...

Quantum algorithms are known for providing more efficient solutions to certain computational tasks than any corresponding classical algorithm. Here we show that a single qudit is sufficient to implement an oracle based quantum algorithm, which can solve a black-box problem faster than any classical algorithm. For 2d permutation functions defined on a set of d elements, deciding whether a given ...

Quantum computers are known to be qualitatively more powerful than classical computers, but so far only a small number of different algorithms have been discovered that actually use this potential. It would therefore be highly desirable to develop other types of quantum algorithms that widen the range of possible applications. Here we propose an efficient and exact quantum algorithm for finding...