Classical Stochasticity Using Quantum Computers

arXiv:2606.09384 · quant-ph · Submitted 2026-06-08 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: Quantum Radio. Generated commentary on the latest quantum physics and condensed matter papers.

Kai: I'm Kai.

Mira: And I'm Mira, here with Lev.

Kai: We're looking at the paper: "Classical Stochasticity Using Quantum Computers".

Mira: Here's the gist of the paper. Quantum algorithms can be used to model classical stochastic simulations as the measurement process is inherently random <ref:2606.09384#pg2>.

Kai: The paper suggests that the output of a quantum algorithm for a non-linear ODE should be interpreted as a stochastic result because the inherent non-determinism of measurement is intrinsic to quantum systems <ref:2606.09384#pg3>.

Mira: They illustrate this by comparing the classical stochasticity of the Lorenz system with measurements obtained using quantum algorithms <ref:2606.09384#pg2>.

Kai: Modeling Non-linear Dynamics The paper focuses on modeling complex non-linear systems using deterministic chaos, referencing Edward Lorenz's work in the 1960s to model weather patterns <ref:2606.09384#pg2>.

Title and authors: Kai: So we're looking at this paper called "Classical Stochasticity Using Quantum Computers" and it's about using quantum algorithms to model classical systems that we usually handle with random numbers, like weather patterns or things in finance.

Mira: It suggests that because measurement itself is inherently random in quantum mechanics, we can use those quantum algorithms to simulate these classical stochastic simulations.

Lev: So what the paper is doing is taking a system like the Lorenz system, which is a classic model for chaotic behavior, and running it through two different quantum methods to see how it behaves compared to classical simulations.

Kai: Right, so they're using things like FABLE and Unitary time evolution for the Lorenz-sixty-three system and comparing what those algorithms give us against the standard numerical trajectory of that system.

Mira: The key point here is that when you use a quantum code only, the output you get from measurement will have this inherent randomness because of how quantum mechanics works, which is something classical simulations don't quite capture in the same way.

Kai: And they show that if we introduce a random variable into the non-linear differential equation itself, the resulting classical system starts to look very similar to what you get from that quantum output.

Lev: That makes sense when you think about how these stochastic systems are modeled; it suggests that adding this quantum randomness might be a way to capture some of the natural noise or unpredictability in those complex dynamics.

Mira: They also discuss improvements, and they point out that post-processing methods used for digital systems have been tested against these quantum outputs, but those are hybrid methods because you need classical computers to clean up the results.

Kai: And they look at how much randomness is involved here, specifically tying the variance in measurement output to what we think is entanglement present in the qubits.

Lev: That's a really important connection because it suggests that this quantum noise isn't just random noise; it might actually be a measurable signature of entanglement within the quantum system.

Mira: It’s interesting because they quantify this using the binomial distribution for how many measurements you get, and show that the error in estimating something like the probability p zero falls with the square of the sampling interval, which is good news for precision as you take more shots.

Kai: So basically, they’re saying that if you use unprocessed output from a quantum computer to model a non-linear differential equation, your predicted trajectories will be stochastic because of that measurement randomness.

Lev: It sounds like the main implication here is that for modeling these complex systems far from equilibrium, especially in unstable regions where chaos reigns, using quantum measurement and tomographic methods could be interesting ways forward.

Mira: They mention that they are approximating the situation assuming unentangled qubits because the difference in variance between quantum randomness and a multinomial random system is only about three percent.

Kai: So, to wrap up this paper on "Classical Stochasticity Using Quantum Computers," it seems the core idea is that quantum measurement introduces a type of stochasticity into classical simulations, and they've shown how this matches the behavior of systems where you deliberately introduce randomness into the equation.

Lev: For me, what this means for running real hardware is that if you use these quantum algorithms to model something like atmospheric circulation or complex fluid dynamics, you need to be prepared for that inherent stochasticity in your results.

