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

Entropic Entrainment: A Speculative Framework for Entropy, Quantum Computation, and Complexity

Victoria Mellor, Mo Adda

Published Jul 31, 2025• 0 citations
Publisher

Abstract

I propose a speculative but mathematically grounded framework called entropic entrainment, which reconceptualizes entropy not as a passive scalar measure of disorder, but as an active constraint shaping quantum and classical computation. Building on tools from quantum information geometry and open quantum systems theory, I model entropy flow through computational trajectories and suggest that complexity may emerge from a form of "entropic inertia." I define an entropic action principle and introduce a computable proxy for entropic complexity. While this theory is exploratory, it opens novel questions about decoherence, the structure of computational hardness, and entropy's role in the emergence of time in computation.

DOI
10.36227/techrxiv.175393301.12953153/v1

Related papers

Entropic dynamics: From entropy and information geometry to Hamiltonians and quantum mechanics

Ariel Caticha, Daniel Bartolomeo, Marcel Reginatto

Entropic Dynamics is a framework in which quantum theory is derived as an application of entropic methods of inference. There is no underlying action principle. Instead, the dynamics is driven by entropy subject to the appropriate constraints. In this paper we show how a Hamiltonian dynamics arises as a type of non-dissipative entropic dynamics. We also show that the particular form of the "quantum potential" that leads to the Schroedinger equation follows naturally from information geometry.

arXiv:1412.5629•AIP conference proceedings•Jan 1, 2015•24 citations

Fully Quantum Computational Entropies

Avidan, Noam, Thomas A. Hahn, Joseph M. Renes +1 more

Quantum information theory has provided the formal framework for describing how information is stored, transmitted, and transformed in physical quantum systems [6, 7, 9]. Its entropic formulations underpin our understanding of quantum computation, communication, and cryptography. Yet this theory traditionally treats all quantum operations as freely available, ignoring computational restrictions. In practice, however, any manipulation of quantum information must be performed by devices of bounded complexity and runtime. Capturing such realistic constraints requires extending quantum information theory to include computational efficiency as a fundamental component.This work takes a first step toward building a computational version of quantum information theory, one that treats efficiency as part of the theory itself. The goal is to understand how the behavior of quantum information changes when the parties involved can only perform computationally efficient operations. This approach bridges the abstract, ideal setting of quantum information theory with the practical limitations of real quantum devices, offering a means to study information processing under realistic resource constraints.At the center of this work are two new quantities: the quantum computational min-entropy and the quantum computational max-entropy. These entropies extend standard quantum entropies by explicitly limiting the computational power of the observer or adversary. The quantum computational min-entropy captures how unpredictable a quantum system A remains to an observer holding system B, when that observer is restricted to quantum circuits of bounded size. Formally, for a bipartite state rho AB, we define(c) H-s (min)(A|B)rho := - log d(A) max (epsilon s) B > A' F ((parallel to(A)circle times epsilon(s))(rho(AB)),|Phi (AA')> Quantum information theory; Theory of computation -> Quantum complexity theory

arXiv:2506.14068•Leibniz international proceedings in informatics•Jun 16, 2025•5 citations

Entropic Dynamics

Ariel Caticha

Entropic Dynamics is a framework in which dynamical laws are derived as an application of entropic methods of inference. No underlying action principle is postulated. Instead, the dynamics is driven by entropy subject to the constraints appropriate to the problem at hand. In this paper we review three examples of entropic dynamics. First we tackle the simpler case of a standard diffusion process which allows us to address the central issue of the nature of time. Then we show that imposing the additional constraint that the dynamics be non-dissipative leads to Hamiltonian dynamics. Finally, considerations from information geometry naturally lead to the type of Hamiltonian that describes quantum theory.

arXiv:1509.03222•Entropy•Sep 1, 2015•70 citations

Entropic quantization of scalar fields

Selman Ipek, Ariel Caticha

Entropic Dynamics is an information-based framework that seeks to derive the laws of physics as an application of the methods of entropic inference. The dynamics is derived by maximizing an entropy subject to constraints that represent the physically relevant information that the motion is continuous and non-dissipative. Here we focus on the quantum theory of scalar fields. We provide an entropic derivation of Hamiltonian dynamics and using concepts from information geometry derive the standard quantum field theory in the Schrödinger representation.

arXiv:1412.5637•AIP conference proceedings•Jan 1, 2015•23 citations

Entropic Dynamics: Quantum Mechanics from Entropy and Information Geometry

Ariel Caticha

Abstract Entropic Dynamics (ED) is a framework in which Quantum Mechanics (QM) is derived as an application of entropic methods of inference. The magnitude of the wave function is manifestly epistemic: its square is a probability distribution. The epistemic nature of the phase of the wave function is also clear: it controls the flow of probability. The dynamics is driven by entropy subject to constraints that capture the relevant physical information. The central concern is to identify those constraints and how they are updated. After reviewing previous work I describe how considerations from information geometry allow us to derive a phase space geometry that combines Riemannian, symplectic, and complex structures. The ED that preserves these structures is QM. The full equivalence between ED and QM is achieved by taking account of how gauge symmetry and charge quantization are intimately related to quantum phases and the single‐valuedness of wave functions.

arXiv:1711.02538•Annalen der Physik•Mar 12, 2018•35 citations

