Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

AIP conference proceedings

Algorithmic Container for Physics

Yu. I. Ozhigov, Al. Y. Ozhigov, Guillaume Adenier, Andrei Yu. Khrennikov, PEKKA J. LAHTI, Vladimir I. Man’ko, Theo M. Nieuwenhuizen

Published Jan 1, 2007• 3 citations
Publisher

Abstract

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.

DOI
10.1063/1.2827301

Related papers

Algorithmic approach to quantum physics

Yuri Ozhigov

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.

arXiv:quant-ph/0412196•Dec 26, 2004•4 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/0602155•Feb 17, 2006•4 citations

Simulating quantum dynamics in terms of classical collective behavior

Yuri Ozhigov

A straightforward algorithm is proposed for simulating and visualizing nonrelativistic quantum dynamics in terms of the collective behavior of classical particles. In this approach, a quantum particle is treated as a swarm (collection) of its classical samples interacting with one another by simple rules involving the emission and absorption of associated photons. The quantum dynamics is regarded as resulting from the collective behavior of the swarm, and the eigenstates are treated as equilibrium states of the process of photon emission and absorption. Entanglement is seen as classical correlation between samples from distinct swarms; the information on this correlation is stored in a spatiotemporal section of the model inaccessible to the user. Amplitudes are invariably treated as consisting of amplitude quanta. A Coulomb field experienced by quantum particles is represented in a similar manner to the free spreading of a wave packet, by point interaction between the particle samples and the samples of scalar photons propagating by diffusion. This provides a square-root gam in computational speed against the direct method involving item-by-item examination. The approach presented covers decoherence and allows natural generalization to multiparticle quantum electrodynamics, the amount of memory required growing linearly.

Russian Microelectronics•May 1, 2007•2 citations

About mathematical apparatus of many body quantum dynamics

Yu. I. Ozhigov

We discuss the possibility to modify many-body Hilbert quantum formalism that is necessary for the representation of quantum systems dynamics. The notion of effective classical algorithm and visualization of quantum dynamics play the key role.

arXiv:quant-ph/0604055•Apr 8, 2006•2 citations

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 Microelectronics•Jan 1, 2006•10 citations

Quantum Quantum Decoherence Calculation

Jincheng Zhang

Quantum Quantum Decoherence Calculation is a novel computational approach leveraging the unique properties of quantum coherence to precisely calculate complex quantum decoherence scenarios. Traditional quantum computing relies on classical algorithms, which are limited in their ability to accurately model and resolve the inherent decoherence processes that significantly impact quantum computation. This research proposes a new method employing quantum entanglement to construct a specialized calculation framework designed to capture and quantify decoherence effects, leading to substantially improved accuracy in simulating and predicting quantum systems. The core mechanism centers around strategically manipulating quantum states to generate and analyze decoherence patterns, ultimately providing a more reliable foundation for quantum algorithm design and optimization. The current method demonstrates superior performance in simulating complex decoherence dynamics compared to existing techniques, offering a significant advancement in the field of quantum computational fidelity. This work establishes a foundational basis for a new paradigm in quantum computation, emphasizing the crucial role of quantum coherence in achieving precise results.

•Sep 6, 2026•0 citations
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.
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.
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.
A straightforward algorithm is proposed for simulating and visualizing nonrelativistic quantum dynamics in terms of the collective behavior of classical particles. In this approach, a quantum particle is treated as a swarm (collection) of its classical samples interacting with one another by simple rules involving the emission and absorption of associated photons. The quantum dynamics is regarded as resulting from the collective behavior of the swarm, and the eigenstates are treated as equilibrium states of the process of photon emission and absorption. Entanglement is seen as classical correlation between samples from distinct swarms; the information on this correlation is stored in a spatiotemporal section of the model inaccessible to the user. Amplitudes are invariably treated as consisting of amplitude quanta. A Coulomb field experienced by quantum particles is represented in a similar manner to the free spreading of a wave packet, by point interaction between the particle samples and the samples of scalar photons propagating by diffusion. This provides a square-root gam in computational speed against the direct method involving item-by-item examination. The approach presented covers decoherence and allows natural generalization to multiparticle quantum electrodynamics, the amount of memory required growing linearly.
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.
Quantum Quantum Decoherence Calculation is a novel computational approach leveraging the unique properties of quantum coherence to precisely calculate complex quantum decoherence scenarios. Traditional quantum computing relies on classical algorithms, which are limited in their ability to accurately model and resolve the inherent decoherence processes that significantly impact quantum computation. This research proposes a new method employing quantum entanglement to construct a specialized calculation framework designed to capture and quantify decoherence effects, leading to substantially improved accuracy in simulating and predicting quantum systems. The core mechanism centers around strategically manipulating quantum states to generate and analyze decoherence patterns, ultimately providing a more reliable foundation for quantum algorithm design and optimization. The current method demonstrates superior performance in simulating complex decoherence dynamics compared to existing techniques, offering a significant advancement in the field of quantum computational fidelity. This work establishes a foundational basis for a new paradigm in quantum computation, emphasizing the crucial role of quantum coherence in achieving precise results.