Mira: And I think it pushes us toward thinking about how measurement itself is not just a tool for finding answers, but a source of the randomness we see in the world when we observe these systems.

Kai: It's a different way to look at modeling deterministic chaos; instead of trying to perfectly predict every tiny detail, you embrace the inherent randomness from the quantum measurement process.

Lev: So as we look ahead, they suggest that for simulating these highly complex and unstable regions, using quantum measurement and tomographic methods might be a promising path.

Mira: It's a fine point about where they are stopping; they explored one trajectory and the influence of stochasticity on it, but they didn't develop codes for distributional time evolution yet.

Kai: That’s fair; pushing those boundaries is what the next steps in this kind of research will likely focus on.

Lev: So we've looked at how measurement noise relates to classical chaos and where the paper suggests future work might go.

The paper's summary: Kai: So, to recap, this paper is basically saying that when you use quantum computers to model something like the Lorenz system—which is a chaotic weather model—the output you get isn't perfectly smooth; it has this inherent randomness because of how quantum measurement works.

Mira: Exactly. They’re showing that even though the underlying rules of the system are deterministic, the way we measure them with a quantum machine introduces noise, and that noise turns the simulation into a stochastic result.

Lev: From my side, what that means is that if you run this on real hardware, you can't just rely on a perfect trajectory; you have to account for this inherent measurement uncertainty in your error correction schemes. It’s not just adding random numbers; it’s a specific kind of noise dictated by the quantum process itself.

Kai: The paper talks about two specific algorithms they used to tackle the Lorenz system, FABLE and Unitary time evolution, and they compare those outputs directly against what a normal classical computer would produce.

Mira: They show that when you look at the measured points from these quantum algorithms, they don't line up perfectly with the smooth classical trajectory; instead, the measurements are scattered around it in a way that looks like true randomness.

Lev: And they quantify this randomness by looking at how much variance there is in those measurement results, which they link to the entanglement inside the qubits themselves. It suggests that this noise isn't just an artifact of a poor simulation; it’s actually a signature of how entangled the system is behaving.

Kai: So, you're saying that if we want to model complex, non-linear systems that are far from equilibrium—like those weather patterns—using quantum tools, we have to accept this stochastic nature in our results because of the measurement process.

Mira: Right. The authors conclude that if you feed unprocessed output from a quantum computer into a differential equation solver, the predicted trajectories will inherently be stochastic. It’s less about finding a perfect answer and more about understanding how randomness enters the system's evolution at its core.

Lev: That leads to some interesting future directions they suggest; they mention that in really unstable regions, especially when systems are far from equilibrium, using quantum measurement and tomographic methods could be a way to look deeper into what’s happening there.

Kai: It sounds like the next step is moving beyond just solving the equations and actually using those quantum measurement techniques to map out those complex dynamics where things get really chaotic.

Mira: And they do flag that they aren't yet developing codes for distributional time evolution, which means this is more of a starting point exploring one specific trajectory and how noise affects it, not a fully developed method for all kinds of time evolution yet.

Lev: That’s the caveat; it’s an interesting exploration, but you still have to deal with the practical overhead of running those measurement processes on actual hardware before you can really use them for anything big.

The paper's improvements: Tom: So, we're talking about how this paper suggests ways to make these quantum simulations better, and Kai, what are those suggestions?

Kai: Well, they look at what they did—how much fidelity they got on their actual hardware—and then they propose using those results to build something more robust. They point toward using quantum measurement and tomographic methods when you're dealing with systems that are really unstable or far from equilibrium.

Mira: That makes sense because the inherent noise we discussed earlier, the stochasticity from measurement, is what you need to handle if you’re simulating those highly chaotic regions of a system.

Lev: From an error correction standpoint, that means if we're going to run this on real quantum hardware, we have to prepare our methods for that kind of noise—it's not just about getting the answer right; it's about managing the noise as part of the simulation itself.