Information Entropy and Quantum Entanglement: A Computational Framework

Jincheng Zhang

The study of information entropy and its connection to quantum entanglement presents a unique challenge and opportunity for computational advancements. This paper explores the potential of leveraging quantum entanglement to enhance the computation of information entropy, specifically focusing on a novel model that utilizes the instantaneous correlations inherent in entangled states. We propose a new computational framework based on this entanglement principle, aiming to improve both the efficiency and accuracy of entropy calculations. The core mechanism centers on encoding information through entangled quantum states, enabling the calculation of statistical properties with enhanced precision. This work investigates the potential of this approach to revolutionize computational approaches to information entropy.

•Aug 31, 2026•0 citations
I propose a speculative but mathematically grounded framework called entropic entrainment, which reconceptualizes entropy not as a passive scalar measure of disorder, but as an active constraint shaping quantum and classical computation. Building on tools from quantum information geometry and open quantum systems theory, I model entropy flow through computational trajectories and suggest that complexity may emerge from a form of "entropic inertia." I define an entropic action principle and introduce a computable proxy for entropic complexity. While this theory is exploratory, it opens novel questions about decoherence, the structure of computational hardness, and entropy's role in the emergence of time in computation.
Entropic Dynamics is a framework in which quantum theory is derived as an application of entropic methods of inference. There is no underlying action principle. Instead, the dynamics is driven by entropy subject to the appropriate constraints. In this paper we show how a Hamiltonian dynamics arises as a type of non-dissipative entropic dynamics. We also show that the particular form of the "quantum potential" that leads to the Schroedinger equation follows naturally from information geometry.
Quantum information theory has provided the formal framework for describing how information is stored, transmitted, and transformed in physical quantum systems [6, 7, 9]. Its entropic formulations underpin our understanding of quantum computation, communication, and cryptography. Yet this theory traditionally treats all quantum operations as freely available, ignoring computational restrictions. In practice, however, any manipulation of quantum information must be performed by devices of bounded complexity and runtime. Capturing such realistic constraints requires extending quantum information theory to include computational efficiency as a fundamental component.This work takes a first step toward building a computational version of quantum information theory, one that treats efficiency as part of the theory itself. The goal is to understand how the behavior of quantum information changes when the parties involved can only perform computationally efficient operations. This approach bridges the abstract, ideal setting of quantum information theory with the practical limitations of real quantum devices, offering a means to study information processing under realistic resource constraints.At the center of this work are two new quantities: the quantum computational min-entropy and the quantum computational max-entropy. These entropies extend standard quantum entropies by explicitly limiting the computational power of the observer or adversary. The quantum computational min-entropy captures how unpredictable a quantum system A remains to an observer holding system B, when that observer is restricted to quantum circuits of bounded size. Formally, for a bipartite state rho AB, we define(c) H-s (min)(A|B)rho := - log d(A) max (epsilon s) B > A' F ((parallel to(A)circle times epsilon(s))(rho(AB)),|Phi (AA')> Quantum information theory; Theory of computation -> Quantum complexity theory
Entropic Dynamics is a framework in which dynamical laws are derived as an application of entropic methods of inference. No underlying action principle is postulated. Instead, the dynamics is driven by entropy subject to the constraints appropriate to the problem at hand. In this paper we review three examples of entropic dynamics. First we tackle the simpler case of a standard diffusion process which allows us to address the central issue of the nature of time. Then we show that imposing the additional constraint that the dynamics be non-dissipative leads to Hamiltonian dynamics. Finally, considerations from information geometry naturally lead to the type of Hamiltonian that describes quantum theory.
Entropic Dynamics is an information-based framework that seeks to derive the laws of physics as an application of the methods of entropic inference. The dynamics is derived by maximizing an entropy subject to constraints that represent the physically relevant information that the motion is continuous and non-dissipative. Here we focus on the quantum theory of scalar fields. We provide an entropic derivation of Hamiltonian dynamics and using concepts from information geometry derive the standard quantum field theory in the Schrödinger representation.
Abstract Entropic Dynamics (ED) is a framework in which Quantum Mechanics (QM) is derived as an application of entropic methods of inference. The magnitude of the wave function is manifestly epistemic: its square is a probability distribution. The epistemic nature of the phase of the wave function is also clear: it controls the flow of probability. The dynamics is driven by entropy subject to constraints that capture the relevant physical information. The central concern is to identify those constraints and how they are updated. After reviewing previous work I describe how considerations from information geometry allow us to derive a phase space geometry that combines Riemannian, symplectic, and complex structures. The ED that preserves these structures is QM. The full equivalence between ED and QM is achieved by taking account of how gauge symmetry and charge quantization are intimately related to quantum phases and the single‐valuedness of wave functions.
The study of information entropy and its connection to quantum entanglement presents a unique challenge and opportunity for computational advancements. This paper explores the potential of leveraging quantum entanglement to enhance the computation of information entropy, specifically focusing on a novel model that utilizes the instantaneous correlations inherent in entangled states. We propose a new computational framework based on this entanglement principle, aiming to improve both the efficiency and accuracy of entropy calculations. The core mechanism centers on encoding information through entangled quantum states, enabling the calculation of statistical properties with enhanced precision. This work investigates the potential of this approach to revolutionize computational approaches to information entropy.