Tootfinder

Bridging integrated information theory and the free-energy principle in living neuronal networks
Teruki Mayama, Sota Shimizu, Yuki Takano, Dai Akita, Hirokazu Takahashi
https://arxiv.org/abs/2510.04084

Bridging integrated information theory and the free-energy principle in living neuronal networks
The relationship between Integrated Information Theory (IIT) and the Free-Energy Principle (FEP) remains unresolved, particularly with respect to how integrated information, proposed as the intrinsic substrate of consciousness, behaves within variational Bayesian inference. We investigated this issue using dissociated neuronal cultures, previously shown to perform perceptual inference consistent with the FEP. Repeated stimulation from hidden sources induced robust source selectivity: variationa…

Quantum Reverse Shannon Theorem Simplified
Gilad Gour
https://arxiv.org/abs/2510.04552 https://arxiv.org/pdf/2510.04552

Quantum Reverse Shannon Theorem Simplified
We revisit the quantum reverse Shannon theorem, a central result in quantum information theory that characterizes the resources needed to simulate quantum channels when entanglement is freely available. We derive a universal additive upper bound on the smoothed max-information in terms of the sandwiched Rényi mutual information. This bound yields tighter single-shot results, eliminates the need for the post-selection technique, and leads to a conceptually simpler proof of the quantum reverse S…

Modeling information acquisition via f-divergence and duality
Alex Bloedel, Tommaso Denti, Luciano Pomatto
https://arxiv.org/abs/2510.03482 https://arxiv.o…

Modeling information acquisition via f-divergence and duality
We introduce a new cost function over experiments, f-information, based on the theory of multivariate statistical divergences, that generalizes Sims's classic model of rational inattention as well as the class of posterior-separable cost functions. We characterize its behavioral predictions by deriving optimality conditions that extend those of Matejka and McKay (2015) and Caplin, Dean, and Leahy (2019) beyond mutual information. Using these tools, we study the implications of f-information in …

But the debt industry itself hasn't gotten any more efficient: "the cost of moving a dollar from a saver to a borrower was about two cents in 1910; a hundred years later, it was the same." ... "This puzzle resolves itself once we recognize that the vast majority of financial innovation is geared towards figuring out how to siphon off resources through fees, insider information and lobbying."

[2025-10-07 Tue (UTC), 10 new articles found for cs.IT Information Theory]
toXiv_bot_toot

Replaced article(s) found for cond-mat.stat-mech. https://arxiv.org/list/cond-mat.stat-mech/new
[1/1]:
- Entropy augmentation through subadditive excess: information theory in irreversible processes
J\"urgen T. Stockburger

Intrinsic cause-effect power: the tradeoff between differentiation and specification
William G. P. Mayner, William Marshall, Giulio Tononi
https://arxiv.org/abs/2510.03881 https…

Intrinsic cause-effect power: the tradeoff between differentiation and specification
Integrated information theory (IIT) starts from the existence of consciousness and characterizes its essential properties: every experience is intrinsic, specific, unitary, definite, and structured. IIT then formulates existence and its essential properties operationally in terms of cause-effect power of a substrate of units. Here we address IIT's operational requirements for existence by considering that, to have cause-effect power, to have it intrinsically, and to have it specifically, substr…