Kai: They also mention a specific approximation they made when they looked at the variance difference between quantum randomness and a multinomial random system, saying that this difference was only about three percent, which justifies assuming unentangled qubits for that calculation.

Mira: That’s actually a big assumption because if those qubits are entangled in a real system, that three percent difference could be way bigger than they calculated. So the paper suggests testing those assumptions to see if we need to account for more complex entanglement.

Lev: I agree with Mira there; assuming unentangled qubits is a simplification, and when you're building hardware for actual applications, that kind of error in the model assumption needs to be addressed because it could lead you down the wrong path on real systems.

Kai: So they’re essentially saying, okay, this is a good start for modeling chaos with quantum noise, but to get closer to what’s happening in nature—like those unstable regions—we need better tools that can handle more complex entanglement.

Mira: Exactly. The next big challenge for this kind of research seems to be developing the actual codes for distributional time evolution, which is how you track the entire probability distribution over time, not just one specific path.

Lev: And that’s where the heavy lifting is; developing those codes is what moves this from a neat theoretical comparison to something that could actually be implemented on a real quantum computer.

Conclusion: Kai: So, to wrap up on this paper "Classical Stochasticity Using Quantum Computers," we’re talking about how quantum measurement introduces a type of randomness into classical simulations of chaotic systems like the Lorenz system.

Mira: It shows that when you use quantum algorithms for these models, the output isn't perfectly smooth; it has this inherent stochasticity because of how you measure the system.

Lev: From my point of view, this means if we’re running these simulations on real hardware, we have to account for that measurement uncertainty in our error correction schemes because it's not just a simple random number addition.

Kai: The paper uses two specific quantum algorithms, FABLE and Unitary time evolution, and they compare those measured outputs directly against what a normal classical computer would produce.

Mira: They show that the measured points from these quantum methods don't line up perfectly with the smooth classical trajectory; instead, they're scattered around it in a way that looks like real randomness.

Lev: And they quantify this randomness by looking at the variance in those measurement results, which they link to how entangled the qubits themselves are. It suggests this noise is actually a signature of entanglement present in the system.

Kai: So, you’re saying that if we want to model complex, non-linear systems far from equilibrium using quantum tools, we have to accept this stochastic nature because of the measurement process itself.

Mira: Right. The authors conclude that if you feed unprocessed output from a quantum computer into a differential equation solver, the predicted trajectories will inherently be stochastic. It’s about understanding how randomness enters the system's evolution at its core.

Lev: That leads to some interesting future directions they suggest; they mention that in really unstable regions, especially when systems are far from equilibrium, using quantum measurement and tomographic methods could be a way to look deeper into what’s happening there.

Kai: It sounds like the next step is moving beyond just solving the equations and actually using those quantum measurement techniques to map out those complex dynamics where things get really chaotic.

Mira: And they do flag that they aren't yet developing codes for distributional time evolution, which means this is more of a starting point exploring one specific trajectory and how noise affects it, not a fully developed method for all kinds of time evolution yet.

Lev: That’s the caveat; it’s an interesting exploration, but you still have to deal with the practical overhead of running those measurement processes on actual hardware before you can really use them for anything big.

Kai: So, in short, this paper "Classical Stochasticity Using Quantum Computers" shows that quantum measurement introduces a type of stochasticity into classical simulations, and they've demonstrated how this matches systems where you deliberately introduce randomness into the equation.

Mira: It’s a different way to look at modeling deterministic chaos; instead of trying to perfectly predict every tiny detail, you embrace the inherent randomness from the quantum measurement process.

Lev: For me, what this means for running real hardware is that if you use these quantum algorithms to model something like atmospheric circulation or complex fluid dynamics, you need to be prepared for that inherent stochasticity in your results.

Kai: It's a different way to look at modeling deterministic chaos; instead of trying to perfectly predict every tiny detail, you embrace the inherent randomness from the quantum measurement process.

