An algorithmic approach to theoretical quantum physics is described postulating that any multiparticle quantum evolution can be simulated by classical algorithms of polynomial complexity. Its implementation is presented that is based on the concept of an amplitude quantum, i.e., the smallest carrier of amplitude. As a consequence, the Born rule for quantum probability is derived within the classical urn scheme. Decoherence is treated as stemming from the inherently limited amount of computational resources available for multiparticle simulation. The algorithmic approach denies the possibility of creating a scalable quantum computer. It is therefore refutable by construction of such a computer.
展开▼
