Due to the difficulty of constructing new quantum algorithms, frameworks that facilitate this construction are of great importance in quantum computing. These frameworks reduce the problem of coming up with a quantum algorithm to that of constructing some combinatorial object that is often much simpler to reason about. The implementation and analysis of an algorithm for the specified problem fo...

We investigate quantum computational complexity of calculating partition functions of Ising models. We construct a quantum algorithm for an additive approximation of Ising partition functions on square lattices. To this end, we utilize the overlap mapping developed by Van den Nest, Dür, and Briegel [Phys. Rev. Lett. 98, 117207 (2007)] and its interpretation through measurementbased quantum comp...

In Round-Robin Scheduling, the quantum time is static and tasks are scheduled such that no process uses CPU time more than one slice time each cycle. If quantum time is too large, the response time of the processes will not be tolerated in an interactive environment. If quantum the time is too small, unnecessary frequent context switch may occur. Consequently, overheads result in fewer throughp...

quantitative relationships between molecular structure and azolo-adamantanes derivatives were discovered by different chemometric tools including factor analysis based multiple linear regressions (fa-mlr), principle component regression analysis (pcra), and genetic algorithm-partial least squares ga-pls. the fa-mlr describes the effect of geometrical and quantum indices on enzyme inhibition act...

The method of quantum computation by adiabatic evolution has been proposed as a general way of solving combinatorial search problems on a quantum computer [1]. Whereas a conventional quantum algorithm is implemented as a sequence of discrete unitary transformations that form a quantum circuit involving many energy levels of the computer, the adiabatic algorithm works by keeping the state of the...

Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, the quantum ergodic regime, and quasi-integrable motion. As an example we use the quantum sawtooth algorithm which can be implemented in a polynomial number of quantum gates. It i...

The hypercomputers compute functions that cannot be computed by a Turing machine. Recently, Tien D. Kieu has proposed a hypercomputational quantum algorithm, which uses as physical referent the quantum harmonic oscillator and in principle solves Hilbert’s tenth problem. An analysis of the Kieu’s algorithm is made and it is deduced that the algorithm is based in the dynamical algebra associated ...