Mira: The authors are pointing toward using quantum measurement and tomographic methods when you're simulating those highly complex and unstable regions where things get really chaotic.

Lev: That’s a fine point about where they are stopping; they explored one trajectory and the influence of stochasticity on it, but they didn't develop codes for distributional time evolution yet.

Diego Campos, Narasimha Reddy Gosala, Árundhati Dasgupta

University of Lethbridge

quant-ph

Submitted: 2026-06-08

Updated: 2026-11-06

Comments: 6 pages, 5 figures, edited for clarity, and stochastic metrics added

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 61/100

The gist: Quantum algorithms can be used to model classical stochastic simulations as the measurement process is inherently random <ref:2606.09384#pg2>.

Key concepts

Classical Stochasticity
This refers to the inherent randomness found in classical systems, like the Lorenz system, which are deterministic but exhibit chaotic behavior. The paper compares this known classical randomness with the results obtained from quantum measurements to show how quantum computation models this stochastic nature.
Quantum Measurement Process
In quantum mechanics, measuring a qubit is a probabilistic event where the outcome is not perfectly predictable. The probability of measuring a specific state depends on parameters like theta. This inherent non-determinism in measurement is what allows quantum algorithms to introduce randomness into simulations.
Quantum Randomness Quantification
The variance in the output of a quantum measurement can be used to measure entanglement between qubits. This variance acts as a metric quantifying the degree of randomness or correlation present within the quantum system, providing a way to quantify inherent uncertainty.

Terminology

Summary

Quantum algorithms can be used to model classical stochastic simulations as the measurement process is inherently random <ref:2606. p. 0

Where the paper says it

Classical Stochasticity Using Quantum Computers Diego Campos *, Narasimha Reddy Gosala † , Arundhati Dasgupta ‡ , Physics and Astronomy, University of Lethbridge, 4401 University Drive, Lethbridge T1K 3M4. Abstract We suggest that quantum algorithms can be used to model classical stochastic simulations as the measurement process is inherently random.

09384#pg2>. The paper suggests that the output of a quantum algorithm for a non-linear ODE should be interpreted as a stochastic result because the inherent non-determinism of measurement is intrinsic to quantum systems <ref:2606. p. 0
Where the paper says it

Whereas the actual hardware noise can be improved with the building of fault-tolerant quantum computers, the inherent non-determinism of the measurement process is intrinsic to the quantum system. Instead of trying to use post-processing methods, we suggest that the output of a quantum algorithm for a non-linear ODE be interpreted as a stochastic result.

09384#pg3>. They illustrate this by comparing the classical stochasticity of the Lorenz system with measurements obtained using quantum algorithms <ref:2606. p. 0
Where the paper says it

To illustrate, we solve the classical Lorenz system with stochastic behavior using a Python random number generator. We compare the classical stochasticity of the Lorenz system with the measured output of the system obtained using quantum algorithms.

09384#pg2>.

Modeling Non-linear Dynamics

The paper focuses on modeling complex non-linear systems using deterministic chaos, referencing Edward Lorenz's work in the 1960s to model weather patterns <ref:2606.09384#pg2>. Specifically, the Lorenz system is introduced as a dynamical system in three variables (x,y,z) with parameters (σ,ρ,β) representing fluid properties <ref:2606. p. 1

Where the paper says it

The Lorenz system, which we label as Lorenz-63, is a dynamical system in three variables (x,y,z), which can represent thermodynamic quantities such as temperature and pressure gradients. There are three parameters, (σ,ρ,β), which correspond to certain properties of the fluid/liquid.

09384#pg2>. The Euler-stochastic version of this system introduces stochasticity by generating random numbers for the variable ξi <ref:2606. p. 6
Where the paper says it

