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

Russian Microelectronics

Amplitude quanta in multiparticle-system simulation

Yuri Ozhigov

Published Jan 1, 2006• 10 citations
Publisher

Abstract

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.

DOI
10.1134/s1063739706010070

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

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

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 SPIE•May 24, 2006•0 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 proceedings•Jan 1, 2007•3 citations

On relations between classical and quantum theories of information and probability

Peter Nyman

In this thesis we study quantum-like representation and simulation of quantum algorithms by using classical computers.The quantum--like representation algorithm (QLRA) was introduced by A. Khrennikov (1997) to solve the ``inverse Born's rule problem'', i.e. to construct a representation of probabilistic data-- measured in any context of science-- and represent this data by a complex or more general probability amplitude which matches a generalization of Born's rule.The outcome from QLRA matches the formula of total probability with an additional trigonometric, hyperbolic or hyper-trigonometric interference term and this is in fact a generalization of the familiar formula of interference of probabilities. We study representation of statistical data (of any origin) by a probability amplitude in a complex algebra and a Clifford algebra (algebra of hyperbolic numbers). The statistical data is collected from measurements of two dichotomous and trichotomous observables respectively. We see that only special statistical data (satisfying a number of nonlinear constraints) have a quantum--like representation. We also study simulations of quantum computers on classical computers.Although it can not be denied that great progress have been made in quantum technologies, it is clear that there is still a huge gap between the creation of experimental quantum computers and realization of a quantum computer that can be used in applications. Therefore the simulation of quantum computations on classical computers became an important part in the attempt to cover this gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. Of course, it can not be expected that quantum algorithms would help to solve NP problems for polynomial time on classical computers. However, this is not at all the aim of classical simulation. The second part of this thesis is devoted to adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulations on classical computers. Concretely we represent Simon's algorithm, Deutsch-Josza algorithm, Shor's algorithm, Grover's algorithm and quantum error-correcting codes in the Mathematica symbolic language. We see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include future algorithms in this framework.

•Jan 1, 2011•0 citations

Quantum Decoherence-Based Algorithm Security Model

Jincheng Zhang

This paper presents a novel model for assessing algorithm security based on the principles of quantum decoherence. Current approaches to algorithm security often rely on classical computational assumptions, which may be vulnerable to future advancements in quantum computing. This model leverages the inherent vulnerability of quantum systems – decoherence – to provide a more robust and realistic security assessment. We construct a simulation environment that mimics a quantum computing scenario, allowing us to evaluate the resilience of algorithms against decoherence-induced errors. The model incorporates key concepts such as quantum gates, qubit states, and decoherence rates, represented mathematically as: * State of a qubit: |ψ⟩ = ∑i ci |i⟩ * Quantum gate operation: U = ∑i,j ci cj† |i⟩⟨j| * Decoherence rate: Γ (where Γ represents the probability of a qubit losing its quantum state per unit time) * Probability of error: Pe = exp(-Γt) , where t is the computation time. The core of the model is a simulation that propagates the state of a quantum system through a series of quantum gates, incorporating decoherence effects at each step. The model's output provides a quantifiable measure of an algorithm's security against decoherence, offering a valuable tool for designing and evaluating algorithms in the face of real-world quantum computing limitations. This approach moves beyond purely theoretical security assumptions and offers a more practically relevant framework for algorithm design and security analysis. ---

•Sep 2, 2026•0 citations
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.
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.
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.
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.
In this thesis we study quantum-like representation and simulation of quantum algorithms by using classical computers.The quantum--like representation algorithm (QLRA) was introduced by A. Khrennikov (1997) to solve the ``inverse Born's rule problem'', i.e. to construct a representation of probabilistic data-- measured in any context of science-- and represent this data by a complex or more general probability amplitude which matches a generalization of Born's rule.The outcome from QLRA matches the formula of total probability with an additional trigonometric, hyperbolic or hyper-trigonometric interference term and this is in fact a generalization of the familiar formula of interference of probabilities. We study representation of statistical data (of any origin) by a probability amplitude in a complex algebra and a Clifford algebra (algebra of hyperbolic numbers). The statistical data is collected from measurements of two dichotomous and trichotomous observables respectively. We see that only special statistical data (satisfying a number of nonlinear constraints) have a quantum--like representation. We also study simulations of quantum computers on classical computers.Although it can not be denied that great progress have been made in quantum technologies, it is clear that there is still a huge gap between the creation of experimental quantum computers and realization of a quantum computer that can be used in applications. Therefore the simulation of quantum computations on classical computers became an important part in the attempt to cover this gap between the theoretical mathematical formulation of quantum mechanics and the realization of quantum computers. Of course, it can not be expected that quantum algorithms would help to solve NP problems for polynomial time on classical computers. However, this is not at all the aim of classical simulation. The second part of this thesis is devoted to adaptation of the Mathematica symbolic language to known quantum algorithms and corresponding simulations on classical computers. Concretely we represent Simon's algorithm, Deutsch-Josza algorithm, Shor's algorithm, Grover's algorithm and quantum error-correcting codes in the Mathematica symbolic language. We see that the same framework can be used for all these algorithms. This framework will contain the characteristic property of the symbolic language representation of quantum computing and it will be a straightforward matter to include future algorithms in this framework.
This paper presents a novel model for assessing algorithm security based on the principles of quantum decoherence. Current approaches to algorithm security often rely on classical computational assumptions, which may be vulnerable to future advancements in quantum computing. This model leverages the inherent vulnerability of quantum systems – decoherence – to provide a more robust and realistic security assessment. We construct a simulation environment that mimics a quantum computing scenario, allowing us to evaluate the resilience of algorithms against decoherence-induced errors. The model incorporates key concepts such as quantum gates, qubit states, and decoherence rates, represented mathematically as: * State of a qubit: |ψ⟩ = ∑i ci |i⟩ * Quantum gate operation: U = ∑i,j ci cj† |i⟩⟨j| * Decoherence rate: Γ (where Γ represents the probability of a qubit losing its quantum state per unit time) * Probability of error: Pe = exp(-Γt) , where t is the computation time. The core of the model is a simulation that propagates the state of a quantum system through a series of quantum gates, incorporating decoherence effects at each step. The model's output provides a quantifiable measure of an algorithm's security against decoherence, offering a valuable tool for designing and evaluating algorithms in the face of real-world quantum computing limitations. This approach moves beyond purely theoretical security assumptions and offers a more practically relevant framework for algorithm design and security analysis. ---