Quantum algorithms 1
Helmut Bez, Tony Croft · 2023
The quantum algorithms covered in this chapter, i.e., the Deutsch, Deutsch-Jozsa and Bernstein-Vazirani algorithms, have been chosen for their relative simplicity and theoretical interest. They do not address problems of real practical value, their purpose being to demonstrate, using simple examples, the great potential power of quantum computation relative to the digital case. The most significant breakthrough in quantum computing is Shor&s;s integer factorisation algorithm. Shor&s;s algorithm is beyond the scope of this introductory text, but its significance lies in the fact that it demonstrates the potential to factor large integers efficiently. No efficient digital algorithms for factoring large integers exist, and many current encryption algorithms rely on this being the case. Shor&s;s algorithm therefore threatens current encryption methods, and is responsible for much of the recent accelerated interest in quantum computation.