Here, we show the evolution of the stochastic version of the Lorenz system using an Euler-Stochastic time evolution (Eqs. We take h = 10−6 , e = 40, and ξi from a set of random numbers generated by Python’s random number generator (which could be the binomial distribution).

09384#pg2>.

Quantum Randomness in Measurement

In quantum mechanics, measurement is a probabilistic process where measuring one qubit is similar to tossing a coin <ref:2606.09384#pg4>. The probability of measuring 0⟩ is given by p0 = cos2θ, and the probability of measuring 1⟩ is p1 = sin2θ <ref:2606. p. 3

Where the paper says it

The block-encoding circuit US-FABLE is executed on the initial state |0⟩ ⊗a |ψk⟩. Taking the square root and substituting the normalization factors back, we can reconstruct the physical magnitudes |Xj | at the new step and using the joint probability pj,joint of measuring the system in state j: |Xj | = √pj,joint · 2 n · ∥Ascaled∥2 · ∥Xprev∥2 (12) To handle the loss of phase during measurement, signs are reconstructed using an Eulerian temporal continuity heuristic: sign(Xj) = sign(Xj,prev +∆t · f j(Xprev)) (13) The generated statevectors are measured using 500,000 shots, and the state vectors obtained using the estimates are plotted in the Figures (1).

09384#pg4>. The precision with which a quantum state is measured depends on the dimension of the Hilbert space, requiring O(d/ε2) shots for ε precision <ref:2606. p. 2
Where the paper says it

Thus, the precision with which p0 needs to be measured dictates the number of shots. For a multi-qubit circuit, where the Hilbert space is d-dimensional, the number of shots required to obtain ε precision has been shown as O(d/ε 2 log(d)) by Aaronson.

09384#pg4>. The authors suggest that the variance in measurement output can serve as a quantification of entanglement present in qubits <ref:2606. p. 8
Where the paper says it

The multinomial random numbers are slightly more spread about the mean than the quantum randomness of the measured output. We think that this difference in variance could serve as a quantification of the entanglement present in the qubits.

09384#pg2>.

Quantum Algorithms for Lorenz System

Two quantum algorithms are described for solving the Lorenz-63 system, namely FABLE and Unitary time evolution <ref:2606.09384#pg2>. The S-FABLE algorithm uses a matrix representation of the discrete equations, which is conjugated into the Walsh domain via M = H ⊗ nScaledH ⊗ n <ref:2606. p. 3

Where the paper says it

4, 5 & 6) without the stochastic term, i. e = 0 is: A =   1−hσ hσ 0 0 0 0 0 0 hρ 1−h 0 0 −h 0 0 0 0 0 1−hβ h 0 0 0 0   (8) To implement this operator, instead of encoding A directly, the matrix is first conjugated into the Walsh domain via: M = H ⊗nAscaledH ⊗n (9) where H ⊗n is the Walsh-Hadamard transform applied to the n = 3 system qubits, and Ascaled = SAS−1 is the similarity-transformed version of A, where S is a diagonal rescaling matrix which divides each variable by its expected maximum range S = diag 1 20 , 1 30 , 1 50, 1 1000 , 1 600 ,1,1,1 .

09384#pg2>. The Unitary evolution method involves exponentiating a unitary matrix U = exp(hQ) derived from an antisymmetric transfer matrix A' <ref:2606.09384#pg2>.

Stochastic Comparison and Conclusion

The measured output from both quantum algorithms is shown to be deviated from the numerically generated trajectory, indicating stochasticity <ref:2606.09384#pg2>. The quantum measured output points are randomly distributed about the trajectory as seen in Figure 3b <ref:2606. p. 5

Where the paper says it

As the region of the trajectory is carefully chosen, all the gridpoints have positive values. We find that, the quantum measured output points are randomly distributed about the trajectory as in Figure (3b).

09384#pg2>. A comparison with classical stochastic simulations shows that the quantum trajectory has same behavior as a classical Lorenz trajectory with an additional stochastic term <ref:2606. p. 7
Where the paper says it

