IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2609.09226.html

Adaptive Entangled Neurons in the Brain and Natural Intelligence Simulations for Artificial General Intelligence

Author

Listed:
  • Haochen Li
  • Xinshuai Guo
  • Jingdong Ouyang
  • Wei Zhang
  • Leilei Shi

Abstract

Understanding the brain's mechanisms is crucial in neuroscience, particularly for simulating natural intelligence and advancing artificial general intelligence (AGI). Liu et al. (2024) and Deco et al. (2025) propose that quantum entanglement may underlie the synchronization of millions of neurons, introducing the Liu-Chen-Ao (LCA) hypothesis of entangled nerve fibers. However, directly testing this idea remains challenging. Here we employ a nonlocal many-body wave equation, introducing a generalized probability-wave framework to model collective behaviors among adaptive, interacting agents, particles, or neurons. This approach enables testable eigenmodes, offering an indirect means of examining the LCA hypothesis by observing patterns in collective trading behaviors. These patterns, rooted in behavioral psychology, are thought to mirror the internal brain's decision-making and underlying mechanisms. Our analysis of Chinese intraday stock market data shows that adaptive entangled game modes explain 82%-94% of decision patterns, sharply contrasting neoclassical finance predictions assuming independent rational agents. Additionally, 2-12% of actions adapt to news, events, and environmental changes, marked by rapid equilibrium shifts, while truly independent behaviors make up less than 5%. These results empirically support the LCA hypothesis and underscore the need to simulate the brain's mechanisms and generate adaptive, entangled modules for AGI. They also expose the shortcomings of conventional artificial neural networks (ANNs) that depend on vast, opaque parameters. By combining ANN-based AI with probability-wave-based entangled brain simulations, machine learning enables the creation of human-like processing units (HPUs). Such HPUs promise more efficient and robust AGI, particularly for embodied intelligence and robotics.

