Quantum algorithms are defined as any algorithm that uses superposition / quantum mechanic principles to solve a given problem. More specifically they are the algorithmss that will run faster on a quantum computer than their conterparts in classical computers. As irony would have it quantum algorithms are generally understood more throughly than the machines that would run them. Some of the many important algorithms are, Deutsch’s black box, Grover’s search algorithm, and Shor’s factorisation. There are also algorithms for quantum error correction that have been proposed.

Log in or register to write something here or to contact authors.