Tootfinder

Fermions are fundamentally more nonlocal than Bosons
Fatemeh Moradi Kalarde, Sadra Boreiri, Xiangling Xu, Lucas Tendick, Salman Beigi, Paolo Perinotti, Tommaso Guaita, Marc-Olivier Renou
https://arxiv.org/abs/2606.12363 https://arxiv.org/pdf/2606.12363 https://arxiv.org/html/2606.12363
arXiv:2606.12363v1 Announce Type: new
Abstract: Bell's theorem shows that entangled quantum particles can exhibit correlations that classical particles cannot reproduce without an additional nonlocal resource, such as communication. In this sense, quantum particles are fundamentally more nonlocal than classical ones, and entanglement becomes unavoidable in physics. Here we prove the analogous result within quantum theory itself: indistinguishable fermions transmitted through a quantum network can generate correlations that distinguishable particles or indistinguishable bosons cannot reproduce without additional communication. In the same sense, fermions are fundamentally more nonlocal than bosons or distinguishable particles, motivating fermionic anticommutation and indistinguishability as unavoidable operational resources. Our result further implies that fermions can strictly surpass all qubit-based protocols for certain distributed computing tasks, demonstrating that a complete understanding of information processing requires going beyond qubits to fermionic information carriers - febits.
toXiv_bot_toot

Color-Rule-Function Encoding for Combinatorial Memory
Alexander Khitun
https://arxiv.org/abs/2606.11365 https://arxiv.org/pdf/2606.11365 https://arxiv.org/html/2606.11365
arXiv:2606.11365v1 Announce Type: new
Abstract: Combinatorial memory is a class of memory in which information is encoded in the set of paths through a structured mesh. In this work, we introduce a systematic encoding framework, referred to as the Color-Rule-Function (CRF) approach, for representing information in combinatorial memory. The method consists of four key steps: selecting a sequence of paths in the mesh, assigning values (e.g., colors) to each cell, defining a set of rules based on the values encountered along each path, and constructing a Boolean function that determines the state of each path. . The coding procedure is illustrated by several examples. The design space scales of the CRF scale fundamentally faster compared to conventional memory. This apparent advantage arises from the use of rule-based and functional representations but is accompanied by increased hardware complexity. A possible hardware realization of the CRF framework is discussed. Importantly, the hardware overhead can be substantially reduced through the use of customized modules. The examples of the customized design are described in the text. The combination of CRF coding with customized module design may lead to a practical advantage in data storage density. According to the estimates, the data storage density may exceed Exabit per centimeter squared. A key problem that requires further investigation is related to the minimum Hamming distance between an arbitrary target bit sequence and the closest sequence realizable within the CRF framework under fixed hardware constraints.
toXiv_bot_toot

So, @… response to one co-CEO funding far-right authoritarians:
“Hey, 50% of our CEOs _aren’t_ doing that!”
C’mon y’all, respect his private donation, he leaves those views outside the company when he’s making decisions as CEO
/s (obviously) 🤮