Simulation of smooth models of potentials with singular point using Many-Interacting-Worlds Method

This paper extends the Many-Interacting-Worlds method to two-dimensional bounded systems with singular potentials, such as the Coulomb potential, by employing asymptotic smoothing techniques to numerically simulate stationary states that align with standard quantum mechanical results.

The Gist

The Big Idea: Quantum Mechanics as a Crowd of Ghosts

Imagine you are trying to understand how a single particle (like an electron) behaves in the quantum world. Usually, scientists describe this using a "wave function," which is a bit abstract and hard to visualize.

In 2014, a new idea called the Many-Interacting-Worlds (MIW) method was proposed. Instead of one mysterious wave, imagine there are thousands of identical "worlds" (or copies of the particle) existing side-by-side.

• The Analogy: Think of a massive crowd of people walking through a foggy park. Each person represents a "world." They can't see each other clearly, but they can feel a gentle push or pull from the people standing right next to them.
• The Magic: In this theory, the strange "quantum effects" we see (like particles acting like waves) aren't magic; they are just the result of these thousands of "worlds" pushing and pulling on each other.

The Problem: The "Cliff" in the Landscape

The researchers had already proven this "crowd" method worked well for smooth, gentle hills (like a Harmonic Oscillator, which is like a ball rolling back and forth in a smooth bowl).

However, they wanted to test it on rougher, more dangerous landscapes:

1. The Coulomb Potential: This is like a deep, infinitely sharp pit (like a cliff edge) that particles fall into. In the real world, this is how electrons are attracted to an atomic nucleus.
2. The Finite Trap: This is like a box with very sharp, hard walls.

The Issue: When the researchers tried to run their "crowd simulation" on these sharp cliffs, the simulation crashed.

• Why? In the simulation, the "worlds" (the people in the crowd) would get too close to the sharp cliff edge. Because the math gets broken at the very tip of the cliff, the "people" would accelerate uncontrollably, crash into each other, and the whole simulation would turn into chaos.

The Solution: Smoothing the Rough Edges

To fix this, the authors didn't try to force the simulation to handle the sharp cliff directly. Instead, they built smooth ramps to replace the sharp edges.

• The Analogy: Imagine you have a steep, jagged cliff that a skateboarder can't handle. Instead of trying to teach the skateboarder to jump the cliff, you build a smooth, curved ramp that looks like the cliff from a distance but is gentle enough to ride on.
• The "Asymptotic" Trick: They created mathematical models where the ramp gets steeper and steeper (approaching the real cliff) as they adjust a dial. They call this "asymptotic" because as the dial turns to infinity, the smooth ramp becomes the sharp cliff.

They used two main tools to smooth the edges:

1. Error Functions: A mathematical curve that softens the sharp drop-off.
2. Hyperbolic Tangent: Another smooth curve that acts like a gentle transition instead of a hard wall.

The Experiment: Running the Crowd

The researchers ran their simulation using these smoothed-out models. They let the "crowd" of worlds evolve over time, letting them push and pull until they settled into a stable pattern (a "stationary state").

They also used a special technique called Kernel Estimation.

• The Analogy: Imagine trying to guess how crowded a park is just by looking at where people are standing. If you only look at the person next to you, your guess is jagged and inaccurate. But if you use a "kernel" (a fuzzy lens that looks at a small group of neighbors), you get a smooth, accurate picture of the crowd density. This helped the simulation calculate the "push and pull" forces more accurately without the numbers crashing.

The Results: It Works!

The paper reports three main successes:

