The need to improve fidelity in quantum arena is a research gap currently which can be taken care of, for some time, by increasing the number of times an observation is made. In particular, we tried operations like addition, subtraction, multiplication, division and the results were quite promising. However, in this letter, we discuss how the combined usage of laws of quantum mechanics with high fidelity and building up circuits in a little different, newer ways can save us a lot of resources and maybe even reduce the current dependence of quantum computers on classical computers. Current models for such operations in quantum computing use up a lot of resources in doing calculations on even single qubits. In this letter, we discuss how current quantum computing models for basic arithmetic operations can be highly simplified just by developing some simple IBM Q circuits and exploiting basic laws of quantum computing. We explain the working of the quantum circuits in detail with the algorithm behind the movement of pawns on the chessboard, in future, we can use this to later develop a quantum chess engine which will boost the quality of chess. These quantum circuits can be designed on a quantum computer to play chess by any two users. From here, it can be extrapolated to create, circuits for an 8×8 board and various other pieces. However, an 8×8 chessboard is quite large and the existence of various pieces makes the circuit quite complex for us to build, so here we present quantum circuits for a 3×3 chessboard with only pawns in it. And we can achieve the same with quantum computers by designing quantum circuits. Since classical computation is used chess engines, in future, the engines can be made faster by using quantum computation, primarily because of their ability to use fewer steps to obtain at the same result as that of classical computers. Though classical computers are enough to play the game virtually, quantum computers will always be better for tackling more and more complexity in a game. Upon the arrival of quantum computers at the scene, games can now be played on a quantum computer by designing quantum circuits on it. Gradually, as the quantum computers are being developed, their potential applications in various complex challenges are being realized. Hence we can realize a practical quantum calculator by performing the operations on a real quantum computer.Ĭhess is an extremely ancient board game, which can be played using physical chess boards and can be enjoyed virtually by using classical computers. Then, we propose the first quantum algorithm to convert a decimal number to a binary one. We also show alternative two's complement based approach for the division of two numbers which does not depend on the nature of the two numbers taken and is always accurate. The proposed algorithm is an analog of the classical Newton-Raphson division algorithm and is found to be more efficient than the existing ones due to its quadratic convergence. Here, we propose a new generalized division algorithm that can divide any two numbers irrespective of their nature. The existing division algorithms have limitations in terms of the nature of the two numbers taken. We implement a new bit-wise multiplication approach for simulating multiplication of small numbers. addition, subtraction, multiplication, division, square root, logarithm and fractional powers on real quantum devices using IBM Quantum Experience (IBM QE) platform. We demonstrate a quantum calculator by experimentally simulating and running the basic arithmetic operations viz.
0 Comments
Leave a Reply. |
Details
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |