The physical Church-Turing principle asserts that a universal physical computing machine can simulate every finitely realizable physical system. It is a claim about physical laws and possible apparatus, stronger in subject matter than a mathematical account of effective symbolic calculation. Its exact force depends on what simulation accuracy and resource use are required.
David Deutsch's 1985 paper formulated a strong version in terms of perfect simulation by finite means and investigated a universal quantum model.[ref] For example, describing one qubit requires specifying its quantum state and predicting quantum measurement probabilities; copying a short list of observed outcomes does not simulate all its permitted subsequent operations. Approximation to a chosen accuracy and efficient simulation are further, distinct requirements. The principle motivates universal quantum computation without itself being an experimental proof of every proposed universality claim.

Articles by others on the same topic (0)

There are currently no matching articles.