Search

The concept of Schreier extensions of loops was introduced in the general case in [11] and, more recently, it has been explored in the context of Steiner loops in [6]. In the latter case, it gives a powerful method for constructing Steiner triple systems containing Veblen points. Counting all Steiner triple systems of order v is an open problem for v>21. In this paper, we investigate the number of Steiner triple systems of order 19, 27 and 31 containing Veblen points and we present some examples.

The Hall effect has a paramount role in a wide range of disciplines, from applied sciences to the fundamental exploration of novel topological phases of matter. In the solid state, this effect describes the emergence of a voltage drop perpendicular to the current flow in the presence of a magnetic field, leading to a transverse Hall resistance. Despite its fundamental nature, a full understanding and control of the Hall effect in interacting quantum systems is still lacking. This has led to the development of quantum simulators based on neutral atoms, where strongly correlated and universal manifestations of the Hall effect were recently unveiled. However, a direct measurement of the Hall voltage and of the Hall resistance in those systems was not achieved so far. Here, we demonstrate a technique for the measurement of the Hall voltage in a neutral-atom-based quantum simulator. From that we provide the first direct measurement of the Hall resistance in a non-electron-based system and study its dependence on the carrier density, along with theoretical analyses. Our work closes a major gap between analog quantum simulations and measurements performed in real solid-state systems, providing a key tool for the exploration of the Hall effect in highly tunable and strongly correlated systems.

The nEDM experiment at the SNS (nEDM@SNS) is the first measurement of the neutron EDM to directly measure the precession frequency of the neutron spin due to magnetic and electric fields. Previous measurements have inferred the precession frequency by measuring the residual polarization of neutrons after a long period of free precession. This difference provides independent information on potential unknown systematic uncertainties compared to previous and on-going measurements. It is precisely because nEDM@SNS is using a number of novel techniques, that it is essential to perform detailed studies of these techniques in order to optimize the statistical sensitivity and minimize the systematic uncertainty. The Systematic and Operational Studies Apparatus (SOSA) was one of the main efforts of nEDM@SNS collaboration, concentrated on development of a cryogenic test-bed for learning precise manipulation of spins and studing systematic effects of the proposed new technique. The test bed does not need an electric field but designed to have full NMR capability to the same level as nEDM@SNS., Comment: 21 pages, 11 figures. Scientific report written in 2017

In this study, we provide a full experimental characterization of the parametric longitudinal coupling between a CMOS charge qubit and an off-chip RF resonator. Following Corrigan et al, Phys. Rev. Applied 20, 064005 (2023), we activate parametric longitudinal coupling by driving the charge qubit at the resonator frequency. Managing the crosstalk between the drive applied to the qubit and the resonator allows for the systematic study of the dependence of the longitudinal and dispersive charge-photon couplings on the qubit-resonator detuning and the applied drive. Our experimental estimations of the charge-photon couplings are perfectly reproduced by theoretical simple formulas, without relying on any fitting parameter. We go further by showing a parametric displacement of the resonator's steady state, conditional on the qubit state, and the insensitivity of the longitudinal coupling constant on the photon population of the resonator. Our results open to the exploration of the photon-mediated longitudinal readout and coupling of multiple and distant spins, with long coherent times, in hybrid CMOS cQED architectures., Comment: 11 pages, 12 figures

The emerging zero-shot capabilities of Large Language Models (LLMs) have led to their applications in areas extending well beyond natural language processing tasks. In reinforcement learning, while LLMs have been extensively used in text-based environments, their integration with continuous state spaces remains understudied. In this paper, we investigate how pre-trained LLMs can be leveraged to predict in context the dynamics of continuous Markov decision processes. We identify handling multivariate data and incorporating the control signal as key challenges that limit the potential of LLMs' deployment in this setup and propose Disentangled In-Context Learning (DICL) to address them. We present proof-of-concept applications in two reinforcement learning settings: model-based policy evaluation and data-augmented off-policy reinforcement learning, supported by theoretical analysis of the proposed methods. Our experiments further demonstrate that our approach produces well-calibrated uncertainty estimates. We release the code at https://github.com/abenechehab/dicl.

