Search

Out-of-equilibrium phases in many-body systems constitute a new paradigm in quantum matter - they exhibit dynamical properties that may otherwise be forbidden by equilibrium thermodynamics. Among these non-equilibrium phases are periodically driven (Floquet) systems [1-5], that are generically difficult to simulate classically due to their high entanglement. Using an array of superconducting qubits, we realize a Floquet topologically ordered state theoretically proposed in Ref. [6], image the characteristic dynamics of its chiral edge modes, and characterize its emergent anyonic excitations. Devising an interferometric algorithm allows us to introduce and measure a bulk topological invariant to probe the dynamical transmutation of anyons for system sizes up to 58 qubits. Our work demonstrates that quantum processors can provide key insights into the thus-far largely unexplored landscape of highly entangled non-equilibrium phases of matter., Comment: 20 pages, 22 figures

We study F-theory orientifolds, starting with products of two elliptic curves, but focusing mostly on a family of K3 surfaces, lattice polarized by the rank-17 lattice $\langle 8 \rangle \oplus 2D_8(-1)$, generalizing the family (to which it degenerates) of Kummer surfaces of products of two non-isogenous elliptic curves. After a thorough study of the complex geometry of this family and its elliptic fibrations, we proceed to study real structures on the K3 surfaces in the family which are equivariant with respect to an elliptic fibration. We also study the physics of the associated F-theory orientifolds with a particular focus on the impact of the real structure on the charge spectrum. We also study how these orientifolds degenerate to the case of isotrivial Kummer surface fibrations., Comment: 56 pages

We analyze the interaction between a self-diffusiophoretic spherical Janus motor and an inert spherical cargo particle in an axisymmetric configuration in the Stokes regime. To study the different configurations of the two spheres and their motions, we develop an analog to the twin multipole approach to numerically determine the axisymmetric stream function for the flow field. We verify the validity and accuracy of this approach using existing literature and COMSOL Multiphysics. We study the effects of the size of the Janus cap, the relative ratio of sizes of the two spheres, and their separation distance on their interactions. For the case of a stationary cargo, we identify the existence of a distinct regime where the Janus motor hovers at a finite separation distance from the cargo and summarize the results using a phase diagram. In the presence of a freely moving cargo, we analyze the steady terminal velocities of the Janus motor and the cargo to identify distinct conditions at which the two spheres can translate with equal velocities while maintaining a finite separation distance.

We present the strongest limits to date on the mixing angle, $\theta$, with which a new scalar particle, $S$, mixes with the Higgs field in the mass range $100$ $MeV

Quantum sensors offer exceptional sensitivity to nanoscale magnetic field fluctuations, where non-stationary effects such as spin diffusion and non-Markovian dynamics arising from coupling to few environmental degrees of freedom play critical roles. Here, we demonstrate how quantum sensors can characterize the statistical properties of noise sources, distinguishing between stationary and non-stationary behaviors, as well as Markovian and non-Markovian dynamics. Using nitrogen-vacancy (NV) centers in diamond as a platform, we develop a physical noise model that analytically predicts Ramsey decay curves under different noise regimes. These predictions are experimentally validated by measuring Ramsey decay for NV centers subject to injected noise of each type. Our results showcase the capability of quantum sensors to unravel complex noise behaviors induced by nanoscale environments, shedding light on their physical origins and guiding the development of strategies to mitigate decoherence. This work deepens our understanding of noise dynamics at the nanoscale and lays the foundation for enhancing the performance and robustness of quantum technologies.

Silicon processing techniques such as atomic precision advanced manufacturing (APAM) and epitaxial growth require surface preparations that activate oxide desorption (typically >1000 $^{\circ}$C) and promote surface reconstruction toward atomically-clean, flat, and ordered Si(100)-2$\times$1. We compare aqueous and vapor phase cleaning of Si and Si/SiGe surfaces to prepare APAM-ready and epitaxy-ready surfaces at lower temperatures. Angle resolved X-ray photoelectron spectroscopy (ARXPS) and Fourier transform infrared (FTIR) spectroscopy indicate that vapor hydrogen fluoride (VHF) cleans dramatically reduce carbon surface contamination and allow the chemically prepared surface to reconstruct at lower temperatures, 600 $^{\circ}$C for Si and 580 $^{\circ}$C for a Si/Si$_{0.7}$Ge$_{0.3}$ heterostructures, into an ordered atomic terrace structure indicated by scanning tunneling microscopy (STM). After thermal treatment and vacuum hydrogen termination, we demonstrate STM hydrogen desorption lithography (HDL) on VHF-treated Si samples, creating reactive zones that enable area-selective chemistry using a thermal budget similar to CMOS process flows. We anticipate these results will establish new pathways to integrate APAM with Si foundry processing.

We construct a one-parameter family of pairwise non-isometric metrics $h_{\rho}, \rho > 0,$ on any closed Sasakian manifold $M^{4k+1}$ such that $\pi_1({\rm Isom}(M, h_\rho))$ is infinite. On $S^{4k+1}$, $h_0$ is the standard metric, so $\pi_1({\rm Isom}(S^{4k+1}, h_\rho)) = {\mathbb Z}_2$ is finite only at $\rho = 0.$ We also give a new proof that $\pi_1({\rm Diff}_{\eta,str} (S^{4k+1}))$ is infinite, where ${\rm Diff}_{\eta,str} (S^{4k+1})$ is the infinite dimensional group of diffeomrophisms which are strict contact transformations of the standard contact structure on $S^{4k+1}.$

This Letter presents an investigation of low-energy electron-neutrino interactions in the Fermilab Booster Neutrino Beam by the MicroBooNE experiment, motivated by the excess of electron-neutrino-like events observed by the MiniBooNE experiment. This is the first measurement to use data from all five years of operation of the MicroBooNE experiment, corresponding to an exposure of $1.11\times 10^{21}$ protons on target, a $70\%$ increase on past results. Two samples of electron neutrino interactions without visible pions are used, one with visible protons and one without any visible protons. MicroBooNE data is compared to two empirical models that modify the predicted rate of electron-neutrino interactions in different variables in the simulation to match the unfolded MiniBooNE low energy excess. In the first model, this unfolding is performed as a function of electron neutrino energy, while the second model aims to match the observed shower energy and angle distributions of the MiniBooNE excess. This measurement excludes an electron-like interpretation of the MiniBooNE excess based on these models at $> 99\%$ CL$_\mathrm{s}$ in all kinematic variables., Comment: 8 pages, 5 figures, 1 table

A remarkable characteristic of quantum computing is the potential for reliable computation despite faulty qubits. This can be achieved through quantum error correction, which is typically implemented by repeatedly applying static syndrome checks, permitting correction of logical information. Recently, the development of time-dynamic approaches to error correction has uncovered new codes and new code implementations. In this work, we experimentally demonstrate three time-dynamic implementations of the surface code, each offering a unique solution to hardware design challenges and introducing flexibility in surface code realization. First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three. Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors. Finally, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead. We measure the error suppression factor when scaling from distance-3 to distance-5 codes of $\Lambda_{35,\text{hex}} = 2.15(2)$, $\Lambda_{35,\text{walk}} = 1.69(6)$, and $\Lambda_{35,\text{iSWAP}} = 1.56(2)$, achieving state-of-the-art error suppression for each. With detailed error budgeting, we explore their performance trade-offs and implications for hardware design. This work demonstrates that dynamic circuit approaches satisfy the demands for fault-tolerance and opens new alternative avenues for scalable hardware design., Comment: 11 pages, 5 figures, Supplementary Information

Large Language Models (LLMs) have shown remarkable adaptability across domains beyond text, specifically electrocardiograms (ECGs). More specifically, there is a growing body of work exploring the task of generating text from a multi-channeled ECG and corresponding textual prompt. Current approaches typically involve pretraining an ECG-specific encoder with a self-supervised learning (SSL) objective and using the features output by the pretrained encoder to finetune a LLM for natural language generation (NLG). However, these methods are limited by 1) inefficiency from two-stage training and 2) interpretability challenges with encoder-generated features. To address these limitations, we introduce ECG-Byte, an adapted byte pair encoding (BPE) tokenizer pipeline for autoregressive language modeling of ECGs. This approach compresses and encodes ECG signals into tokens, enabling end-to-end LLM training by combining ECG and text tokens directly, while being much more interpretable since the ECG tokens can be directly mapped back to the original signal. Using ECG-Byte, we achieve competitive performance in NLG tasks in only half the time and ~48% of the data required by two-stage approaches., Comment: 26 pages, 17 figures

Quantum error correction is essential for bridging the gap between the error rates of physical devices and the extremely low logical error rates required for quantum algorithms. Recent error-correction demonstrations on superconducting processors have focused primarily on the surface code, which offers a high error threshold but poses limitations for logical operations. In contrast, the color code enables much more efficient logic, although it requires more complex stabilizer measurements and decoding techniques. Measuring these stabilizers in planar architectures such as superconducting qubits is challenging, and so far, realizations of color codes have not addressed performance scaling with code size on any platform. Here, we present a comprehensive demonstration of the color code on a superconducting processor, achieving logical error suppression and performing logical operations. Scaling the code distance from three to five suppresses logical errors by a factor of $\Lambda_{3/5}$ = 1.56(4). Simulations indicate this performance is below the threshold of the color code, and furthermore that the color code may be more efficient than the surface code with modest device improvements. Using logical randomized benchmarking, we find that transversal Clifford gates add an error of only 0.0027(3), which is substantially less than the error of an idling error correction cycle. We inject magic states, a key resource for universal computation, achieving fidelities exceeding 99% with post-selection (retaining about 75% of the data). Finally, we successfully teleport logical states between distance-three color codes using lattice surgery, with teleported state fidelities between 86.5(1)% and 90.7(1)%. This work establishes the color code as a compelling research direction to realize fault-tolerant quantum computation on superconducting processors in the near future.

Motivated by observed discrepancies between ACT DR4 and Planck 2018 cosmic microwave background (CMB) anisotropy power spectra, particularly in the cross-correlation of temperature and E-mode polarization, we investigate challenges that may be encountered in the comparison of satellite and ground-based CMB data. In particular, we focus on the effects of Fourier-space filtering and masking involving bright point sources. We show that the filtering operation generates bright cross-shaped artifacts in the map, which stretch far outside typical point-source masks. If not corrected, these artifacts can add bias or additional variance to cross-spectra, skewing results. However we find that the effect of this systematic is not large enough to explain the ACT-Planck differences presented with ACT DR4., Comment: 15 pages, 8 figures

Conversational Swarm Intelligence (CSI) is an AI-facilitated method for enabling real-time conversational deliberations and prioritizations among networked human groups of potentially unlimited size. Based on the biological principle of Swarm Intelligence and modelled on the decision-making dynamics of fish schools, CSI has been shown in prior studies to amplify group intelligence, increase group participation, and facilitate productive collaboration among hundreds of participants at once. It works by dividing a large population into a set of small subgroups that are woven together by real-time AI agents called Conversational Surrogates. The present study focuses on the use of a CSI platform called Thinkscape to enable real-time brainstorming and prioritization among groups of 75 networked users. The study employed a variant of a common brainstorming intervention called an Alternative Use Task (AUT) and was designed to compare through subjective feedback, the experience of participants brainstorming using a CSI structure vs brainstorming in a single large chat room. This comparison revealed that participants significantly preferred brainstorming with the CSI structure and reported that it felt (i) more collaborative, (ii) more productive, and (iii) was better at surfacing quality answers. In addition, participants using the CSI structure reported (iv) feeling more ownership and more buy-in in the final answers the group converged on and (v) reported feeling more heard as compared to brainstorming in a traditional text chat environment. Overall, the results suggest that CSI is a very promising AI-facilitated method for brainstorming and prioritization among large-scale, networked human groups.

J. Rosenberg's $\mathbb{S}^1$-stability conjecture states that a closed oriented manifold $X$ admits a positive scalar curvature metric iff $X\times \mathbb{S}^1$ admits a positive scalar curvature metric. We prove this conjecture whenever $kX$ is an oriented boundary for some natural number $k.$ This applies in particular if dim $X\not\equiv 0$ (mod $4$) or if $X$ is a $4$-manifold with zero signature.

Motivated by the need to use spectrum more efficiently, this paper investigates fine grained spectrum sharing (FGSS) in Multi-User massive MIMO (MU-mMIMO) systems where a neutral host enables users from different operators to share the same resource blocks. To be accepted by operators, FGSS must i) guarantee isolation so that the load of one operator does not impact the performance of another, and ii) avoid cross-subsidization whereby one operator gains more from sharing than another. We first formulate and solve an offline problem to assess the potential performance gains of FGSS with respect to the static spectrum sharing case, where operators have fixed separate sub-bands, and find that the gains can be significant, motivating the development for online solutions for FGSS. Transitioning from an offline to an online study presents unique challenges, including the lack of apriori knowledge regarding the performance of the fixed sharing case that is required to ensure isolation and cross-subsidization avoidance. We overcome these challenges and propose an online algorithm that is fast and significantly outperforms the static case. The main finding is that FGSS for a MU-mMIMO downlink system is doable in a way that is ``safe" to operators and brings large gains in spectrum efficiency (e.g., for 4 operators, a gain above 60\% is seen in many cases).

The Family Planning Estimation Tool (FPET) is used in low- and middle-income countries to produce estimates and short-term forecasts of family planning indicators, such as modern contraceptive use and unmet need for contraceptives. Estimates are obtained via a Bayesian statistical model that is fitted to country-specific data from surveys and service statistics data. The model has evolved over the last decade based on user inputs. This paper summarizes the main features of the statistical model used in FPET and introduces recent updates related to capturing contraceptive transitions, fitting to survey data that may be error prone, and the use of service statistics data. We use our experience with FPET to discuss lessons learned and open challenges related to the broader field of statistical modeling for monitoring of demographic and global health indicators to help further optimize the application of statistical modeling in practice.

Pruning neural networks, which involves removing a fraction of their weights, can often maintain high accuracy while significantly reducing model complexity, at least up to a certain limit. We present a neural network pruning technique that builds upon the Combinatorial Brain Surgeon, but solves an optimization problem over a subset of the network weights in an iterative, block-wise manner using block coordinate descent. The iterative, block-based nature of this pruning technique, which we dub ``iterative Combinatorial Brain Surgeon'' (iCBS) allows for scalability to very large models, including large language models (LLMs), that may not be feasible with a one-shot combinatorial optimization approach. When applied to large models like Mistral and DeiT, iCBS achieves higher performance metrics at the same density levels compared to existing pruning methods such as Wanda. This demonstrates the effectiveness of this iterative, block-wise pruning method in compressing and optimizing the performance of large deep learning models, even while optimizing over only a small fraction of the weights. Moreover, our approach allows for a quality-time (or cost) tradeoff that is not available when using a one-shot pruning technique alone. The block-wise formulation of the optimization problem enables the use of hardware accelerators, potentially offsetting the increased computational costs compared to one-shot pruning methods like Wanda. In particular, the optimization problem solved for each block is quantum-amenable in that it could, in principle, be solved by a quantum computer., Comment: 16 pages, 6 figures, 5 tables

Axions are a well-motivated candidate for dark matter. The preeminent method to search for axion dark matter is known as the axion haloscope, which makes use of the conversion of axions to photons in a large magnetic field. Due to the weak coupling of axions to photons however, the expected signal strength is exceptionally small. To increase signal strength, many haloscopes make use of resonant enhancement and high gain amplifiers, while also taking measures to keep receiver noise as low as possible such as the use of dilution refrigerators and ultra low-noise electronics. In this paper we derive the theoretical noise model based on the sources of noise found within a typical axion haloscope receiver chain, using the Axion Dark Matter eXperiment (ADMX) as a case study. We present examples of different noise calibration measurements at 1280~MHz using a variable temperature stage with ADMX during its most recent data taking run. The consistency between the measurements and the detailed model provide suggestions for future improvements within ADMX and other axion haloscopes to reach a lower noise temperature and to simplify the receiver chain design.

Neutrino-nucleus cross section measurements are needed to improve interaction modeling to meet the precision needs of neutrino experiments in efforts to measure oscillation parameters and search for physics beyond the Standard Model. We review the difficulties associated with modeling neutrino-nucleus interactions that lead to a dependence on event generators in oscillation analyses and cross section measurements alike. We then describe data-driven model validation techniques intended to address this model dependence. The method relies on utilizing various goodness-of-fit tests and the correlations between different observables and channels to probe the model for defects in the phase space relevant for the desired analysis. These techniques shed light on relevant mis-modeling, allowing it to be detected before it begins to bias the cross section results. We compare more commonly used model validation methods which directly validate the model against alternative ones to these data-driven techniques and show their efficacy with fake data studies. These studies demonstrate that employing data-driven model validation in cross section measurements represents a reliable strategy to produce robust results that will stimulate the desired improvements to interaction modeling.

We present a search for long-lived particles (LLPs) produced from kaon decay that decay to two muons inside the ICARUS neutrino detector. This channel would be a signal of hidden sector models that can address outstanding issues in particle physics such as the strong CP problem and the microphysical origin of dark matter. The search is performed with data collected in the Neutrinos at the Main Injector (NuMI) beam at Fermilab corresponding to $2.41\times 10^{20}$ protons-on-target. No new physics signal is observed, and we set world-leading limits on heavy QCD axions, as well as for the Higgs portal scalar among dedicated searches. Limits are also presented in a model-independent way applicable to any new physics model predicting the process $K\to \pi+S(\to\mu\mu)$, for a long-lived particle S. This result is the first search for new physics performed with the ICARUS detector at Fermilab. It paves the way for the future program of long-lived particle searches at ICARUS.

Statistical learning in high-dimensional spaces is challenging without a strong underlying data structure. Recent advances with foundational models suggest that text and image data contain such hidden structures, which help mitigate the curse of dimensionality. Inspired by results from nonparametric statistics, we hypothesize that this phenomenon can be partially explained in terms of decomposition of complex tasks into simpler subtasks. In this paper, we present a controlled experimental framework to test whether neural networks can indeed exploit such ``hidden factorial structures.'' We find that they do leverage these latent patterns to learn discrete distributions more efficiently, and derive scaling laws linking model sizes, hidden factorizations, and accuracy. We also study the interplay between our structural assumptions and the models' capacity for generalization.