1. Ground States: The simulation successfully found the stable, lowest-energy positions for particles in these rough potentials (like an electron sitting at the bottom of the atom's pit).
2. Excited States: They even managed to simulate higher-energy states (where the particle is vibrating or moving more) in a 2-dimensional system (a flat surface instead of a line). This is a big deal because it's harder to get right.
3. Verification: They compared their "crowd simulation" results against the Matrix Numerov method, which is the standard, trusted way of solving these problems in traditional quantum mechanics.
   • The Verdict: The results matched almost perfectly. The "crowd" method produced the same answers as the traditional math.

The Limitations

The authors are honest about the boundaries of their work:

• Computer Power: The simulation works great on a personal computer, but if they try to make the "ramp" too smooth (too close to the real cliff) or use too many "worlds" (too many people in the crowd), the computer gets overwhelmed, and errors pile up.
• No "Phase" Information: The MIW method is deterministic (it follows set rules), but it currently lacks the "phase" information found in traditional wave functions. This means it can't easily explain certain quantum phenomena that rely on wave interference (like how waves cancel each other out).
• Presetting the Rules: For the 2D excited states, they had to manually tell the simulation where the "nodes" (points where the probability is zero) should be. They couldn't just let the simulation figure it out on its own yet.

Summary

In short, this paper says: "We took a new way of looking at quantum mechanics (the Many-Interacting-Worlds method) that usually only works on smooth hills. We built mathematical ramps to smooth out the sharp cliffs and hard walls. We ran the simulation, and it worked just as well as the old, standard methods, proving this new approach can handle much more complex and dangerous quantum landscapes."

Technical Summary

Technical Summary: Simulation of Smooth Models of Potentials with Singular Points using Many-Interacting-Worlds Method

Problem Statement
The Many-Interacting-Worlds (MIW) method, proposed by Hall, Deckert, and Wiseman, interprets quantum mechanics through a finite number of classical "worlds" interacting via an interworld potential derived from the probability density. While the MIW dynamical algorithm has successfully reproduced stationary states for smooth potentials like the harmonic oscillator, it faces significant challenges when applied to potentials with singularities (e.g., Coulomb potential) or insufficient smoothness (e.g., finite depth traps). In these cases, the standard dynamical evolution often fails to reach stationary states; trajectories near singular points accelerate uncontrollably, leading to numerical crashes or chaotic behavior due to the lack of local minima and the "no-crossing" constraint of world trajectories.

Methodology
To address these limitations, the authors propose a framework combining asymptotic smooth models with the MIW dynamical algorithm and kernel density estimation.

1. Asymptotic Smooth Models: Instead of simulating the singular potential directly, the authors replace singular or non-smooth potentials with smooth, asymptotic approximations that converge to the target potential as specific parameters tend to infinity.

   • Coulomb Potential: The singularity at the origin ($1/r$) is smoothed using error function ($\text{erf}$) or hyperbolic tangent ($\tanh$) based models. For instance, $-1/r$ is replaced by $-c \exp(-\alpha^2 r^2) - \text{erf}(\mu r)/r$, which ensures differentiability and the existence of a local minimum at the origin.
   • Finite Depth Trap: The discontinuous step potential is smoothed using error functions to create a continuous, differentiable transition at the boundaries.
   • These models are designed to be "asymptotic," meaning the simulation results approach the standard quantum mechanical solution as the smoothing parameters ($\mu, \nu$) increase.

2. Kernel Density Estimation: To calculate the interworld potential and quantum force, the probability density $P(q)$ must be approximated from the discrete world configurations. The authors utilize sample-point adaptive kernel estimators (specifically Gaussian kernels) rather than discrete nearest-neighbor approximations. This provides a smoother density derivative, which is crucial for stability in multidimensional simulations and prevents the "crashing" of worlds due to numerical instabilities.

3. Dynamical Algorithm Enhancements:

   • Adaptive Bandwidth: The authors implement a recursion relation for the kernel bandwidth $h(x_n)$ to ensure the estimator converges to the prior density. A novel recursion is proposed specifically for grid points located at nodes (where the priori density vanishes in excited states), addressing the issue of negative bandwidths in even kernel functions.
   • Boundary Conditions: To handle finite computational regions, "boundary worlds" with fixed configurations and infinite bandwidth are introduced to represent the contribution of worlds outside the simulation domain.
   • Symmetry Exploitation: Computational efficiency is improved by restricting simulations to symmetric sectors (e.g., a quarter of a square or a single radius in a circle) and presetting node conditions for excited states.

Key Contributions

• Extension to Singular Potentials: The paper successfully extends the MIW dynamical algorithm to systems with singularities (Coulomb) and non-smooth potentials (finite traps) by introducing asymptotic smooth models.
• 2D Excited State Simulation: This work represents the first application of the MIW dynamical algorithm to excited states in two-dimensional systems. This required developing specific strategies for handling nodes and adapting the bandwidth recursion.
• Validation against Standard Methods: The authors validate their approach by comparing MIW results with the standard matrix Numerov method. The simulations demonstrate that the MIW approach converges to the stationary states predicted by standard quantum mechanics as the smoothing parameters increase and the number of worlds grows.

Results

• Convergence: Simulations of 2D Coulomb potentials (using $\text{erf}$ and $\tanh$ models) and 1D finite depth traps show that the MIW energy and probability density converge to the results obtained via the matrix Numerov method.
• Stability: The use of kernel density estimation and adaptive bandwidth recursion successfully suppresses the vibrations and instabilities that typically plague the MIW algorithm near boundaries and nodes.
• Limitations: The authors note that precision is limited by computer performance and accumulated numerical errors over long integration times. Specifically, for the 2D Coulomb potential, the simulation becomes chaotic if the smoothing parameter $\mu$ exceeds 5 or if the grid density is too high (e.g., $>36$ grids in a $3\times3$ region) on a personal computer.
• Excited States: By presetting node conditions (fixing worlds at $x=0$ with infinite bandwidth), the algorithm successfully reproduces excited state configurations with correct nodal structures.

Significance and Claims
The paper claims that the MIW dynamical algorithm, when combined with asymptotic smooth models and kernel density estimation, provides a viable deterministic method for solving stationary states in complex systems that were previously difficult to handle (singular or non-smooth potentials).

The authors position the MIW method as a complementary approach to standard quantum mechanics:

• It preserves determinism and relies on density functions rather than wave functions.
• It offers a pathway to simulate multi-dimensional and multi-particle systems (e.g., coupled oscillators viewed as higher-dimensional systems) without the exponential scaling complexity of exact wavefunction solutions.
• However, the authors modestly acknowledge current limitations: the method struggles with highly excited states with complex node distributions without symmetry assumptions, and it currently lacks a mechanism to fully describe phase-related phenomena due to the absence of a wave function phase. They suggest that future work should aim to theoretically prove the convergence limits ($\lim_{N, \nu \to \infty} E_{N,\nu} = E_n$) and potentially integrate the method back into the Bohmian mechanics ontology to address phase issues.