This is similar to quantum fluctuations Figure (4a) 5 Conclusion In this letter, we have shown that the quantum measured output of the Lorenz system is stochastic in nature. The quantum trajectory has same behavior as that of a classical Lorenz trajectory with an additional stochastic term.

09384#pg2>. The conclusion is that if unprocessed output for any ODE uses quantum computers, the predicted trajectories will be stochastic <ref:2606. p. 7
Where the paper says it

Infact, we think, quantum algorithms provide a very useful source for modeling the stochastic Lorenz system as the randomness generated can be changed by changing the circuit. Generalizing our result, we see that if we keep unprocessed output for any ODE using quantum computers, the predicted 8

09384#pg2>.

Future Directions

The authors note that while the quantum codes are not developed to discuss distributional time evolution, they explored one trajectory and the influence of stochasticity on that <ref:2606.09384#pg2>. They suggest that in unstable regions, particularly for complex systems far from equilibrium, simulating using quantum measurement and tomographic methods would be interesting <ref:2606. p. 8

Where the paper says it

Note that in this letter, we have studied the stochastic Lorenz system in a relatively stable region of the trajectories as in Figure (5); it will be interesting to observe the quantum output near bifurcation points. Regions of unstable behavior, particularly for complex systems far from equilibrium, would be interesting to simulate using quantum measurement and tomographic methods.

09384#pg2>. The approximation assuming unentangled qubits is justified because the difference in variance between quantum randomness and the multinomial random system is 3% <ref:2606. p. 8
Where the paper says it

In the quantum code in Section (3) we have also compared/modeled the measurement output using a multinomial distribution, which assumes that the qubits are unentangled. This approximation is justified in hindsight as the difference in variance of the quantum randomness and the multinomial random system is 3% in the specific case.

09384#pg2>.

Acknowledgments

The authors acknowledge Robert Benkoczi, Daya Gaur, Shajad Hafshejani, Alfredo Iorio, and Rossitsa Yalamova for useful discussions <ref:2606.09384#pg2>. Funding is acknowledged from ORIS, University of Lethbridge <ref:2606. p. 8

Where the paper says it

Acknowledgment: We would like to thank Robert Benkoczi, Daya Gaur, Shajad Hafshejani, Alfredo Iorio, Rossitsa Yalamova for useful discussions. Funding from ORIS, University of Lethbridge is acknowledged, and DC would like to thank MITACS.

09384#pg2>. They are grateful to MITACS and Urbasi Sinha for the arXiv quant-ph endorsement <ref:2606. p. 8
Where the paper says it

Funding from ORIS, University of Lethbridge is acknowledged, and DC would like to thank MITACS. We are grateful to Urbasi Sinha for arxiv quant-ph endorsement.

09384#pg2>.

References

[1] Manabendra Nath Bera, Antonio Ac´ın, Marek Kus, Morgan W. Mitchell, and Maciej Lewen-stein. p. 8

Where the paper says it

References [1] Manabendra Nath Bera, Antonio Ac´ın, Marek Kus, Morgan W. Mitchell, and Maciej Lewen- ´ stein.

Randomness in quantum mechanics: philosophy, physics and technology. p. 8
Where the paper says it

Mitchell, and Maciej Lewen- ´ stein. Randomness in quantum mechanics: philosophy, physics and technology.

Rept. Prog. Phys., 80(12):124001, 2017 <ref:2606. p. 8
Where the paper says it

Randomness in quantum mechanics: philosophy, physics and technology. , 80(12):124001, 2017.

09384#pg10>.

[2] Gabriel Senno, Thomas Strohm, and Antonio Ac´ın. p. 8

Where the paper says it

, 80(12):124001, 2017. [2] Gabriel Senno, Thomas Strohm, and Antonio Ac´ın.

Quantifying the Intrinsic Randomness of Quantum Measurements. p. 8
Where the paper says it