In response to numerous programs seeking to advance quantum education and workforce development in the United States, experts from academia, industry, government, and professional societies convened for a National Science Foundation-sponsored workshop in February 2024 to explore the benefits and challenges of establishing a national center for quantum education. Broadly, such a center would foster collaboration and build the infrastructure required to develop a diverse and quantum-ready workforce. The workshop discussions centered around how a center could uniquely address gaps in public, K-12, and undergraduate quantum information science and engineering (QISE) education. Specifically, the community identified activities that, through a center, could lead to an increase in student awareness of quantum careers, boost the number of educators trained in quantum-related subjects, strengthen pathways into quantum careers, enhance the understanding of the U.S. quantum workforce, and elevate public engagement with QISE. Core proposed activities for the center include professional development for educators, coordinated curriculum development and curation, expanded access to educational laboratory equipment, robust evaluation and assessment practices, network building, and enhanced public engagement with quantum science.

Online paging is a fundamental problem in the field of online algorithms, in which one maintains a cache of $k$ slots as requests for fetching pages arrive online. In the weighted variant of this problem, each page has its own fetching cost; a substantial line of work on this problem culminated in an (optimal) $O(\log k)$-competitive randomized algorithm, due to Bansal, Buchbinder and Naor (FOCS'07). Existing work for weighted paging assumes that page weights are known in advance, which is not always the case in practice. For example, in multi-level caching architectures, the expected cost of fetching a memory block is a function of its probability of being in a mid-level cache rather than the main memory. This complex property cannot be predicted in advance; over time, however, one may glean information about page weights through sampling their fetching cost multiple times. We present the first algorithm for online weighted paging that does not know page weights in advance, but rather learns from weight samples. In terms of techniques, this requires providing (integral) samples to a fractional solver, requiring a delicate interface between this solver and the randomized rounding scheme; we believe that our work can inspire online algorithms to other problems that involve cost sampling.

Large neutrino liquid argon time projection chamber (LArTPC) experiments can broaden their physics reach by reconstructing and interpreting MeV-scale energy depositions, or blips, present in their data. We demonstrate new calorimetric and particle discrimination capabilities at the MeV energy scale using reconstructed blips in data from the MicroBooNE LArTPC at Fermilab. We observe a concentration of low energy ($<$3 MeV) blips around fiberglass mechanical support struts along the TPC edges with energy spectrum features consistent with the Compton edge of 2.614 MeV $^{208}$Tl decay $\gamma$ rays. These features are used to verify proper calibration of electron energy scales in MicroBooNE's data to few percent precision and to measure the specific activity of $^{208}$Tl in the fiberglass composing these struts, $(11.7 \pm 0.2 ~\text{(stat)} \pm 2.8~\text{(syst)})~\text{Bq/kg}$. Cosmogenically-produced blips above 3 MeV in reconstructed energy are used to showcase the ability of large LArTPCs to distinguish between low-energy proton and electron energy depositions. An enriched sample of low-energy protons selected using this new particle discrimination technique is found to be smaller in data than in dedicated CORSIKA cosmic ray simulations, suggesting either incorrect CORSIKA modeling of incident cosmic fluxes or particle transport modeling issues in Geant4., Comment: 19 pages, 15 figures total including the supplementary material section, 1 table. CC BY license

Rooted binary perfect phylogenies provide a generalization of rooted binary unlabeled trees in which each leaf is assigned a positive integer value that corresponds in a biological setting to the count of the number of indistinguishable lineages associated with the leaf. For the rooted binary unlabeled trees, these integers equal 1. We address a variety of enumerative problems concerning rooted binary perfect phylogenies with sample size $s$: the rooted binary unlabeled trees in which a sample of size $s$ lineages is distributed across the leaves of an unlabeled tree with $n$ leaves, $1 \leq n \leq s$. The enumerations further characterize the rooted binary perfect phylogenies, which include the rooted binary unlabeled trees, and which can provide a set of structures useful for various biological contexts.

The Axion Dark Matter eXperiment is sensitive to narrow axion flows, given axions compose a fraction of the dark matter with a non-negligible local density. Detecting these low-velocity dispersion flows requires a high spectral resolution and careful attention to the expected signal modulation due to Earth's motion. We report an exclusion on the local axion dark matter density in narrow flows of $\rho_a \gtrsim 0.03\,\mathrm{GeV/cm^3}$ and $\rho_a \gtrsim 0.004\,\mathrm{GeV/cm^3}$ for Dine-Fischler-Srednicki-Zhitnitski and Kim-Shifman-Vainshtein-Zakharov axion-photon couplings, respectively, over the mass range $3.3-4.2\,\mu\text{eV}$. Measurements were made at selected resolving powers to allow for a range of possible velocity dispersions., Comment: 7 pages, 3 figures

The 'l-Doubling' phenomenon emanates from the coupling between molecular rotations and perpendicular vibrations (bending modes) in polyatomic molecules. This elusive phenomenon has been largely discarded in laser-induced molecular alignment. Here we explore and unveil the ramifications of 'l-Doubling' to the coherent rotational dynamics of triatomic molecules at ambient temperatures and above. The observed 'l-Doubling' dynamics may be wrongly considered as collisional decay throughout the first few hundreds of picoseconds past excitation, highlighting the importance of correct assimilation of l-Doubling in current research of dissipative rotational dynamics and in coherent rotational dynamics in general., Comment: 9 pages, including supplementary information

One of the most challenging problems in the computational study of localization in quantum manybody systems is to capture the effects of rare events, which requires sampling over exponentially many disorder realizations. We implement an efficient procedure on a quantum processor, leveraging quantum parallelism, to efficiently sample over all disorder realizations. We observe localization without disorder in quantum many-body dynamics in one and two dimensions: perturbations do not diffuse even though both the generator of evolution and the initial states are fully translationally invariant. The disorder strength as well as its density can be readily tuned using the initial state. Furthermore, we demonstrate the versatility of our platform by measuring Renyi entropies. Our method could also be extended to higher moments of the physical observables and disorder learning.

Motivated by a problem in population genetics, we examine the combinatorics of dissimilarity for pairs of random unordered draws of multiple objects, with replacement, from a collection of distinct objects. Consider two draws of size $K$ taken with replacement from a set of $I$ objects, where the two draws represent samples from potentially distinct probability distributions over the set of $I$ objects. We define the set of \emph{identity states} for pairs of draws via a series of actions by permutation groups, describing the enumeration of all such states for a given $K \geq 2$ and $I \geq 2$. Given two probability vectors for the $I$ objects, we compute the probability of each identity state. From the set of all such probabilities, we obtain the expectation for a dissimilarity measure, finding that it has a simple form that generalizes a result previously obtained for the case of $K=2$. We determine when the expected dissimilarity between two draws from the same probability distribution exceeds that of two draws taken from different probability distributions. We interpret the results in the setting of the genetics of polyploid organisms, those whose genetic material contains many copies of the genome ($K > 2$)., Comment: 14 pages, 0 figures

The PlasmaKristall-4 experiment on the International Space Station allows for the study of the 3-dimensional interaction between plasma and dust particles. Previous simulations of the PK-4 environment have discovered fast moving ionization waves in the dc discharge[1]. These ionization waves vary the plasma parameters by up to an order of magnitude, which may affect the mechanisms responsible for the self-organization of chains seen in the PK-4 experiment. Here, we adapt a molecular dynamics simulation to employ temporally varying plasma conditions in order to investigate the effect on the dust charging and electrostatic potential. In order to describe the differences between the average of the plasma conditions and the time-varying plasma condition, we present a model to reproduce the potential that takes into account the negative potential from the dust grain and the positive potential from the ion wake., Comment: The following article has been submitted to Physics of Plasmas

The Colijn--Plazzotta ranking is a bijective encoding of the unlabeled binary rooted trees with positive integers. We show that the rank $f(t)$ of a tree $t$ is closely related to its height $h$, the length of the longest path from a leaf to the root. We consider the rank $f(\tau_n)$ of a random $n$-leaf tree $\tau_n$ under each of three models: (i) uniformly random unlabeled unordered binary rooted trees, or unlabeled topologies; (ii) uniformly random leaf-labeled binary trees, or labeled topologies under the uniform model; and (iii) random binary search trees, or labeled topologies under the Yule--Harding model. Relying on the close relationship between tree rank and tree height, we obtain results concerning the asymptotic properties of $\log \log f(\tau_n)$. In particular, we find $\mathbb{E} \{\log_2 \log f(\tau_n)\} \sim 2 \sqrt{\pi n}$ for uniformly random unlabeled ordered binary rooted trees and uniformly random leaf-labeled binary trees, and for a constant $\alpha \approx 4.31107$, $\mathbb{E}\{\log_2 \log f(\tau_n)\} \sim \alpha \log n $ for leaf-labeled binary trees under the Yule--Harding model. We show that the mean of $f(\tau_n)$ itself under the three models is largely determined by the rank $c_{n-1}$ of the highest-ranked tree -- the caterpillar -- obtaining an asymptotic relationship with $\pi_n c_{n-1}$, where $\pi_n$ is a model-specific function of $n$. The results resolve open problems, providing a new class of results on an encoding useful in mathematical phylogenetics.

We study the cohomology rings of tiling spaces $\Omega$ given by cubical substitutions. While there have been many calculations before of cohomology groups of such tiling spaces, the innovation here is that we use computer-assisted methods to compute the cup-product structure. This leads to examples of substitution tilings with isomorphic cohomology groups but different cohomology rings. Part of the interest in studying the cup product comes from Bellissard's gap-labeling conjecture, which is known to hold in dimensions $\le 3$, but where a proof is known in dimensions $\ge 4$ only when the Chern character from $K^0(\Omega)$ to $H^*(\Omega,\mathbb{Q})$ lands in $H^*(\Omega,\mathbb{Z})$. Computation of the cup product on cohomology often makes it possible to compute the Chern character. We introduce a natural generalization of the gap-labeling conjecture, called the equivariant gap-labeling conjecture, which applies to tilings with a finite symmetry group. Again this holds in dimensions $\le 3$, but we are able to show that it fails in general in dimensions $\ge 4$. This, plus some of our cup product calculations, makes it plausible that the gap-labeling conjecture might fail in high dimensions., Comment: Fixed mistake in the first pair of examples, added references

Lattice gauge theories (LGTs) can be employed to understand a wide range of phenomena, from elementary particle scattering in high-energy physics to effective descriptions of many-body interactions in materials. Studying dynamical properties of emergent phases can be challenging as it requires solving many-body problems that are generally beyond perturbative limits. We investigate the dynamics of local excitations in a $\mathbb{Z}_2$ LGT using a two-dimensional lattice of superconducting qubits. We first construct a simple variational circuit which prepares low-energy states that have a large overlap with the ground state; then we create particles with local gates and simulate their quantum dynamics via a discretized time evolution. As the effective magnetic field is increased, our measurements show signatures of transitioning from deconfined to confined dynamics. For confined excitations, the magnetic field induces a tension in the string connecting them. Our method allows us to experimentally image string dynamics in a (2+1)D LGT from which we uncover two distinct regimes inside the confining phase: for weak confinement the string fluctuates strongly in the transverse direction, while for strong confinement transverse fluctuations are effectively frozen. In addition, we demonstrate a resonance condition at which dynamical string breaking is facilitated. Our LGT implementation on a quantum processor presents a novel set of techniques for investigating emergent particle and string dynamics.

This short note summarizes a number of facts about the ring $K^0(X)$ for $X$ a $4$-dimensional CW-complex. Unusual features of this dimension are that every complex vector bundle is determined up to stable isomorphism by its Chern classes, that every even cohomology class arises as a Chern class of a vector bundle, and that $K^0(X)$ is completely determined as a ring by knowledge of the even-dimensional cohomology ring $H^{\text{even}}(X; \mathbb Z)$. (All of these fail in high dimensions.), Comment: 5 pages. minor corrections. This version to appear in Indiana University Mathematical Journal

Conversational Swarm Intelligence (CSI) is an AI-powered communication and collaboration technology that allows large, networked groups (of potentially unlimited size) to hold thoughtful conversational deliberations in real-time. Inspired by the efficient decision-making dynamics of fish schools, CSI divides a human population into a set of small subgroups connected by AI agents. This enables the full group to hold a unified conversation. In this study, groups of 25 participants were tasked with selecting a roster of players in a real Fantasy Baseball contest. A total of 10 trials were run using CSI. In half the trials, each subgroup was augmented with a fact-providing AI agent referred to herein as an Infobot. The Infobot was loaded with a wide range of MLB statistics. The human participants could query the Infobot the same way they would query other persons in their subgroup. Results show that when using CSI, the 25-person groups outperformed 72% of individually surveyed participants and showed significant intelligence amplification versus the mean score (p=0.016). The CSI-enabled groups also significantly outperformed the most popular picks across the collected surveys for each daily contest (p<0.001). The CSI sessions that used Infobots scored slightly higher than those that did not, but it was not statistically significant in this study. That said, 85% of participants agreed with the statement 'Our decisions were stronger because of information provided by the Infobot' and only 4% disagreed. In addition, deliberations that used Infobots showed significantly less variance (p=0.039) in conversational content across members. This suggests that Infobots promoted more balanced discussions in which fewer members dominated the dialog. This may be because the infobot enabled participants to confidently express opinions with the support of factual data

In this paper, we introduce a zero-shot Voice Transfer (VT) module that can be seamlessly integrated into a multi-lingual Text-to-speech (TTS) system to transfer an individual's voice across languages. Our proposed VT module comprises a speaker-encoder that processes reference speech, a bottleneck layer, and residual adapters, connected to preexisting TTS layers. We compare the performance of various configurations of these components and report Mean Opinion Score (MOS) and Speaker Similarity across languages. Using a single English reference speech per speaker, we achieve an average voice transfer similarity score of 73% across nine target languages. Vocal characteristics contribute significantly to the construction and perception of individual identity. The loss of one's voice, due to physical or neurological conditions, can lead to a profound sense of loss, impacting one's core identity. As a case study, we demonstrate that our approach can not only transfer typical speech but also restore the voices of individuals with dysarthria, even when only atypical speech samples are available - a valuable utility for those who have never had typical speech or banked their voice. Cross-lingual typical audio samples, plus videos demonstrating voice restoration for dysarthric speakers are available here (google.github.io/tacotron/publications/zero_shot_voice_transfer)., Comment: Submitted to ICASSP

We explore the possibility to implement random walks in the manifold of Hartree-Fock-Bogoliubov wave functions. The goal is to extend state-of-the-art quantum Monte Carlo approaches, in particular the constrained-path auxiliary-field quantum Monte Carlo technique, to systems where finite pairing order parameters or complex pairing mechanisms, e.g., Fulde-Ferrell-Larkin-Ovchinnikov (FFLO) pairing or triplet pairing, may be expected. Leveraging the flexibility to define a vacuum state tailored to the physical problem, we discuss a method to use imaginary-time evolution of Hartree-Fock-Bogoliubov states to compute ground state correlations, extending beyond situations spanned by current formalisms. Illustrative examples are provided., Comment: 11 pages, 3 figures

Bilevel optimization methods are increasingly relevant within machine learning, especially for tasks such as hyperparameter optimization and meta-learning. Compared to the offline setting, online bilevel optimization (OBO) offers a more dynamic framework by accommodating time-varying functions and sequentially arriving data. This study addresses the online nonconvex-strongly convex bilevel optimization problem. In deterministic settings, we introduce a novel online Bregman bilevel optimizer (OBBO) that utilizes adaptive Bregman divergences. We demonstrate that OBBO enhances the known sublinear rates for bilevel local regret through a novel hypergradient error decomposition that adapts to the underlying geometry of the problem. In stochastic contexts, we introduce the first stochastic online bilevel optimizer (SOBBO), which employs a window averaging method for updating outer-level variables using a weighted average of recent stochastic approximations of hypergradients. This approach not only achieves sublinear rates of bilevel local regret but also serves as an effective variance reduction strategy, obviating the need for additional stochastic gradient samples at each timestep. Experiments on online hyperparameter optimization and online meta-learning highlight the superior performance, efficiency, and adaptability of our Bregman-based algorithms compared to established online and offline bilevel benchmarks.

Laser-plasma instabilities under ignition conditions for direct-drive inertial confinement fusion are studied using two-dimensional Particle-in-Cell simulations with a combination of in-plane (PP) and out-of-the-plane (SP) lasers. The results show that stimulated Raman side scattering can induce significant pump depletion and form a gap in the Raman scattered light spectra that have been observed in experiments., Comment: 6 pages, 4 figures

Recent studies have shown that large language models' (LLMs) mathematical problem-solving capabilities can be enhanced by integrating external tools, such as code interpreters, and employing multi-turn Chain-of-Thought (CoT) reasoning. While current methods focus on synthetic data generation and Supervised Fine-Tuning (SFT), this paper studies the complementary direct preference learning approach to further improve model performance. However, existing direct preference learning algorithms are originally designed for the single-turn chat task, and do not fully address the complexities of multi-turn reasoning and external tool integration required for tool-integrated mathematical reasoning tasks. To fill in this gap, we introduce a multi-turn direct preference learning framework, tailored for this context, that leverages feedback from code interpreters and optimizes trajectory-level preferences. This framework includes multi-turn DPO and multi-turn KTO as specific implementations. The effectiveness of our framework is validated through training of various language models using an augmented prompt set from the GSM8K and MATH datasets. Our results demonstrate substantial improvements: a supervised fine-tuned Gemma-1.1-it-7B model's performance increased from 77.5% to 83.9% on GSM8K and from 46.1% to 51.2% on MATH. Similarly, a Gemma-2-it-9B model improved from 84.1% to 86.3% on GSM8K and from 51.0% to 54.5% on MATH., Comment: A multi-turn direct preference learning framework for tool-integrated reasoning tasks

Representing speech as discrete tokens provides a framework for transforming speech into a format that closely resembles text, thus enabling the use of speech as an input to the widely successful large language models (LLMs). Currently, while several speech tokenizers have been proposed, there is ambiguity regarding the properties that are desired from a tokenizer for specific downstream tasks and its overall generalizability. Evaluating the performance of tokenizers across different downstream tasks is a computationally intensive effort that poses challenges for scalability. To circumvent this requirement, we present STAB (Speech Tokenizer Assessment Benchmark), a systematic evaluation framework designed to assess speech tokenizers comprehensively and shed light on their inherent characteristics. This framework provides a deeper understanding of the underlying mechanisms of speech tokenization, thereby offering a valuable resource for expediting the advancement of future tokenizer models and enabling comparative analysis using a standardized benchmark. We evaluate the STAB metrics and correlate this with downstream task performance across a range of speech tasks and tokenizer choices., Comment: 5 pages