Real conspiracies tend to come out, but some of them take a while. Information on the Iran/Contra scandal broke out about 5 years after the conspiracy started. That would have taken several hundred people to carry out, so it was somewhat hard to hide. Even so, they largely got away with it.
The moon landing conspiracy theory would have taken thousands of people, so it would have come out more quickly. Since we have an example of a real secret program of a similar scale as what would be required to fake a moon landing (that is, the Manhattan project), we know that the fake moon landing conspiracy theory is not true. (There's also the literally tons of evidence in the form of rocks and other samples, and all kinds of other ways to debunk the claim.)
Could Kash Patel's FBI have been trying really hard to entrap people into carrying out terrorist attacks in order to justify #Trump's occupation of DC? Could they have helped a guy plan an attack then just failed to arrest him? There are reasonable scenarios that fall in between malice and incompetence while still indicating some level of false flag.
Could someone have just snapped and ambushed some guardsmen without any involvement from the FBI? Yeah, totally. The US is a country full of guns with a completely non-functional mental health system. Someone coming from a country that the US destroyed, twice, could have a lot of untreated trauma. Might they see the national guard as a threat (even if that wasn't totally true)? Yeah, they were deployed to threaten people (even when they were just picking up trash). The point was to incite this kind of response. It's completely reasonable to believe that the FBI would not need to be involved at all, that this would just be the stochastic response they were looking for.
So the point here is that everything is on the table, nothing is really known, nothing should be surprising, and no matter what it's Trump's fault. This is exactly the escalation he was looking for. If he didn't get it naturally, he would also have had ways of making it happen.
He will use this in exactly the same way as the Reichstag fire, to drive a wedge between liberals and radicals. Don't fall for it.
Edit:
There are plausible reasons to not believe the official narrative at all right now, or maybe ever. The official narrative is also plausible, but there are plausible reasons to disagree with the response even if the official story is true. It is unnecessary to resort to conspiracy thinking in order to account for what happened and to disagree with the response. But it is also understandable why someone might jump immediately to a conspiracy given the circumstances.

istg people who have opinions on AGI should be required by law to at least grasp the basics of information theory

Series D, Episode 09 - Sand
SOOLIN: All right Avon, you've told us your theory. It wasn't a plague on Virn; it was the sand feeding off human energy. Does that mean we reckon Tarrant is dead?
AVON: Not necessarily. According to Orac's earlier information there's probably a woman down there. It's just possible that Tarrant was stronger and fitter than the three men in the Federation patrol, in which case he may have been kept alive, as Keller was kept alive, a…

An Algorithmic Information-Theoretic Perspective on the Symbol Grounding Problem
Zhangchi Liu
https://arxiv.org/abs/2510.05153 https://arxiv.org/pdf/2510.0…

An Algorithmic Information-Theoretic Perspective on the Symbol Grounding Problem
This paper provides a definitive, unifying framework for the Symbol Grounding Problem (SGP) by reformulating it within Algorithmic Information Theory (AIT). We demonstrate that the grounding of meaning is a process fundamentally constrained by information-theoretic limits, thereby unifying the Gödelian (self-reference) and No Free Lunch (statistical) perspectives. We model a symbolic system as a universal Turing machine and define grounding as an act of information compression. The argument pr…

RE: https://fediscience.org/@suomenantropologi/115614886106180185
Vale Keith Hart. That keynote from 2010 (link below) was (and still is) a compelling argument for reconnecting value theory to practical political economy by weaving together Marx's commodity fetishism, the concept of plural economy inspired by Mauss, and the digital revolution's radical cheapening of information.

Asymptotics of the Hankel determinant and orthogonal polynomials arising from the information theory of MIMO systems
Chao Min, Xiaoqing Wu
https://arxiv.org/abs/2510.06739 https…

Asymptotics of the Hankel determinant and orthogonal polynomials arising from the information theory of MIMO systems
We consider the Hankel determinant and orthogonal polynomials with respect to the deformed Laguerre weight $$ w(x; t) = {x^α}{\mathrm e^{ - x}}{(x + t)^λ},\qquad x\in \mathbb{R}^{+}, $$ with parameters $α> -1,\; t > 0$ and $λ\in \mathbb{R}$. This problem originates from the information theory of single-user multiple-input multiple-output (MIMO) systems studied by Chen and McKay [{\em IEEE Trans. Inf. Theory} {\bf 58} ({2012}) {4594--4634}]. By using the ladder operators for orthogonal polyn…

Proceedings Twentieth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
Kaustuv Chaudhuri (Inria, France), Daniele Nantes-Sobrinho (Imperial College, UK)
https://arxiv.org/abs/2510.11199

Proceedings Twentieth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
These are the contributed papers presented at the 20th International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice (LFMTP 2025), at Birmingham, UK on 19 July as a satellite event of the FSCD conference. The program committee for this edition of LFMTP was chaired by Kaustuv Chaudhuri and Daniele Nantes-Sobrinho. More information about LFMTP can be found on https://lfmtp.org.

Preserving Core Structures of Social Networks via Information Guided Multi-Step Graph Pruning
Yutong Hu, Bingxin Zhou, Jing Wang, Weishu Zhao, Liang Hong
https://arxiv.org/abs/2510.10499

Preserving Core Structures of Social Networks via Information Guided Multi-Step Graph Pruning
Social networks often contain dense and overlapping connections that obscure their essential interaction patterns, making analysis and interpretation challenging. Identifying the structural backbone of such networks is crucial for understanding community organization, information flow, and functional relationships. This study introduces a multi-step network pruning framework that leverages principles from information theory to balance structural complexity and task-relevant information. The fra…

Stephen Miller has a theory about this political moment.
As President Trump expands his lawbreaking and dictatorial rule,
the powerful MAGA disinformation apparatus
—at Miller’s direction
—is supercharging public attention to the debate over Trump’s conduct in a way that’s designed to deeply polarize it.
That will force Americans to take a side in that standoff, Miller clearly believes,
driving them to embrace authoritarian rule,
though perhaps witho…

Inside Stephen Miller’s Secret Plan to Normalize Trump’s Dictator Rule
He wants to supercharge searing civil tensions to get low-information voters to embrace their inner authoritarian. Exactly two Democrats appear to fully grasp this.

Exploring Complexity Measures for Analysis of Solar Wind Structures and Streams
Venla Koikkalainen, Emilia Kilpua, Simon Good, Adnane Osmane
https://arxiv.org/abs/2510.05873 htt…

Exploring Complexity Measures for Analysis of Solar Wind Structures and Streams
In this paper we use statistical complexity and information theory metrics to study structure within solar wind time series. We explore this using entropy-complexity and information planes, where the measure for entropy is formed using either permutation entropy or the degree distribution of a horizontal visibility graph (HVG). The entropy is then compared to the Jensen complexity (Jensen-Shannon complexity plane) and Fisher information measure (Fisher-Shannon information plane), formed both fr…

Can You Hear Me Now? A Benchmark for Long-Range Graph Propagation
Luca Miglior, Matteo Tolloso, Alessio Gravina, Davide Bacciu
https://arxiv.org/abs/2512.17762 https://arxiv.org/pdf/2512.17762 https://arxiv.org/html/2512.17762
arXiv:2512.17762v1 Announce Type: new
Abstract: Effectively capturing long-range interactions remains a fundamental yet unresolved challenge in graph neural network (GNN) research, critical for applications across diverse fields of science. To systematically address this, we introduce ECHO (Evaluating Communication over long HOps), a novel benchmark specifically designed to rigorously assess the capabilities of GNNs in handling very long-range graph propagation. ECHO includes three synthetic graph tasks, namely single-source shortest paths, node eccentricity, and graph diameter, each constructed over diverse and structurally challenging topologies intentionally designed to introduce significant information bottlenecks. ECHO also includes two real-world datasets, ECHO-Charge and ECHO-Energy, which define chemically grounded benchmarks for predicting atomic partial charges and molecular total energies, respectively, with reference computations obtained at the density functional theory (DFT) level. Both tasks inherently depend on capturing complex long-range molecular interactions. Our extensive benchmarking of popular GNN architectures reveals clear performance gaps, emphasizing the difficulty of true long-range propagation and highlighting design choices capable of overcoming inherent limitations. ECHO thereby sets a new standard for evaluating long-range information propagation, also providing a compelling example for its need in AI for science.
toXiv_bot_toot

Computing moment polytopes - with a focus on tensors, entanglement and matrix multiplication
Maxim van den Berg, Matthias Christandl, Vladimir Lysikov, Harold Nieuwboer, Michael Walter, Jeroen Zuiddam
https://arxiv.org/abs/2510.08336

Computing moment polytopes - with a focus on tensors, entanglement and matrix multiplication
Tensors are fundamental in mathematics, computer science, and physics. Their study through algebraic geometry and representation theory has proved very fruitful in the context of algebraic complexity theory and quantum information. In particular, moment polytopes have been understood to play a key role. In quantum information, moment polytopes (also known as entanglement polytopes) provide a framework for the single-particle quantum marginal problem and offer a geometric characterization of ent…

Credal Transformer: A Principled Approach for Quantifying and Mitigating Hallucinations in Large Language Models
Shihao Ji, Zihui Song, Jiajie Huang
https://arxiv.org/abs/2510.12137

Credal Transformer: A Principled Approach for Quantifying and Mitigating Hallucinations in Large Language Models
Large Language Models (LLMs) hallucinate, generating factually incorrect yet confident assertions. We argue this stems from the Transformer's Softmax function, which creates "Artificial Certainty" by collapsing ambiguous attention scores into a single probability distribution, discarding uncertainty information at each layer. To fix this, we introduce the Credal Transformer, which replaces standard attention with a Credal Attention Mechanism (CAM) based on evidential theory. CAM produces a "cre…

Combining Blotto Networks and Voter Models to Simulate Voter Behavior in Response to Competitive Election Spending
Renee Jerome
https://arxiv.org/abs/2510.09697 https://

Combining Blotto Networks and Voter Models to Simulate Voter Behavior in Response to Competitive Election Spending
In the past, the Voter Model has been explicitly used to model the impact of propaganda on a dynamic, interconnected population, and certain factors have been identified that influence the behavior of voters when under outside influence. The Blotto Game has also been explicitly used to study information wars between two opposing parties, whether in regards to a political issue or advertising war. Both the graph theory behind the Voter Model and the game theory aspects of the Blotto Game are rel…

An information theorist's tour of differential privacy
Anand D. Sarwate, Flavio P. Calmon, Oliver Kosut, Lalitha Sankar
https://arxiv.org/abs/2510.10316 https://

An information theorist's tour of differential privacy
Since being proposed in 2006, differential privacy has become a standard method for quantifying certain risks in publishing or sharing analyses of sensitive data. At its heart, differential privacy measures risk in terms of the differences between probability distributions, which is a central topic in information theory. A differentially private algorithm is a channel between the underlying data and the output of the analysis. Seen in this way, the guarantees made by differential privacy can be…

The Mechanical Yes-Man: Emancipatory AI Pedagogy in Higher Education
Linda Rocco
https://arxiv.org/abs/2510.10176 https://arxiv.org/pdf/2510.10176

The Mechanical Yes-Man: Emancipatory AI Pedagogy in Higher Education
The proliferation of Large Language Models in higher education presents a fundamental challenge to traditional pedagogical frameworks. Drawing on Jacques Rancière's theory of intellectual emancipation, this paper examines how generative AI risks becoming a "mechanical yes-man" that reinforces passivity rather than fostering intellectual autonomy. Generative AI's statistical logic and lack of causal reasoning, combined with frictionless information access, threatens to hollow out cognitive proc…

Mean dimension and rate-distortion function revisited
Rui Yang
https://arxiv.org/abs/2510.08051 https://arxiv.org/pdf/2510.08051

Mean dimension and rate-distortion function revisited
Around the mean dimensions and rate-distortion functions, using some tools from local entropy theory this paper establishes the following main results: $(1)$ We prove that for non-ergodic measures associated with almost sure processes, the mean Rényi information dimension coincides with the information dimension rate. This answers a question posed by Gutman and Śpiewak (in Around the variational principle for metric mean dimension, \emph{Studia Math.} \textbf{261}(2021) 345-360). $(2)$ We…

Symmetric Persistent Tensors and their Hessian
Masoud Gharahi, Giorgio Ottaviani
https://arxiv.org/abs/2510.07404 https://arxiv.org/pdf/2510.07404

Symmetric Persistent Tensors and their Hessian
Persistent tensors, introduced in [Quantum 8 (2024), 1238], and inspired by quantum information theory, form a recursively defined class of tensors that remain stable under the substitution method and thereby yield nontrivial lower bounds on tensor rank. In this work, we investigate the symmetric case-namely, symmetric persistent tensors, or equivalently, persistent polynomials. We establish that a symmetric tensor in $\mathrm{Sym}^n \mathbb{C}^d$ is persistent if the determinant of its Hessian…

Infinite-dimensional Lagrange-Dirac systems with boundary energy flow II: Field theories with bundle-valued forms
Fran\c{c}ois Gay-Balmaz, \'Alvaro Rodr\'iguez Abella, Hiroaki Yoshimura
https://arxiv.org/abs/2511.05687 https://arxiv.org/pdf/2511.05687 https://arxiv.org/html/2511.05687
arXiv:2511.05687v1 Announce Type: new
Abstract: Part I of this paper introduced the infinite dimensional Lagrange--Dirac theory for physical systems on the space of differential forms over a smooth manifold with boundary. This approach is particularly well-suited for systems involving energy exchange through the boundary, as it is built upon a restricted dual space -a vector subspace of the topological dual of the configuration space- that captures information about both the interior dynamics and boundary interactions. Consequently, the resulting dynamical equations naturally incorporate boundary energy flow. In this second part, the theory is extended to encompass vector-bundle-valued differential forms and non-Abelian gauge theories. To account for two commonly used forms of energy flux and boundary power densities, we introduce two distinct but equivalent formulations of the restricted dual. The results are derived from both geometric and variational viewpoints and are illustrated through applications to matter and gauge field theories. The interaction between gauge and matter fields is also addressed, along with the associated boundary conditions, applied to the case of the Yang-Mills-Higgs equations.
toXiv_bot_toot

Pooling Probabilistic Forecasts for Cooperative Wind Power Offering
Honglin Wen, Pierre Pinson
https://arxiv.org/abs/2510.12382 https://arxiv.org/pdf/2510.…

Pooling Probabilistic Forecasts for Cooperative Wind Power Offering
Wind power producers can benefit from forming coalitions to participate cooperatively in electricity markets. To support such collaboration, various profit allocation rules rooted in cooperative game theory have been proposed. However, existing approaches overlook the lack of coherence among producers regarding forecast information, which may lead to ambiguity in offering and allocations. In this paper, we introduce a ``reconcile-then-optimize'' framework for cooperative market offerings. This …

Crosslisted article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- Data as Commodity: a Game-Theoretic Principle for Information Pricing
Pasquale Casaburi, Giovanni Piccioli, Pierpaolo Vivo

Crosslisted article(s) found for math.ST. https://arxiv.org/list/math.ST/new
[1/1]:
- A Unified Information-Theoretic Framework for Meta-Learning Generalization
Wen Wen, Tieliang Gong, Yuxin Dong, Zeyu Gao, Yong-Jin Liu

Eternal inflation bubble collision signature on CMB remote dipole and quadrupole fields
Hongbo Cai, Pengjie Zhang, Yilun Guan
https://arxiv.org/abs/2510.12134 https://

Eternal inflation bubble collision signature on CMB remote dipole and quadrupole fields
The remote dipole and quadrupole fields (RDF/RQF) encode information about the observable universe as seen from remote places within our past light cone. Sensitive to the superhorizon inhomogeneites, they provide a unique way to probe physics at the largest scales, bypassing the limitations of cosmic variance inherent in the primary cosmic microwave background (CMB). In this work, we focus on the bubble collision predicted by the eternal inflation theory, which can leave distinct azimuthally sy…

Quantum-Theoretical Re-interpretation of Pricing Theory
Tian Xin
https://arxiv.org/abs/2510.06287 https://arxiv.org/pdf/2510.06287

Quantum-Theoretical Re-interpretation of Pricing Theory
Motivated by Heisenberg's observable-only stance, we replace latent "information" (filtrations, hidden diffusions, state variables) with observable transitions between price states. On a discrete price lattice with a Hilbert-space representation, shift operators and the spectral calculus of the price define observable frequency operators and a translation-invariant convolution generator. Combined with jump operators that encode transition intensities, this yields a completely positive, translat…

The quantum communication power of indefinite causal order
Xuanqiang Zhao, Benchi Zhao, Giulio Chiribella
https://arxiv.org/abs/2510.08507 https://arxiv.or…

The quantum communication power of indefinite causal order
Quantum theory is in principle compatible with scenarios where physical processes take place in an indefinite causal order, a possibility that was shown to yield advantages in several information processing tasks. However, advantages in communication, the most basic form of information processing, have so far remained controversial and hard to prove. Here we develop a framework that can be used to rigorously assess the role of causal order in a scenario where communication links are built by as…

Application of deep neural networks for computing the renormalization group flow of the two-dimensional phi^4 field theory
Yueqi Zhao, Michael M. Fogler, Yi-Zhuang You
https://arxiv.org/abs/2510.06508 …

Application of deep neural networks for computing the renormalization group flow of the two-dimensional phi^4 field theory
We introduce RGFlow, a deep neural network-based real-space renormalization group (RG) framework tailored for continuum scalar field theories. Leveraging generative capabilities of flow-based neural networks, RGFlow autonomously learns real-space RG transformations from data without prior knowledge of the underlying model. In contrast to conventional approaches, RGFlow is bijective (information-preserving) and is optimized based on the principle of minimal mutual information. We demonstrate the…

Data as Commodity: a Game-Theoretic Principle for Information Pricing
Pasquale Casaburi, Giovanni Piccioli, Pierpaolo Vivo
https://arxiv.org/abs/2510.07101 https://

Data as Commodity: a Game-Theoretic Principle for Information Pricing
Data is the central commodity of the digital economy. Unlike physical goods, it is non-rival, replicable at near-zero cost, and traded under heterogeneous licensing rules. These properties defy standard supply--demand theory and call for new pricing principles. We propose a game-theoretic approach in which the value of a data string emerges from strategic competition among N players betting on an underlying stochastic process, each holding partial information about past outcomes. A better-infor…

A Note on Idempotent Matrices: The Poset Structure and The Construction
Sen-Peng Eu, Yong-Siang Lin, Wei-Liang Sun
https://arxiv.org/abs/2510.09501 https://

A Note on Idempotent Matrices: The Poset Structure and The Construction
Idempotent elements play a fundamental role in ring theory, as they encode significant information about the underlying algebraic structure. In this paper, we study idempotent matrices from two perspectives. First, we analyze the partially ordered set of idempotents in matrix rings over a division ring. We characterize the partial order relation explicitly in terms of block decompositions of idempotent matrices. Second, over principal ideal domains, we establish an equivalent condition for a ma…

S-D-RSM: Stochastic Distributed Regularized Splitting Method for Large-Scale Convex Optimization Problems
Maoran Wang, Xingju Cai, Yongxin Chen
https://arxiv.org/abs/2511.10133 https://arxiv.org/pdf/2511.10133 https://arxiv.org/html/2511.10133
arXiv:2511.10133v1 Announce Type: new
Abstract: This paper investigates the problems large-scale distributed composite convex optimization, with motivations from a broad range of applications, including multi-agent systems, federated learning, smart grids, wireless sensor networks, compressed sensing, and so on. Stochastic gradient descent (SGD) and its variants are commonly employed to solve such problems. However, existing algorithms often rely on vanishing step sizes, strong convexity assumptions, or entail substantial computational overhead to ensure convergence or obtain favorable complexity. To bridge the gap between theory and practice, we integrate consensus optimization and operator splitting techniques (see Problem Reformulation) to develop a novel stochastic splitting algorithm, termed the \emph{stochastic distributed regularized splitting method} (S-D-RSM). In practice, S-D-RSM performs parallel updates of proximal mappings and gradient information for only a randomly selected subset of agents at each iteration. By introducing regularization terms, it effectively mitigates consensus discrepancies among distributed nodes. In contrast to conventional stochastic methods, our theoretical analysis establishes that S-D-RSM achieves global convergence without requiring diminishing step sizes or strong convexity assumptions. Furthermore, it achieves an iteration complexity of $\mathcal{O}(1/\epsilon)$ with respect to both the objective function value and the consensus error. Numerical experiments show that S-D-RSM achieves up to 2--3$\times$ speedup compared to state-of-the-art baselines, while maintaining comparable or better accuracy. These results not only validate the algorithm's theoretical guarantees but also demonstrate its effectiveness in practical tasks such as compressed sensing and empirical risk minimization.
toXiv_bot_toot

Replaced article(s) found for cs.AI. https://arxiv.org/list/cs.AI/new
[5/14]:
- QUITO-X: A New Perspective on Context Compression from the Information Bottleneck Theory
Wang, Huang, Tian, Su, Yu, Liao, Fan, Guo, Cheng

Crosslisted article(s) found for math.OA. https://arxiv.org/list/math.OA/new
[1/1]:
- Entanglement in von Neumann Algebraic Quantum Information Theory
Lauritz van Luijk

Switchable spin-photon coupling with hole spins in single-quantum dots
Carlos Sagaseta, Mar\'ia Jos\'e Calder\'on, Jos\'e Carlos Abadillo-Uriel
https://arxiv.org/abs/2510.05301

Switchable spin-photon coupling with hole spins in single-quantum dots
Spin qubits in semiconductor quantum dots offer a gate-tunable platform for quantum information processing. While two-qubit interactions are typically realized through exchange coupling between neighboring spins, coupling spin qubits to photons via hybrid spin-cQED devices enables long-range interactions and integration with other cQED platforms. Here, we investigate hole spin-photon coupling in compact single quantum dot setups. By incorporating ubiquitous strain inhomogeneities to our theory,…

A general dark-state theory for arbitrary multilevel quantum systems
Xuan Zhao, Le-Man Kuang, Jie-Qiao Liao
https://arxiv.org/abs/2510.05561 https://arxiv.…

A general dark-state theory for arbitrary multilevel quantum systems
The dark-state effect, caused by destructive quantum interference, is an important physical effect in atomic physics and quantum optics. It not only deepens the understanding of light-atom interactions, but also has wide application in quantum physics and quantum information. Therefore, how to efficiently and conveniently determine the number and form of the dark states in multilevel quantum systems with complex transitions is an important and interesting topic in this field. In this work, we p…

Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Functional Connectivity Networks for Transportation Delay Analysis: from Theory to Software
Carlson Moses B\"uth, Massimiliano Zanin

Replaced article(s) found for math.ST. https://arxiv.org/list/math.ST/new
[1/1]:
- MLE convergence speed to information projection of exponential family: Criterion for model dimens...
Yo Sheena

The $\mathbb{A}^1$-Euler characteristic of symmetric powers
Louisa F. Br\"oring, Jesse Pajwani, Anna M. Viergever
https://arxiv.org/abs/2510.06922 https://

The $\mathbb{A}^1$-Euler characteristic of symmetric powers
The $\mathbb{A}^1$-Euler characteristic is a refinement in algebraic geometry of the classical topological Euler characteristic, which can be constructed using motivic homotopy theory. This invariant is a quadratic form rather than an integer, which carries a lot of information, but is difficult to compute in practice. In this survey, we discuss a conjectural way for computing the $\mathbb{A}^1$-Euler characteristic of the symmetric powers of a variety in terms of the $\mathbb{A}^1$-Euler chara…

Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Engineering Emergence
Abel Jansma, Erik Hoel
https://arxiv.or…

DISCO-DJ II: a differentiable particle-mesh code for cosmology
Florian List, Oliver Hahn, Thomas Fl\"oss, Lukas Winkler
https://arxiv.org/abs/2510.05206 https://

DISCO-DJ II: a differentiable particle-mesh code for cosmology
The mildly non-linear regime of cosmic structure formation holds much of the information that upcoming large-scale structure surveys aim to exploit, making fast and accurate predictions on these scales essential. We present the $N$-body module of DISCO-DJ (DIfferentiable Simulations for COsmology - Done with Jax), designed to deliver high-fidelity, GPU-accelerated, and differentiable particle-mesh simulations tailored for cosmological inference. Theory-informed time integrators such as the rece…

Replaced article(s) found for math.SG. https://arxiv.org/list/math.SG/new
[1/1]:
- Non-decomposable Lagrangian cobordisms between Legendrian knots
Roman Golovko, Daniel Kom\'arek
https://arxiv.org/abs/2511.08731 https://mastoxiv.page/@arXiv_mathSG_bot/115541377678336506
- Spaces of Legendrian cables and Seifert fibered links
Eduardo Fern\'andez, Hyunki Min
https://arxiv.org/abs/2310.12385 https://mastoxiv.page/@arXiv_mathGT_bot/111265563434686287
- Almost Hermitian structures on virtual moduli spaces of non-Abelian monopoles and applications to...
Paul M. N. Feehan, Thomas G. Leness
https://arxiv.org/abs/2410.13809 https://mastoxiv.page/@arXiv_mathDG_bot/113327305560976416
- Quantum cohomology, shift operators, and Coulomb branches
Ki Fung Chan, Kwokwai Chan, Chin Hang Eddie Lam
https://arxiv.org/abs/2505.23340 https://mastoxiv.page/@arXiv_mathAG_bot/114595582234065991
- One application of Duistermaat-Heckman measure in quantum information theory
Lin Zhang, Xiaohan Jiang, Bing Xie
https://arxiv.org/abs/2507.02369 https://mastoxiv.page/@arXiv_quantph_bot/114794376818737255
toXiv_bot_toot

Probabilistic Links Between Quantum Classification of Patterns of Boolean Functions and Hamming Distance
Theodore Andronikos, Constantinos Bitsakos, Konstantinos Nikas, Georgios I. Goumas, Nectarios Koziris
https://arxiv.org/abs/2510.12736

Probabilistic Links Between Quantum Classification of Patterns of Boolean Functions and Hamming Distance
This article investigates the probabilistic relationship between quantum classification of Boolean functions and their Hamming distance. By integrating concepts from quantum computing, information theory, and combinatorics, we explore how Hamming distance serves as a metric for analyzing deviations in function classification. Our extensive experimental results confirm that the Hamming distance is a pivotal metric for validating nearest neighbors in the process of classifying random functions. O…

Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Depth One Quantum Alternating Operator Ansatz as an Approximate Gibbs Distribution Sampler
Elijah Pelofske

Algorithmic Temperature Induced by Adopted Regular Universal Turing Machine
Kentaro Imafuku
https://arxiv.org/abs/2510.11737 https://arxiv.org/pdf/2510.117…

Algorithmic Temperature Induced by Adopted Regular Universal Turing Machine
We prove that an effective temperature naturally emerges from the algorithmic structure of a regular universal Turing machine (UTM), without introducing any external physical parameter. In particular, the redundancy growth of the machine's wrapper language induces a Boltzmann--like exponential weighting over program lengths, yielding a canonical ensemble interpretation of algorithmic probability. This establishes a formal bridge between algorithmic information theory and statistical mechanics, …

Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Multiple-Rate Channel Codes in $\texttt{GF}(p^{n^{2}})$
R. S. Raja Durai, Ashwini Kumar

Nonlocal Games Through Communication Complexity and Quantum Cryptography
Pierre Botteron
https://arxiv.org/abs/2510.09457 https://arxiv.org/pdf/2510.09457

Nonlocal Games Through Communication Complexity and Quantum Cryptography
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish quantum correlations from non-signaling correlations by leveraging the principle of communication complexity. To this end, we employ techniques such as distributed computation, majority-function-based distillation protocols, the algebraic and geometric properti…

Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Functional Donoho-Elad-Gribonval-Nielsen-Fuchs Sparsity Theorem
K. Mahesh Krishna

Beyond the Carnot limit: work extraction via an entropy battery
Liam Judd McClelland
https://arxiv.org/abs/2510.08989 https://arxiv.org/pdf/2510.08989

Beyond the Carnot limit: work extraction via an entropy battery
We explore the consequences of generalized thermodynamics, as interpreted from the perspective of information theory, on an ensemble's capacity to extract energetic work. We demonstrate that by utilizing unitary heat engines of different kinds, we can capitalize on the full entropy capacity of the ensemble across multiple conserved quantities. This leads to the extraction of energetic work with efficiencies surpassing the standard Carnot efficiency limit, all the while running at maximum power.…

Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- On the Capacity of Vector Linear Computation over a Noiseless Quantum Multiple Access Channel wit...
Yuhang Yao, Syed A. Jafar

Thermodynamics of quantum processes: An operational framework for free energy and reversible athermality
Himanshu Badhani, Dhanuja G S, Siddhartha Das
https://arxiv.org/abs/2510.12790

Thermodynamics of quantum processes: An operational framework for free energy and reversible athermality
We explore the thermodynamics of quantum processes (quantum channels) by axiomatically introducing the free energy for channels, defined via the quantum relative entropy with an absolutely thermal channel whose fixed output is in equilibrium with a thermal reservoir. This definition finds strong support through its operational interpretations in designated quantum information and thermodynamic tasks. We construct a resource theory of athermality for quantum processes, where free operations are …

Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Soft Graph Transformer for MIMO Detection
Jiadong Hong, Lei Liu, Xinyu Bian, Wenjie Wang, Zhaoyang Zhang

Shedding light on classical shadows: learning photonic quantum states
Hugo Thomas, Ulysse Chabaud, Pierre-Emmanuel Emeriau
https://arxiv.org/abs/2510.07240 https://

Shedding light on classical shadows: learning photonic quantum states
Efficient learning of quantum state properties is both a fundamental and practical problem in quantum information theory. Classical shadows have emerged as an efficient method for estimating properties of unknown quantum states, with rigorous statistical guarantees, by performing randomized measurement on a few number of copies. With the advent of photonic technologies, formulating efficient learning algorithms for such platforms comes out as a natural problem. Here, we introduce a classical sh…

Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Moment Constraints and Phase Recovery for Multireference Alignment
Vahid Shahverdi, Emanuel Str\"om, Joakim and\'en

Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Simulation of Quantum Repeater Networks under Decoherence and Purification Constraints
Wenhan Li, Shiyu Zhang

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)
Nicolas Resch, S. Venkitesh
https://arxiv.org/abs/2510.07597 https://arxiv.…

List Recoverable Codes: The Good, the Bad, and the Unknown (hopefully not Ugly)
List recovery is a fundamental task for error-correcting codes, vastly generalizing unique decoding from worst-case errors and list decoding. Briefly, one is given ''soft information'' in the form of input lists S_1,...,S_n of bounded size, and one argues that there are not too many codewords that agree a lot with this soft information. This general problem appears in many guises, both within coding theory and in theoretical computer science more broadly. In this article we survey recent resu…

Recovery of the second law in fully quantum thermodynamics
Naoto Shiraishi, Ryuji Takagi
https://arxiv.org/abs/2510.05642 https://arxiv.org/pdf/2510.05642

Recovery of the second law in fully quantum thermodynamics
Quantum thermodynamics investigates how robust the second law of thermodynamics serves as the unique fundamental law in the small quantum world. To tackle this problem, the quantum coherence constitutes a major difficulty of investigations, which provides severe constraints hindering the recovery of a single thermodynamic potential. Here we solve this long-standing problem of quantum information theory by revealing that the state convertibility under thermal operations is fully characterized by…

Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Physics-Aware Sparse Signal Recovery Through PDE-Governed Measurement Systems
Tadashi Wadayama, Koji Igarashi, Takumi Takahashi

Crosslisted article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Toward Uncertainty-Aware and Generalizable Neural Decoding for Quantum LDPC Codes
Xiangjun Mi, Frank Mueller

Replaced article(s) found for cs.IT. https://arxiv.org/list/cs.IT/new
[1/1]:
- Causal Coordination for Distributed Decision-Making
Mengyuan Zhao, Tobias J. Oechtering, Ma\"el Le Treust

[2025-10-15 Wed (UTC), 5 new articles found for cs.IT Information Theory]
toXiv_bot_toot

[2025-10-14 Tue (UTC), 10 new articles found for cs.IT Information Theory]
toXiv_bot_toot

[2025-10-13 Mon (UTC), 9 new articles found for cs.IT Information Theory]
toXiv_bot_toot

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
Chris Peikert, Alexandra Veliche Hostetler
https://arxiv.org/abs/2510.11453 https://

List Decoding Reed--Solomon Codes in the Lee, Euclidean, and Other Metrics
Reed--Solomon error-correcting codes are ubiquitous across computer science and information theory, with applications in cryptography, computational complexity, communication and storage systems, and more. Most works on efficient error correction for these codes, like the celebrated Berlekamp--Welch unique decoder and the (Guruswami--)Sudan list decoders, are focused on measuring error in the Hamming metric, which simply counts the number of corrupted codeword symbols. However, for some applica…

[2025-10-10 Fri (UTC), 6 new articles found for cs.IT Information Theory]
toXiv_bot_toot

[2025-10-09 Thu (UTC), 9 new articles found for cs.IT Information Theory]
toXiv_bot_toot

A doubly composite Chernoff-Stein lemma and its applications
Ludovico Lami
https://arxiv.org/abs/2510.06342 https://arxiv.org/pdf/2510.06342

A doubly composite Chernoff-Stein lemma and its applications
Given a sequence of random variables $X^n=X_1,\ldots, X_n$, discriminating between two hypotheses on the underlying probability distribution is a key task in statistics and information theory. Of interest here is the Stein exponent, i.e. the largest rate of decay (in $n$) of the type II error probability for a vanishingly small type I error probability. When the hypotheses are simple and i.i.d., the Chernoff-Stein lemma states that this is given by the relative entropy between the single-copy p…

A Theoretically-Grounded Codebook for Digital Semantic Communications
Lingyi Wang, Rashed Shelim, Walid Saad, Naren Ramakrishnan
https://arxiv.org/abs/2510.07108 https://…

A Theoretically-Grounded Codebook for Digital Semantic Communications
The use of a learnable codebook provides an efficient way for semantic communications to map vector-based high-dimensional semantic features onto discrete symbol representations required in digital communication systems. In this paper, the problem of codebook-enabled quantization mapping for digital semantic communications is studied from the perspective of information theory. Particularly, a novel theoretically-grounded codebook design is proposed for jointly optimizing quantization efficiency…