Knowledge Hub
Curated discoveries at the intersection of numbers, physics, consciousness, and ancient wisdom.
Reed--Muller Codes Achieve the Symmetric Capacity on Finite-State Channels
We study reliable communication over finite-state channels (FSCs) using Reed--Muller (RM) codes. Building on recent symmetry-based analyses for memoryless channels, we show that a sequence of binary RM codes (with some random scrambling) can achieve the symmetric capacity (or uniform-input information rate) of a binary-input indecomposable FSC. Our approach has three components. First, we establish a capacity-via-symmetry theorem for doubly-transitive group codes on discrete memoryless channels
Diameter bounds for arbitrary finite groups and applications
We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if $G$ is a finite soluble group of exponent $e$, $\mathrm{diam}(G) \ll e (\log |G|)^8$, (2) anabelian groups with bounded-rank composition factors have polylogarithmic diameter, (3) transitive soluble subgroups of $S_n$ have diameter $\ll n^5$, and (4) Grigorchuk
Borel--Bernstein and Hirst-type Theorems for Nearest-Integer Complex Continued Fractions over Euclidean Imaginary Quadratic Fields
For each $d \in {1,2,3,7,11}$, let $T_d$ be the nearest-integer complex continued fraction map associated with the Euclidean ring $\mathcal{O}*d$, and let $(a_n)$ be its digit sequence. We prove two metric results for this five-system family. First, for every sequence $(u_n)*{n\ge 1}$ with $u_n \ge 1$, the set of points for which $|a_n| \ge u_n$ for infinitely many $n$ has full or zero normalized Lebesgue measure according as $\sum_{n=1}^\infty u_n^{-2}$ diverges or converges. This gives a unifi
A Validated Low-to-Intermediate Mass Planetary Interior Structure Model and New Mass-Radius Relations
The increasing precision of planetary mass and radius observations is bringing major questions about the structure and formation of planets--such as the nature of the radius valley and origin of super-Mercuries--within reach, demanding the development of interior structure models with more physics to more accurately determine planetary radii for a given composition. Here, we present a new model that includes state-of-the-art equations of state following the latest experimental and computational
Super-Constant Weight Dicke States in Constant Depth Without Fanout
An $n$-qubit Dicke state of weight $k$, is the uniform superposition over all $n$-bit strings of Hamming weight $k$. Dicke states are an entanglement resource with important practical applications in the NISQ era and, for instance, play a central role in Decoded Quantum Interferometry (DQI). Furthermore, any symmetric state can be expressed as a superposition of Dicke states. First, we give explicit constant-depth circuits that prepare $n$-qubit Dicke states for all $k \leq \text{polylog}(n)$, u
Wave-Based Dispatch for Circuit Cutting in Hybrid HPC--Quantum Systems
Hybrid High-performance Computing (HPC)-quantum workloads based on circuit cutting decompose large quantum circuits into independent fragments, but existing frameworks tightly couple cutting logic to execution orchestration, preventing HPC centers from applying mature resource management policies to Noisy Intermediate-Scale Quantum (NISQ) workloads. We present DQR (Dynamic Queue Router), a runtime framework that bridges this gap by treating circuit fragments as first-class schedulable units. The
Ensembles of random quantum states tunable from volume law to area law
A standard approach to generate random pure quantum states relies on sampling from the Haar measure. However, the entanglement properties of such states present a fundamental challenge for their general applicability. Here, we introduce the $σ$-ensembles $\unicode{x2013}$ a family of random quantum states with only a single control parameter. Crucially, these states are designed such that they can be tuned between volume-law and area-law behavior, which has been a major obstacle thus far. We con
Heuristic Search for Minimum-Distance Upper-Bound Witnesses in Quantum APM-LDPC Codes
This paper investigates certified upper bounds on the minimum distance of an explicit family of Calderbank-Shor-Steane quantum LDPC codes constructed from affine permutation matrices. All codes considered here have active Tanner graphs of girth eight. Rather than attempting to prove a general lower bound for the full code distance, we focus on constructing low-weight non-stabilizer logical representatives, which yield valid upper bounds once they are verified to lie in the opposite parity-check
Gravitational-wave lensing beyond rays: a disordered-system approach
We develop a framework to describe gravitational wave propagation through a stochastic distribution of weak gravitational lenses beyond the geometric optics limit. We model the lens distribution as a static random background field and formulate the problem in the language of quenched disorder, treating the disorder averaged density matrix as the fundamental object from which observables are computed. Using the Schwinger Keldysh formalism, we construct a path-integral representation of the averag