Editing Quantum information (section)

==== Development from computer science and mathematics ====
{{See also|Quantum supremacy|Quantum algorithm}}
With the advent of [[Alan Turing]]'s revolutionary ideas of a programmable computer, or [[Turing machine]], he showed that any real-world computation can be translated into an equivalent computation involving a Turing machine.<ref>{{Cite web|last=Weisstein|first=Eric W.|title=Church–Turing Thesis|url=https://mathworld.wolfram.com/Church-TuringThesis.html|access-date=2020-11-13|website=mathworld.wolfram.com|language=en}}</ref><ref name="Deutsch1985"/> This is known as the [[Church–Turing thesis]].

Soon enough, the first computers were made, and computer hardware grew at such a fast pace that the growth, through experience in production, was codified into an empirical relationship called [[Moore's law]]. This 'law' is a projective trend that states that the number of transistors in an [[integrated circuit]] doubles every two years.<ref name="Moore1998"/> As transistors began to become smaller and smaller in order to pack more power per surface area, quantum effects started to show up in the electronics resulting in inadvertent interference. This led to the advent of quantum computing, which uses quantum mechanics to design algorithms.

At this point, quantum computers showed promise of being much faster than classical computers for certain specific problems. One such example problem was developed by [[David Deutsch]] and [[Richard Jozsa]], known as the [[Deutsch algorithm|Deutsch–Jozsa algorithm]]. This problem however held little to no practical applications.<ref name="Nielsen2010" /> [[Peter Shor]] in 1994 came up with a very important and practical [[Shor's algorithm|problem]], one of finding the prime factors of an integer. The [[discrete logarithm]] problem as it was called, could theoretically be solved efficiently on a quantum computer but not on a classical computer hence showing that quantum computers should be more powerful than Turing machines.