IBM claims its quantum computers outperform classical ones

Robert Hundt

The term Beyond Classical is now the preferred term to describe computation that can be run efficiently on a quantum computer but would be intractable to run on a classical computer. A seminal paper by Google claimed to have reached this goal by computing a result in 200 seconds that a supercomputer would need 10,000 years to compute. Soon after publication, IBM claimed that the same computation could be done in just a few days on the Summit supercomputer. In this chapter, we analyze this disagreement. We discuss the proposition, implement and simulate the circuit, estimate simulation time for 53 qubits, and contrast Google’s claim against our implementation and IBM’s estimation result.

Shamini Bundell, Nick Petrić Howe

Dominik Hangleiter, Jens Eisert

Quantum computers have improved and recent experiments have claimed quantum advantage -- completion of a computational task that is evidently hard for any conventional computer. The problem solved is that of obtaining samples, by quantum measurement, from a certain probability distribution. This review shows in what precise way quantum random sampling can be seen as a computation. It explains what that computation solves, in what way it outperforms classical computations, and what methods of verification are available. Quantum random sampling becomes a first test of the presumed exponential computational advantage of quantum computers over classical ones.

Karmela Padavic-Callaghan

Anjum Ashraaf, Hasham Sarwar, Ghulam Murtaza

Quantum computing has gained a lot of interest recently because of its claims of solving some problems that are almost impossible solving in classical computing.Prime factorization of big numbers using Shor's algorithm and Grover database search algorithm are two of them.Furthermore, quantum algorithms are developed to make it more realistic in real world.In classical computing the basic unit of computation is a bit which is in 0 or 1 state at a time, whereas in quantum computing it is called a qbit which can be 0 and 1 at the same time and we call it superposition.This paper proposes an implementation of quantum full adder using IBM quantum experience.Quantum circuits are drawn using Qiskit and run on Qiskit simulators, IBM quantum simulators and real IBM quantum machines.Proposed circuit will help in future for drawing more complex circuits and algorithms.