Search

Computing technologies and methodologies always take a turn and right now, quantum computing and its mechanics are the most engaged field. This lets us propose models using quantum physics concepts and quantum mechanics. This not only opens us the scope for gaining better efficiency but also gains a new way of proposing algorithms. The current problem with the financial models is that they do not consider the negative possibilities that might lead to wrong and also inconsistent results. Additionally, this also makes usquestion the algorithm in the work itself. Even if the systems do solve all these inconsistencies, the hardware requirements of those systemsare very high. This algorithm uses quantum-based theories to make daily computations faster without extra or high-end hardware. This algorithm is more oriented toward the financial model where it takes into consideration of negative cases. Experimental results show thatthe algorithm proposed obtains the desired and optimum values based on models like Ising, Markowitz, and QUBO. [ABSTRACT FROM AUTHOR]

This study considers implementations of error correction in a simulation language on a classical computer. Error correction will be necessarily in quantum computing and quantum information. We will give some examples of the implementations of some error correction codes. These implementations will be made in a more general quantum simulation language on a classical computer in the language Mathematica. The intention of this research is to develop a programming language that is able to make simulations of all quantum algorithms and error corrections in the same framework. The program code implemented on a classical computer will provide a connection between the mathematical formulation of quantum mechanics and computational methods. This gives us a clear uncomplicated language for the implementations of algorithms. [ABSTRACT FROM AUTHOR]

The article focuses on the goal of the Grover quantum algorithm which is to find an item in a randomly ordered database. The advantage of Grover algorithm is rooted in apply a cleverly constructed Grover gate to a convenient initial entangled state of n-orbit registers. Entangled states however are very sensitive to decoherence originating from the interaction of quantum computer and its environment.