Related papers: Thermodynamic-Complexity Duality: Embedding Comput…
The configurational density of states (CDOS) encodes all the relevant thermodynamic information contained in the interaction potentials for statistical mechanical systems. However, its explicit computation is usually a challenge for…
Interest in the thermodynamics of computation has revived in recent years, driven by developments in science, economics and technology. Given the consequences of the growing demand for computational power, the idea of reducing the energy…
Quantum computers have the potential to explore the vast Hilbert space of entangled states that play an important role in the behavior of strongly interacting matter. This opportunity motivates reconsidering the Hamiltonian formulation of…
This thesis investigates the connection between quantum theory, thermodynamics and information theory. Theories with structure similar to that of quantum theory are considered, mathematically described by the framework of "Generalized…
Computations implemented on a physical system are fundamentally limited by the laws of physics. A prominent example for a physical law that bounds computations is the Landauer principle. According to this principle, erasing a bit of…
The hardware and software foundations laid in the first half of the 20th Century enabled the computing technologies that have transformed the world, but these foundations are now under siege. The current computing paradigm, which is the…
We develop a thermodynamic theory of algorithmic catalysis within the watts-per-intelligence framework, identifying reusable computational structures that reduce irreversible operations for a task class while satisfying bounded restoration…
Generalized Probabilistic Theories (GPTs) provide a unified framework for describing probabilistic physical theories, encompassing classical and quantum theories as well as hypothetical theories beyond quantum mechanics. Since most GPTs are…
Landauer's Principle that information loss from a computation implies entropy increase can be rigorously proved from mathematical physics. However, carefully examining its detailed formulation reveals that the traditional identification of…
The quantum chromodynamics (QCD) phase diagram, which reveals the state of strongly interacting matter at different temperatures and densities, is key to answering open questions in physics, ranging from the behavior of particles in neutron…
Computational feasibility is a widespread concern that guides the framing and modeling of biological and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about the…
Assessing quantitatively the state and dynamics of a social system is a very difficult problem. It is of great importance for both practical and theoretical reasons such as establishing the efficiency of social action programs, detecting…
The Landauer's principle, a cornerstone of information thermodynamics, provides a fundamental lower bound on the energetic cost of information erasure in terms of the information content change. However, its traditional formulation is…
The quantum computation of electronic energies can break the curse of dimensionality that plagues many-particle quantum mechanics. It is for this reason that a universal quantum computer has the potential to fundamentally change…
For quantum many-body systems in one dimension, computational complexity theory reveals that the evaluation of ground-state energy remains elusive on quantum computers, contrasting the existence of a classical algorithm for temperatures…
This paper presents a series of general properties of the r-Complexity calculus, a complexity measurement for assessing the performance and asymptotic behaviour of real-world algorithms. This research describes characteristics such as…
In the paradigm of thermodynamic computing, instead of behaving deterministically, hardware undergoes a stochastic process in order to sample from a distribution of interest. While it has been hypothesized that thermodynamic computers may…
Analogue Hamiltonian simulation is a promising near-term application of quantum computing and has recently been put on a theoretical footing. In Hamiltonian simulation, a physical Hamiltonian is engineered to have identical physics to…
We review several statistical complexity measures proposed over the last decade and a half as general indicators of structure or correlation. Recently, Lopez-Ruiz, Mancini, and Calbet [Phys. Lett. A 209 (1995) 321] introduced another…
A unified model is addressed for general optimization problems in multi-scale complex systems. Based on necessary conditions and basic principles in physics, the canonical duality-triality theory is presented in a precise way to include…