Suggested Citation

  • Haochen Li & Xinshuai Guo & Jingdong Ouyang & Wei Zhang & Leilei Shi, 2026. "Adaptive Entangled Neurons in the Brain and Natural Intelligence Simulations for Artificial General Intelligence," Papers 2609.09226, arXiv.org, revised Oct 2026.
    • Handle: RePEc:arx:papers:2609.09226
    as

    Download full text from publisher

    File URL: https://arxiv.org/pdf/2609.09226
    File Function: Latest version
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Eddy Keming Chen & Mikhail Belkin & Leon Bergen & David Danks, 2026. "Does AI already have human-level intelligence? The evidence is clear," Nature, Nature, vol. 650(8100), pages 36-40, February.
    2. David Silver & Aja Huang & Chris J. Maddison & Arthur Guez & Laurent Sifre & George van den Driessche & Julian Schrittwieser & Ioannis Antonoglou & Veda Panneershelvam & Marc Lanctot & Sander Dieleman, 2016. "Mastering the game of Go with deep neural networks and tree search," Nature, Nature, vol. 529(7587), pages 484-489, January.
    3. Daya Guo & Dejian Yang & Haowei Zhang & Junxiao Song & Peiyi Wang & Qihao Zhu & Runxin Xu & Ruoyu Zhang & Shirong Ma & Xiao Bi & Xiaokang Zhang & Xingkai Yu & Yu Wu & Z. F. Wu & Zhibin Gou & Zhihong S, 2025. "DeepSeek-R1 incentivizes reasoning in LLMs through reinforcement learning," Nature, Nature, vol. 645(8081), pages 633-638, September.
    4. Shi, Leilei, 2006. "Does security transaction volume–price behavior resemble a probability wave?," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 366(C), pages 419-436.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Junyan Ye & Hoi Ying Wong & Kyunghyun Park, 2025. "Robust Exploratory Stopping under Ambiguity in Reinforcement Learning," Papers 2510.10260, arXiv.org, revised Apr 2026.
    2. Tian Zhu & Merry H. Ma, 2022. "Deriving the Optimal Strategy for the Two Dice Pig Game via Reinforcement Learning," Stats, MDPI, vol. 5(3), pages 1-14, August.
    3. Xiaoyue Li & John M. Mulvey, 2023. "Optimal Portfolio Execution in a Regime-switching Market with Non-linear Impact Costs: Combining Dynamic Program and Neural Network," Papers 2306.08809, arXiv.org.
    4. Pedro Afonso Fernandes, 2024. "Forecasting with Neuro-Dynamic Programming," Papers 2404.03737, arXiv.org.
    5. Zhang, Chao & Huang, Lu, 2010. "A quantum model for the stock market," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(24), pages 5769-5775.
    6. Nathan Companez & Aldeida Aleti, 2016. "Can Monte-Carlo Tree Search learn to sacrifice?," Journal of Heuristics, Springer, vol. 22(6), pages 783-813, December.
    7. Shaheer U. Saeed & Yipei Wang & Veeru Kasivisvanathan & Brian R. Davidson & Matthew J. Clarkson & Yipeng Hu & Daniel C. Alexander, 2026. "Reasoning in machine vision by learning fast and slow thinking," Nature Communications, Nature, vol. 17(1), pages 1-11, December.
    8. Yuchen Zhang & Wei Yang, 2022. "Breakthrough invention and problem complexity: Evidence from a quasi‐experiment," Strategic Management Journal, Wiley Blackwell, vol. 43(12), pages 2510-2544, December.
    9. Benjamin Heinbach & Peter Burggräf & Johannes Wagner, 2024. "gym-flp: A Python Package for Training Reinforcement Learning Algorithms on Facility Layout Problems," SN Operations Research Forum, Springer, vol. 5(1), pages 1-26, March.
    10. Yassine Chemingui & Adel Gastli & Omar Ellabban, 2020. "Reinforcement Learning-Based School Energy Management System," Energies, MDPI, vol. 13(23), pages 1-21, December.
    11. Zhou, Tao & Zhou, Han & Li, Ming-Gen & Yan, Shiwei, 2025. "A neural network method for the escape rate in metastable systems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 674(C).
    12. Hamsa Bastani & Osbert Bastani & Wichinpong Park Sinchaisri, 2026. "Improving Human Sequential Decision Making with Reinforcement Learning," Management Science, INFORMS, vol. 72(1), pages 733-755, January.
    13. Zhewei Zhang & Youngjin Yoo & Kalle Lyytinen & Aron Lindberg, 2021. "The Unknowability of Autonomous Tools and the Liminal Experience of Their Use," Information Systems Research, INFORMS, vol. 32(4), pages 1192-1213, December.
    14. Yuhong Wang & Lei Chen & Hong Zhou & Xu Zhou & Zongsheng Zheng & Qi Zeng & Li Jiang & Liang Lu, 2021. "Flexible Transmission Network Expansion Planning Based on DQN Algorithm," Energies, MDPI, vol. 14(7), pages 1-21, April.
    15. JinHyo Joseph Yun & EuiSeob Jeong & Xiaofei Zhao & Sung Deuk Hahm & KyungHun Kim, 2019. "Collective Intelligence: An Emerging World in Open Innovation," Sustainability, MDPI, vol. 11(16), pages 1-15, August.
    16. Pranay Anchuri, 2026. "RAmmStein: Regime Adaptation in Mean-reverting Markets with Stein Thresholds -- Optimal Impulse Control in Concentrated AMMs," Papers 2602.19419, arXiv.org, revised Mar 2026.
    17. Jiacheng Zhang & Haolan Zhang, 2025. "Towards Human-like Artificial Intelligence: A Review of Anthropomorphic Computing in AI and Future Trends," Mathematics, MDPI, vol. 13(13), pages 1-49, June.
    18. Thomas P. Novak & Donna L. Hoffman, 2019. "Relationship journeys in the internet of things: a new framework for understanding interactions between consumers and smart objects," Journal of the Academy of Marketing Science, Springer, vol. 47(2), pages 216-237, March.
    19. Mien Brabeeba Wang & Nancy Lynch & Michael M. Halassa, 2025. "The neural basis for uncertainty processing in hierarchical decision making," Nature Communications, Nature, vol. 16(1), pages 1-25, December.
    20. Yuanyuan Li & Claudia Archetti & Ivana Ljubić, 2024. "Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates," Transportation Science, INFORMS, vol. 58(5), pages 1143-1165, September.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2609.09226. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: https://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.