Tootfinder

Building a Runtime JAR inspector in 10 hours
https://devblogs.microsoft.com/java/building-a-runtime-jar-inspector-in-10-hours/

Randomization Restrictions: Their Impact on Type I Error When Experimenting with Finite Populations
Jonathan J. Chipman, Oleksandr Sverdlov, Diane Uschner
https://arxiv.org/abs/2510.07153

Randomization Restrictions: Their Impact on Type I Error When Experimenting with Finite Populations
Participants in clinical trials are often viewed as a unique, finite population. Yet, statistical analyses often assume that participants were randomly sampled from a larger population. Under Complete Randomization, Randomization-Based Inference (RBI; a finite population inference) and Analysis of Variance (ANOVA; a random sampling inference) provide asymptotically equivalent difference-in-means tests. However, sequentially-enrolling trials typically employ restricted randomization schemes, suc…

Haar random codes attain the quantum Hamming bound, approximately
Fermi Ma, Xinyu Tan, John Wright
https://arxiv.org/abs/2510.07158 https://arxiv.org/pdf/2…

Haar random codes attain the quantum Hamming bound, approximately
We study the error correcting properties of Haar random codes, in which a $K$-dimensional code space $\boldsymbol{C} \subseteq \mathbb{C}^N$ is chosen at random from the Haar distribution. Our main result is that Haar random codes can approximately correct errors up to the quantum Hamming bound, meaning that a set of $m$ Pauli errors can be approximately corrected so long as $mK \ll N$. This is the strongest bound known for any family of quantum error correcting codes (QECs), and continues a li…

Using dense graph limit theory to count cocycles of random simplicial complexes
Andr\'as M\'esz\'aros
https://arxiv.org/abs/2509.06559 https://…

Using dense graph limit theory to count cocycles of random simplicial complexes
We develop a limit theory for $1$-cochains of complete graphs with coefficients from a finite abelian group. We prove an analogue of the large deviation principle of Chatterjee and Varadhan for random cochains. We use these new tools to prove results about the homology of random $2$-dimensional simplicial complexes. More specifically, we prove that if $T_n$ is a random $2$-dimensional determinantal hypertree on $n$ vertices and $p$ is any prime, then \[\frac{\dim H_1(T_n,\mathbb{F}_p)}{n^2}\]…

Composition Law of Conjugate Observables in Random Permutation Sorting Systems
Yurang R. Kuang
https://arxiv.org/abs/2510.08013 https://arxiv.org/pdf/2510.…

Composition Law of Conjugate Observables in Random Permutation Sorting Systems
We present the discovery of a fundamental composition law governing conjugate observables in the Random Permutation Sorting System (RPSS). The law links the discrete permutation count Np and the continuous elapsed time T through a functional relation connecting the characteristic function of timing distributions to the probability generating function of permutation counts. This framework enables entropy purification, transforming microarchitectural timing fluctuations into uniform randomness vi…

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
Guan-Yu Chen, Xi Yang
https://arxiv.org/abs/2509.06856 https://

Sequential Least-Squares Estimators with Fast Randomized Sketching for Linear Statistical Models
We propose a novel randomized framework for the estimation problem of large-scale linear statistical models, namely Sequential Least-Squares Estimators with Fast Randomized Sketching (SLSE-FRS), which integrates Sketch-and-Solve and Iterative-Sketching methods for the first time. By iteratively constructing and solving sketched least-squares (LS) subproblems with increasing sketch sizes to achieve better precisions, SLSE-FRS gradually refines the estimators of the true parameter vector, ultimat…

Randomized and quantum approximate matrix multiplication
Simon Apers, Arjan Cornelissen, Samson Wang
https://arxiv.org/abs/2510.08509 https://arxiv.org/pdf…

Randomized and quantum approximate matrix multiplication
The complexity of matrix multiplication is a central topic in computer science. While the focus has traditionally been on exact algorithms, a long line of literature also considers randomized algorithms, which return an approximate solution in faster time. In this work, we adopt a unifying perspective that frames these randomized algorithms in terms of mean estimation. Using it, we first give refined analyses of classical algorithms based on random walks by Cohen-Lewis (`99), and based on sketc…

Quantum Relative Entropy Decay Composition Yields Shallow, Unstructured k-Designs
Nicholas Laracuente
https://arxiv.org/abs/2510.08537 https://arxiv.org/pd…

Quantum Relative Entropy Decay Composition Yields Shallow, Unstructured k-Designs
A major line of questions in quantum information and computing asks how quickly locally random circuits converge to resemble global randomness. In particular, approximate k-designs are random unitary ensembles that resemble random circuits up to their first k moments. It was recently shown that on n qudits, random circuits with slightly structured architectures converge to k-designs in depth O(log n), even on one-dimensional connectivity. It has however remained open whether the same shallow de…

Random unitaries that conserve energy
Liang Mao, Laura Cui, Thomas Schuster, Hsin-Yuan Huang
https://arxiv.org/abs/2510.08448 https://arxiv.org/pdf/2510.08…

Random unitaries that conserve energy
Random unitaries sampled from the Haar measure serve as fundamental models for generic quantum many-body dynamics. Under standard cryptographic assumptions, recent works have constructed polynomial-size quantum circuits that are computationally indistinguishable from Haar-random unitaries, establishing the concept of pseudorandom unitaries (PRUs). While PRUs have found broad implications in many-body physics, they fail to capture the energy conservation that governs physical systems. In this wo…