Here we publish three years of data for the UCNtau experiment performed at the Los Alamos Ultra Cold Neutron Facility at the Los Alamos Neutron Science Center. These data are in addition to our previously published data. Our goals in this paper are to better understand and quantify systematic uncertainties and to improve the lifetime statistical precision. We report a measured value for these runs from 2020-2022 for the neutron lifetime of 877.94+/-0.37 s; when all the data from UCNtau are averaged we report an updated value for the lifetime of 877.82+/-0.22 (statistical)+0.20-0.17 (systematic) s. We utilized improved monitor detectors, reduced our correction due to UCN upscattering on ambient gas, and employed four different main UCN detector geometries both to reduce the correction required for rate dependence and explore potential contributions due to phase space evolution.

In this paper, we propose some Chebyshev polynomials of the 1st-kind which produce optimal bound for a polynomial dependent constant involved in the AMG $V$-cycle error bound and do not require information about the spectrum of matrices. We formulate a variant of a minimax problem already proposed in [J. Lottes, Optimal polynomial smoothers for multigrid V-cycles, Numer. Lin. Alg. with Appl., 30 (2023), p. e2518, https://doi.org/10.1002/nla.2518] and define Chebyshev polynomial of the 1st-kind as acceleration for a weighted-Jacobi smoother; we also describe efficient GPU kernels for the application of the polynomial smoother and compare results with accelerators defined in [J. Lottes, Optimal polynomial smoothers for multigrid V-cycles, Numer. Lin. Alg. with Appl., 30 (2023), p. e2518, https://doi.org/10.1002/nla.2518] on usual benchmarks at very large scales.

We devise a Floquet theory of longitudinal and dispersive readout in circuit QED. By studying qubits coupled to cavity photons and driven at the resonance frequency of the cavity $\omega_{\rm r}$, we establish a universal connection between the qubit AC Stark shift and the longitudinal and dispersive coupling to photons. We find that the longitudinal coupling $g_\parallel$ is controlled by the slope of the AC Stark shift as function of the driving strength $A_{\rm q}$, while the dispersive shift $\chi$ depends on its curvature. The two quantities become proportional to each other in the weak drive limit ($A_{\rm q}\rightarrow 0$). Our approach unifies the adiabatic limit ($\omega_{\rm r}\rightarrow 0$) -- where $g_\parallel$ is generated by the static spectrum curvature (or quantum capacitance) -- with the diabatic one, where the static spectrum plays no role. We derive analytical results supported by exact numerical simulations. We apply them to superconducting and spin-hybrid cQED systems, showcasing the flexibility of faster-than-dispersive longitudinal readout., Comment: 5 pages + supplementary material (14 pages)

In this chapter, we describe the Parallel Sparse Computation Toolkit (PSCToolkit), a suite of libraries for solving large-scale linear algebra problems in an HPC environment. In particular, we focus on the tools provided for the solution of symmetric and positive-definite linear systems using up to 8192 GPUs on the EuroHPC-JU Leonardo supercomputer. PSCToolkit is an ongoing mathematical software project aimed at exploiting the extreme computational speed of current supercomputers for relevant problems in Computational and Data Science. The toolkit is designed for node-level efficiency, flexibility and usability, supporting integration with both Fortran and C/C++, enabling researchers and developers from diverse computational backgrounds to leverage its powerful capabilities.

The past two decades have yielded several new measurements and reanalysis of older measurements of the neutron lifetime. These have led to a 4.4 standard deviation discrepancy between the most precise measurements of the neutron decay rate producing protons in cold neutron beams and the most precise lifetime measured in neutron storage experiments. Here we publish an analysis of the recently published UCN aimed a searching for an explanation of this difference using the model proposed by Koch and Hummel.

Introducing training-time augmentations is a key technique to enhance generalization and prepare deep neural networks against test-time corruptions. Inspired by the success of generative diffusion models, we propose a novel approach of coupling data mollification, in the form of image noising and blurring, with label smoothing to align predicted label confidences with image degradation. The method is simple to implement, introduces negligible overheads, and can be combined with existing augmentations. We demonstrate improved robustness and uncertainty quantification on the corrupted image benchmarks of the CIFAR and TinyImageNet datasets., Comment: Under review

In model-based reinforcement learning, most algorithms rely on simulating trajectories from one-step models of the dynamics learned on data. A critical challenge of this approach is the compounding of one-step prediction errors as the length of the trajectory grows. In this paper we tackle this issue by using a multi-step objective to train one-step models. Our objective is a weighted sum of the mean squared error (MSE) loss at various future horizons. We find that this new loss is particularly useful when the data is noisy (additive Gaussian noise in the observations), which is often the case in real-life environments. To support the multi-step loss, first we study its properties in two tractable cases: i) uni-dimensional linear system, and ii) two-parameter non-linear system. Second, we show in a variety of tasks (environments or datasets) that the models learned with this loss achieve a significant improvement in terms of the averaged R2-score on future prediction horizons. Finally, in the pure batch reinforcement learning setting, we demonstrate that one-step models serve as strong baselines when dynamics are deterministic, while multi-step models would be more advantageous in the presence of noise, highlighting the potential of our approach in real-world applications.

