Algorithmic approach to quantum physics

TL;DR

This paper proposes an algorithmic framework for simulating quantum many-particle systems on classical computers, deriving fundamental quantum principles from computational constraints, and offering a unified view of quantum dynamics without reliance on observers.

Contribution

It introduces an algorithmic approach that derives quantum rules from computational limitations and unifies quantum dynamics without the need for measurement or observer dependence.

Findings

Born rule and decoherence derived from minimal amplitude value

Unified description of quantum dynamics without measurement

Limits on classical computation restrict scalable quantum computing

Abstract

Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the analysis, and a simulation gives a "film" which visualizes many particle quantum dynamics and is demonstrated to a user of the model. Restrictions following from the algorithm theory are considered on a level of fundamental physical laws. Born rule for the calculation of quantum probability as well as the decoherence is derived from the existence of a nonzero minimal value of amplitude module - a grain of amplitude. The limitation on the classical computational resources gives the unified description of quantum dynamics that is not divided to the unitary dynamics and measurements and does not depend on the existence of observer. It is proposed the description of states based on the nesting of particles in each other that permits to account the effects of all levels in the same model. Algorithmic approach admits the possibility of refutation, because it forbids the creation of a scalable quantum computer that is allowed in the conventional quantum formalism.