arXiv:quant-ph/0412196

Algorithmic approach to quantum physics

Yuri Ozhigov

Published Dec 26, 2004• 3 citations

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.

DOI: 10.48550/arxiv.quant-ph/0412196

Related papers

Amplitude quanta in multiparticle-system simulation

Yuri Ozhigov

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.

Russian MicroelectronicsJan 1, 200612 citations

Algorithmic Container for Physics

Yu. I. Ozhigov, Al. Y. Ozhigov, Guillaume Adenier +4 more

We represent some arguments for the possibility to embed quantum physics to the special algorithmic container which permits to extend its methods to the dynamics of thousands of particles. The key role is played by the absolute decoherence model in which the limitation of classical computational resources in the simulation is treated as the fundamental source of decoherence. We show how quantum dynamics could be visualized by means of the method of collective behavior.

AIP conference proceedingsJan 1, 20074 citations

Algorithmic approach to quantum theory 1: features of many particle quantum dynamics

Yuri Ozhigov, Igor Semenikhin

Algorithmic approach to quantum theory is considered. It is based on the supposition that every evolution of many particle system can be simulated by classical algorithms of polynomial complexity. This hypothesis agrees with all known experiments but it presumes the principle cut-off of quantum formalism because it excludes a scalable quantum computer. Algorithmic approach describes quantum evolution uniformly, without separation of measurements from the unitary dynamics; it is shown how Bohrn rule for quantum probability follows from the basic principles of this approach. The radical difference of algorithmic approach from the standard and its perspectives are discussed.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIEMay 24, 20060 citations

Quantum parallelism may be limited

Yu. I. Ozhigov

We consider quantum formalism limited by the classical simulating computer with the fixed memory. The memory is redistributed in the course of modeling by the variation of the set of classical states and the accuracy of the representation of amplitudes. This computational description completely preserves the conventional formalism and does not contradicts to experiments, but it makes impossible fast quantum algorithms. This description involves the slow down of quantum evolutions with the growth of the dimension of the minimal subspace containing entangled states, which arise in the evolution. This slow down is the single difference of the proposed formalism from the standard one; it is negligible for the systems from the usual experiments, including those in which many entangled particle participate, but grows rapidly in the attempt to realize the scalable quantum computations, which require the unlimited parallelism. The experimental verification of this version of quantum formalism is reduced to the fixation of this slow down. In all probability the memory of the abstract computer simulating quantum processes is limited by 10-20 qubits, so it iss possible to use the exiting computers for this aim.

arXiv:1610.01089Sep 20, 20160 citations

Simulation of quantum dynamics via classical collective behavior

Yu. I. Ozhigov

The simple algorithm for the simulation and visualization of non relativistic quantum dynamics is proposed that is based on a collective behavior of classical particles. Any quantum particle is represented as the swarm of its classical samples which interact by simple rules including emission and absorption of samples of tied photons. The quantum dynamics results from the collective behavior of such a swarm where the eigenstates are treated as the equilibrium states relatively to emission-absorption of photons. The entanglement is treated as a correlation between samples of the different swarms that is stored in the space-time part of the model inaccessible for a user. The amplitude is always grained. The Coulomb field between quantum particles is simulated, analogously to free flow of quantum package, by the point wise interaction between its samples and scalar photon samples which propagate by diffusion. It gives square root speedup in comparison to each-with-each method. This method obviously includes decoherence and admits the natural generalization on the QED of many particles with the linear computational cost.

arXiv:quant-ph/0602155Feb 17, 20066 citations

Quantum Dynamics and Measurement from Stability and Renormalization in a Timeless Framework v1

Sudhakar Rajnikant

We develop a derivation of dynamics of Quantum Mechanics and measurement within a fundamentally timeless and scale-invariant framework. Building on a prior reconstruction of quantum kinematics from renormalization consistency, we extend the analysis to dynamical evolution and the measurement process using three minimal principles: a global constraint (timelessness), a variational formulation, and resolution independence. We show that relational time emerges through conditional decomposition of the global state, leading to an effective Schrödinger evolution under suitable conditions on clock subsystems. Renormalization group (RG) transformations, treated as maps on the state space induced by coarse-graining, generate an effective non-unitary dynamics for reduced states. Under standard assumptions of weak coupling and scale separation, this dynamics takes Lindblad form, providing a structural origin for decoherence. A central result of this work is the formulation of a stability selection principle: configurations contributing to observable physics correspond to those that are simultaneously stationary under the action and stable under RG flow. This principle unifies dynamical selection (via the variational structure) and structural selection (via renormalization), and provides a mechanism for the emergence of classical behavior. Measurement is described as an effective sector dynamics arising from decoherence and coarse-grained evolution. The Lindblad equation admits a stochastic representation in which the system evolves between dynamically independent sectors, leading to an effective description of definite outcomes without introducing a fundamental collapse postulate. The Born rule follows from the unique quadratic measure consistent with refinement structure and is realized dynamically within this framework. Together, these results provide a structural account under minimal assumptions of quantum dynamics, decoherence, and measurement as emergent features of a timeless, renormalization-consistent theory governed by stability across scales.

Mar 21, 20260 citations