Estimating the structure of a Bayesian network, in the form of a directed acyclic graph (DAG), from observational data is a statistically and computationally hard problem with essential applications in areas such as causal discovery. Bayesian approaches are a promising direction for solving this task, as they allow for uncertainty quantification and deal with well-known identifiability issues. From a probabilistic inference perspective, the main challenges are (i) representing distributions over graphs that satisfy the DAG constraint and (ii) estimating a posterior over the underlying combinatorial space. We propose an approach that addresses these challenges by formulating a joint distribution on an augmented space of DAGs and permutations. We carry out posterior estimation via variational inference, where we exploit continuous relaxations of discrete distributions. We show that our approach performs competitively when compared with a wide range of Bayesian and non-Bayesian benchmarks on a range of synthetic and real datasets.

In the current landscape of deep learning research, there is a predominant emphasis on achieving high predictive accuracy in supervised tasks involving large image and language datasets. However, a broader perspective reveals a multitude of overlooked metrics, tasks, and data types, such as uncertainty, active and continual learning, and scientific data, that demand attention. Bayesian deep learning (BDL) constitutes a promising avenue, offering advantages across these diverse settings. This paper posits that BDL can elevate the capabilities of deep learning. It revisits the strengths of BDL, acknowledges existing challenges, and highlights some exciting research avenues aimed at addressing these obstacles. Looking ahead, the discussion focuses on possible ways to combine large-scale foundation models with BDL to unlock their full potential., Comment: Proceedings of the 41st International Conference on Machine Learning, Vienna, Austria. PMLR 235, 2024

This paper presents a new technique to study the adsorption and desorption of ions and electrons on insulating surfaces in the presence of strong electric fields in cryoliquids. The experimental design consists of a compact cryostat coupled with a sensitive electro-optical Kerr device to monitor the stability of the electric fields. The behavior of nitrogen and helium ions on a poly(methyl methacrylate) (PMMA) surface was compared to a PMMA surface coated with a mixture of deuterated polystyrene and deuterated polybutadiene. Ion accumulation and removal on these surfaces were unambiguously observed. Within the precision of the data, both surfaces behave similarly for the physisorbed ions. The setup was also used to measure the (quasi-)static dielectric constant of PMMA at T = 70 K. The impact of the ion adsorption on the search for a neutron permanent electric dipole moment in a cryogenic environment, like the nEDM@SNS experiment, is discussed.