[2] Gabriel Senno, Thomas Strohm, and Antonio Ac´ın. Quantifying the Intrinsic Randomness of Quantum Measurements.

Phys. Rev. Lett., 131(13):130202, 2023 <ref:2606. p. 8
Where the paper says it

Quantifying the Intrinsic Randomness of Quantum Measurements. , 131(13):130202, 2023.

09384#pg6>.

[3] Vaisakh Mannalath, Sandeep Mishra, and Anirban Pathak. p. 8

Where the paper says it

, 131(13):130202, 2023. [3] Vaisakh Mannalath, Sandeep Mishra, and Anirban Pathak.

A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness. p. 8
Where the paper says it

[3] Vaisakh Mannalath, Sandeep Mishra, and Anirban Pathak. A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness.

Quant. Inf. Proc., 22(12):439, 2023 <ref:2606. p. 8
Where the paper says it

A comprehensive review of quantum random number generators: concepts, classification and the origin of randomness. , 22(12):439, 2023.

09384#pg8>.

[4] Sajad Fathi Hafshejani, Daya Gaur, Arundhati Dasgupta, Robert Benkoczi, Narasimha Reddy Gosala, and Alfredo Iorio. p. 8

Where the paper says it

, 22(12):439, 2023. [4] Sajad Fathi Hafshejani, Daya Gaur, Arundhati Dasgupta, Robert Benkoczi, Narasimha Reddy Gosala, and Alfredo Iorio.

A Hybrid Quantum Solver for the Lorenz System. p. 8
Where the paper says it

[4] Sajad Fathi Hafshejani, Daya Gaur, Arundhati Dasgupta, Robert Benkoczi, Narasimha Reddy Gosala, and Alfredo Iorio. A Hybrid Quantum Solver for the Lorenz System.

Entropy, 26(12):1009, 2024 <ref:2606. p. 8
Where the paper says it

A Hybrid Quantum Solver for the Lorenz System. Entropy, 26(12):1009, 2024.

09384#pg5>.

[5] Quantum Computing at University of Lethbridge. p. 8

Where the paper says it

Entropy, 26(12):1009, 2024. [5] Quantum Computing at University of Lethbridge.

Algorithms for non-linear ODEs. p. 8
Where the paper says it

[5] Quantum Computing at University of Lethbridge. Algorithms for non-linear ODEs.

in preparation, 2026 <ref:2606. p. 0
Where the paper says it

ca 1 arXiv:2606. 09384v1 [quant-ph] 8 Jun 2026

09384#pg6>.

[6] Hu Wang, Yongguang Yu, and Guoguang Wen. p. 9

Where the paper says it

[6] Hu Wang, Yongguang Yu, and Guoguang Wen. Dynamical analysis of the lorenz-84 atmospheric circulation model.

Dynamical analysis of the lorenz-84 atmospheric circulation model. p. 9
Where the paper says it

[6] Hu Wang, Yongguang Yu, and Guoguang Wen. Dynamical analysis of the lorenz-84 atmospheric circulation model.

Journal of Applied Mathematics, 2014(1):296279, 2014 <ref:2606. p. 9
Where the paper says it

Dynamical analysis of the lorenz-84 atmospheric circulation model. Journal of Applied Mathematics, 2014(1):296279, 2014.

09384#pg6>.

[7] Raul Toral, Claudio R. p. 9

Where the paper says it

Journal of Applied Mathematics, 2014(1):296279, 2014. [7] Raul Toral, Claudio R.

Mirasso, Emilio Hern ´ andez-Garc ´ ıa, and Oreste Piro. p. 9
Where the paper says it

[7] Raul Toral, Claudio R. Mirasso, Emilio Hern ´ andez-Garc ´ ´ıa, and Oreste Piro.

Analytical and numerical studies of noise-induced synchronization of chaotic systems. p. 9
Where the paper says it

Mirasso, Emilio Hern ´ andez-Garc ´ ´ıa, and Oreste Piro. Analytical and numerical studies of noise-induced synchronization of chaotic systems.