interpretable, and well understood models that are routinely employed even though, as is revealed through prior and posterior predictive checks, these can poorly characterise the spatial heterogeneity in the underlying process of interest. Here, we propose a new, flexible class of spatial-process models, which we refer to as spatial Bayesian neural networks (SBNNs). An SBNN leverages the representational capacity of a Bayesian neural network; it is tailored to a spatial setting by incorporating a spatial ``embedding layer'' into the network and, possibly, spatially-varying network parameters. An SBNN is calibrated by matching its finite-dimensional distribution at locations on a fine gridding of space to that of a target process of interest. That process could be easy to simulate from or we may have many realisations from it. We propose several variants of SBNNs, most of which are able to match the finite-dimensional distribution of the target process at the selected grid better than conventional BNNs of similar complexity. We also show that an SBNN can be used to represent a variety of spatial processes often used in practice, such as Gaussian processes, lognormal processes, and max-stable processes. We briefly discuss the tools that could be used to make inference with SBNNs, and we conclude with a discussion of their advantages and limitations., Comment: 35 pages, 21 figures

In model-based reinforcement learning (MBRL), most algorithms rely on simulating trajectories from one-step dynamics models learned on data. A critical challenge of this approach is the compounding of one-step prediction errors as length of the trajectory grows. In this paper we tackle this issue by using a multi-timestep objective to train one-step models. Our objective is a weighted sum of a loss function (e.g., negative log-likelihood) at various future horizons. We explore and test a range of weights profiles. We find that exponentially decaying weights lead to models that significantly improve the long-horizon R2 score. This improvement is particularly noticeable when the models were evaluated on noisy data. Finally, using a soft actor-critic (SAC) agent in pure batch reinforcement learning (RL) and iterated batch RL scenarios, we found that our multi-timestep models outperform or match standard one-step models. This was especially evident in a noisy variant of the considered environment, highlighting the potential of our approach in real-world applications.

Fundamental neutron physics, combining precision measurements and theory, probes particle physics at short range with reach well beyond the highest energies probed by the LHC. Significant US efforts are underway that will probe BSM CP violation with orders of magnitude more sensitivity, provide new data on the Cabibbo anomaly, more precisely measure the neutron lifetime and decay, and explore hadronic parity violation. World-leading results from the US Fundamental Neutron Physics community since the last Long Range Plan, include the world's most precise measurement of the neutron lifetime from UCN$\tau$, the final results on the beta-asymmetry from UCNA and new results on hadronic parity violation from the NPDGamma and n-${^3}$He runs at the FNPB (Fundamental Neutron Physics Beamline), precision measurement of the radiative neutron decay mode and n-${}^4$He at NIST. US leadership and discovery potential are ensured by the development of new high-impact experiments including BL3, Nab, LANL nEDM and nEDM@SNS. On the theory side, the last few years have seen results for the neutron EDM from the QCD $\theta$ term, a factor of two reduction in the uncertainty for inner radiative corrections in beta-decay which impacts CKM unitarity, and progress on {\it ab initio} calculations of nuclear structure for medium-mass and heavy nuclei which can eventually improve the connection between nuclear and nucleon EDMs. In order to maintain this exciting program and capitalize on past investments while also pursuing new ideas and building US leadership in new areas, the Fundamental Neutron Physics community has identified a number of priorities and opportunities for our sub-field covering the time-frame of the last Long Range Plan (LRP) under development. This white paper elaborates on these priorities., Comment: arXiv admin note: text overlap with arXiv:2304.03451

We study non-interacting fermionic systems undergoing continuous monitoring and driven by biased reservoirs. Averaging over the measurement outcomes, we derive exact formulas for the particle and heat flows in the system. We show that these currents feature competing elastic and inelastic components, which depend non-trivially on the monitoring strength $\gamma$. We highlight that monitor-induced inelastic processes lead to non-reciprocal currents, allowing to extract work from measurements without active feedback control. We illustrate our formalism with two distinct monitoring schemes providing measurement-induced power or cooling.~Optimal performances are found for values of the monitoring strength $\gamma$ which are hard to address with perturbative approaches., Comment: 15 pages, 5 figures

Generative Models (GMs) have attracted considerable attention due to their tremendous success in various domains, such as computer vision where they are capable to generate impressive realistic-looking images. Likelihood-based GMs are attractive due to the possibility to generate new data by a single model evaluation. However, they typically achieve lower sample quality compared to state-of-the-art score-based diffusion models (DMs). This paper provides a significant step in the direction of addressing this limitation. The idea is to borrow one of the strengths of score-based DMs, which is the ability to perform accurate density estimation in low-density regions and to address manifold overfitting by means of data mollification. We connect data mollification through the addition of Gaussian noise to Gaussian homotopy, which is a well-known technique to improve optimization. Data mollification can be implemented by adding one line of code in the optimization loop, and we demonstrate that this provides a boost in generation quality of likelihood-based GMs, without computational overheads. We report results on image data sets with popular likelihood-based GMs, including variants of variational autoencoders and normalizing flows, showing large improvements in FID score., Comment: NeurIPS 2023

High spatial resolution of ultracold neutron (UCN) measurement is of growing interest to UCN experiments such as UCN spectrometers, UCN polarimeters, quantum physics of UCNs, and quantum gravity. Here we utilize physics-informed deep learning to enhance the experimental position resolution and to demonstrate sub-micron spatial resolutions for UCN position measurements obtained using a room-temperature CMOS sensor, extending our previous work [1, 2] that demonstrated a position uncertainty of 1.5 microns. We explore the use of the open-source software Allpix Squared to generate experiment-like synthetic hit images with ground-truth position labels. We use physics-informed deep learning by training a fully-connected neural network (FCNN) to learn a mapping from input hit images to output hit position. The automated analysis for sub-micron position resolution in UCN detection combined with the fast data rates of current and next generation UCN sources will enable improved precision for future UCN research and applications.

The Discrete Logarithm Problem (DLP) for elliptic curves has been extensively studied since, for instance, it is the core of the security of cryptosystems like Elliptic Curve Cryptography (ECC). In this paper, we present an attack to the DLP for elliptic curves based on its connection to the problem of lifting, by using the exponential map for elliptic curves and its inverse over $ \mathbb{Z} / p^k \mathbb{Z} $. Additionally, we show that hyperelliptic curves are resistant to this attack, meaning that these latter curves offer a higher level of security compared to the classic elliptic curves used in cryptography., Comment: 11 pages, 1 table, 20 references

This whitepaper presents the research priorities decided on by attendees of the 2022 Town Meeting for Fundamental Symmetries, Neutrons and Neutrinos, which took place December 13-15, 2022 in Chapel Hill, NC, as part of the Nuclear Science Advisory Committee (NSAC) 2023 Long Range Planning process. A total of 275 scientists registered for the meeting. The whitepaper makes a number of explicit recommendations and justifies them in detail.

We extend the map Exp for elliptic curves in short Weierstrass form over $ \mathbb{C} $ to Edwards curves over local fields. Subsequently, we compute the map Exp for Edwards curves over the local field $ \mathbb{Q}_{p} $ of $ p $-adic numbers., Comment: 11 pages, 26 references

We give a decoding algorithm for a class of error-correcting codes, which can be used in the DHH-cryptosystem, which is a candidate for post-quantum cryptography, since it is of McEliece type. Furthermore, we implement the encryption and decryption algorithms for this cryptosystem and investigate its performance., Comment: 24 pages, 4 figures, 14 references