Chaos, 11(3):665–673, September 2001 <ref:2606. p. 9
Where the paper says it

Analytical and numerical studies of noise-induced synchronization of chaotic systems. Chaos, 11(3):665–673, September 2001.

09384#pg6>.

[8] Yanni Bills and J. p. 9

Where the paper says it

Chaos, 11(3):665–673, September 2001. [8] Yanni Bills and J.

S. Wettlaufer. p. 9
Where the paper says it

[8] Yanni Bills and J. Wettlaufer.

Stochastic Lorenz dynamics and wind reversals in Rayleigh-Benard ´ Convection; arXiv:physics. p. 9
Where the paper says it

Wettlaufer. Stochastic Lorenz dynamics and wind reversals in Rayleigh-Benard ´ Convection; arXiv:physics.

flu-dyn/2602. p. 9
Where the paper says it

Stochastic Lorenz dynamics and wind reversals in Rayleigh-Benard ´ Convection; arXiv:physics. flu-dyn/2602.

16068, February 2026 <ref:2606. p. 0
Where the paper says it

ca 1 arXiv:2606. 09384v1 [quant-ph] 8 Jun 2026

09384#pg6>.

[9] Ryan O’Donnell and John Wright. p. 9

Where the paper says it

arXiv e-prints, February 2026. [9] Ryan O’Donnell and John Wright.

Efficient quantum tomography. p. 9
Where the paper says it

[9] Ryan O’Donnell and John Wright. Efficient quantum tomography.

In “48th annual ACM symposium on Theory of Computing; arXiv:quant-ph/1508. p. 9
Where the paper says it

Efficient quantum tomography. In “48th annual ACM symposium on Theory of Computing; arXiv:quant-ph/1508.

01907”, 2015 <ref:2606. p. 9
Where the paper says it

In “48th annual ACM symposium on Theory of Computing; arXiv:quant-ph/1508. 01907”, 2015.

09384#pg8>.

[10] Pingal Pratyush Nath, Aninda Sinha, and Urbasi Sinha. p. 9

Where the paper says it

01907”, 2015. [10] Pingal Pratyush Nath, Aninda Sinha, and Urbasi Sinha.

Certified Random Number Generation using Quantum Computers. p. 9
Where the paper says it

[10] Pingal Pratyush Nath, Aninda Sinha, and Urbasi Sinha. Certified Random Number Generation using Quantum Computers.

Quantum Sci. p. 9
Where the paper says it

Certified Random Number Generation using Quantum Computers. Quantum Sci.

Technol., 4:1661544, 2 2025 <ref:2606. p. 9
Where the paper says it

Quantum Sci. , 4:1661544, 2 2025.

09384#pg8>.

[11] NIST. NIST Dataplot reference manual: https://www. p. 9

Where the paper says it

, 4:1661544, 2 2025. NIST Dataplot reference manual: https://www.

itl.nist.gov/div898/software/dataplot/refman2/. p. 9
Where the paper says it

NIST Dataplot reference manual: https://www. gov/div898/software/dataplot/refman2/.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Quantum algorithms can be used to model classical stochastic simulations as the measurement process is inherently random, allowing quantum hardware to serve as an alternate computational hardware for systems that do not require precision results.

  2. The improved system can generate non-linear differential equation trajectories where the measured output shows a degree of randomness, which is interpreted as a stochastic formulation of the same Lorenz system.

  3. The AI can utilize quantum measurement variance to quantify entanglement, suggesting that this difference in variance could serve as a quantification of the entanglement present in the qubits.

Abstract

We demonstrate that quantum algorithms can be used to model classical stochastic simulations as the measurement process is inherently random. To illustrate, we solve the classical Lorenz system with stochastic behavior using a Python random number generator. We compare the classical stochastic Lorenz system with the measured output of the quantum algorithm.

Related papers