For an (imaginary) hyperelliptic curve $ \mathcal{H} $ of genus $g$, with a Weierstrass point $\Omega$, taken as the point at infinity, we determine a basis of the Riemann-Roch space $\mathcal{L}(\Delta + m \Omega)$, where $\Delta$ is of degree zero, directly from the Mumford representation of $\Delta$. This provides in turn a generating matrix of a Goppa code., Comment: 8 pages

This paper investigates when the importance weighting (IW) correction is needed to address covariate shift, a common situation in supervised learning where the input distributions of training and test data differ. Classic results show that the IW correction is needed when the model is parametric and misspecified. In contrast, recent results indicate that the IW correction may not be necessary when the model is nonparametric and well-specified. We examine the missing case in the literature where the model is nonparametric and misspecified, and show that the IW correction is needed for obtaining the best approximation of the true unknown function for the test distribution. We do this by analyzing IW-corrected kernel ridge regression, covering a variety of settings, including parametric and nonparametric models, well-specified and misspecified settings, and arbitrary weighting functions.

We introduce Functional Diffusion Processes (FDPs), which generalize score-based diffusion models to infinite-dimensional function spaces. FDPs require a new mathematical framework to describe the forward and backward dynamics, and several extensions to derive practical training objectives. These include infinite-dimensional versions of Girsanov theorem, in order to be able to compute an ELBO, and of the sampling theorem, in order to guarantee that functional evaluations in a countable set of points are equivalent to infinite-dimensional functions. We use FDPs to build a new breed of generative models in function spaces, which do not require specialized network architectures, and that can work with any kind of continuous data. Our results on real data show that FDPs achieve high-quality image generation, using a simple MLP architecture with orders of magnitude fewer parameters than existing diffusion models., Comment: Under review

Autoencoders and their variants are among the most widely used models in representation learning and generative modeling. However, autoencoder-based models usually assume that the learned representations are i.i.d. and fail to capture the correlations between the data samples. To address this issue, we propose a novel Sparse Gaussian Process Bayesian Autoencoder (SGPBAE) model in which we impose fully Bayesian sparse Gaussian Process priors on the latent space of a Bayesian Autoencoder. We perform posterior estimation for this model via stochastic gradient Hamiltonian Monte Carlo. We evaluate our approach qualitatively and quantitatively on a wide range of representation learning and generative modeling tasks and show that our approach consistently outperforms multiple alternatives relying on Variational Autoencoders.

Given an Edwards curve, we determine a basis for the Riemann-Roch space of any divisor whose support does not contain any of the two singular points. This basis allows us to compute a generating matrix for an algebraic-geometric Goppa code over the Edwards curve., Comment: 7 pages, 1 figure

In this paper, we describe an upgrade of the Alya code with up-to-date parallel linear solvers capable of achieving reliability, efficiency and scalability in the computation of the pressure field at each time step of the numerical procedure for solving a Large Eddy Simulation formulation of the incompressible Navier-Stokes equations. We developed a software module in Alya's kernel to interface the libraries included in the current version of PSCToolkit, a framework for the iterative solution of sparse linear systems on parallel distributed-memory computers by Krylov methods coupled to Algebraic MultiGrid preconditioners. The Toolkit has undergone various extensions within the EoCoE-II project with the primary goal of facing the exascale challenge. Results on a realistic benchmark for airflow simulations in wind farm applications show that the PSCToolkit solvers significantly outperform the original versions of the Conjugate Gradient method available in the Alya's kernel in terms of scalability and parallel efficiency and represent a very promising software layer to move the Alya code towards exascale.

We develop a novel framework to accelerate Gaussian process regression (GPR). In particular, we consider localization kernels at each data point to down-weigh the contributions from other data points that are far away, and we derive the GPR model stemming from the application of such localization operation. Through a set of experiments, we demonstrate the competitive performance of the proposed approach compared to full GPR, other localized models, and deep Gaussian processes. Crucially, these performances are obtained with considerable speedups compared to standard global GPR due to the sparsification effect of the Gram matrix induced by the localization operation.