Search

This study explores a Bayesian algorithmic approach to personalized fragrance recommendation by integrating hierarchical Relevance Vector Machines (RVM) and Jungian personality archetypes. The paper proposes a structured model that links individual scent preferences for top, middle, and base notes to personality traits derived from Jungian archetypes, such as the Hero, Caregiver, and Explorer, among others. The algorithm utilizes Bayesian updating to dynamically refine predictions as users interact with each fragrance note. This iterative process allows for the personalization of fragrance experiences based on prior data and personality assessments, leading to adaptive and interpretable recommendations. By combining psychological theory with Bayesian machine learning, this approach addresses the complexity of modeling individual preferences while capturing user-specific and population-level trends. The study highlights the potential of hierarchical Bayesian frameworks in creating customized olfactory experiences, informed by psychological and demographic factors, contributing to advancements in personalized product design and machine learning applications in sensory-based industries., Comment: 15 pages, 0 figures

The Workflows Community Summit gathered 111 participants from 18 countries to discuss emerging trends and challenges in scientific workflows, focusing on six key areas: time-sensitive workflows, AI-HPC convergence, multi-facility workflows, heterogeneous HPC environments, user experience, and FAIR computational workflows. The integration of AI and exascale computing has revolutionized scientific workflows, enabling higher-fidelity models and complex, time-sensitive processes, while introducing challenges in managing heterogeneous environments and multi-facility data dependencies. The rise of large language models is driving computational demands to zettaflop scales, necessitating modular, adaptable systems and cloud-service models to optimize resource utilization and ensure reproducibility. Multi-facility workflows present challenges in data movement, curation, and overcoming institutional silos, while diverse hardware architectures require integrating workflow considerations into early system design and developing standardized resource management tools. The summit emphasized improving user experience in workflow systems and ensuring FAIR workflows to enhance collaboration and accelerate scientific discovery. Key recommendations include developing standardized metrics for time-sensitive workflows, creating frameworks for cloud-HPC integration, implementing distributed-by-design workflow modeling, establishing multi-facility authentication protocols, and accelerating AI integration in HPC workflow management. The summit also called for comprehensive workflow benchmarks, workflow-specific UX principles, and a FAIR workflow maturity model, highlighting the need for continued collaboration in addressing the complex challenges posed by the convergence of AI, HPC, and multi-facility research environments.

At frequencies below 1\,Hz, fluctuations in atmospheric emission in the Chajnantor region in northern Chile are the primary source of interference for bolometric millimeter-wave observations. This paper focuses on the statistics of these fluctuations using measurements from the Atacama Cosmology Telescope (ACT) and the Atacama Pathfinder Experiment (APEX) water vapor radiometer. After introducing a method for separating atmospheric effects from other systematic effects, we present a direct measurement of the temporal outer scale of turbulence of $\tau_0\approx50$s corresponding to a spatial scale of $L_0\approx500$m. At smaller scales, the fluctuations are well described by the Kolmogorov 2/3 power law until, at yet smaller scales, the effects of beam smearing become important. As a part of this study, we present measurements of the atmosphere by the APEX radiometer over 20 years, focused on fluctuations in precipitable water vapor (PWV). We find that the 30-minute mean of the total PWV is not in general a robust estimator of the level of fluctuations. We show that the microwave frequency spectrum of these fluctuations is in good agreement with predictions by the \texttt{am} code for bands above 90~GHz. We then show that the variance of fluctuations in ACT's mm-wave bands correlates with the variance of fluctuations in PWV measured by APEX, even though the observatories are 6\,km apart and observe different lines of sight. We find that ACT's atmosphere-determined optical efficiencies are consistent with previous planet-based results., Comment: 13 pages plus appendix, 17 figures. Submitted to PRD

Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if the physical error rate is below a critical threshold. In this work, we present two surface code memories operating below this threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. The logical error rate of our larger quantum memory is suppressed by a factor of $\Lambda$ = 2.14 $\pm$ 0.02 when increasing the code distance by two, culminating in a 101-qubit distance-7 code with 0.143% $\pm$ 0.003% error per cycle of error correction. This logical memory is also beyond break-even, exceeding its best physical qubit's lifetime by a factor of 2.4 $\pm$ 0.3. We maintain below-threshold performance when decoding in real time, achieving an average decoder latency of 63 $\mu$s at distance-5 up to a million cycles, with a cycle time of 1.1 $\mu$s. To probe the limits of our error-correction performance, we run repetition codes up to distance-29 and find that logical performance is limited by rare correlated error events occurring approximately once every hour, or 3 $\times$ 10$^9$ cycles. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms., Comment: 10 pages, 4 figures, Supplementary Information

We define the Cartesian, Categorical, and Lexicographic, and Strong products of quantum graphs. We provide bounds on the quantum chromatic number of these products in terms of the quantum chromatic number of the factors. To adequately describe bounds on the lexicographic product of quantum graphs, we provide a notion of a quantum $b$-fold chromatic number for quantum graphs.

The metadata involved in integrating code, data, configuration, and feedback into predictive models is varied and complex. This complexity is further compounded by the agile development practices favored by data scientists and machine learning engineers. These practices emphasize high experimentation velocity and frequent deployments, which can make it challenging to keep track of all the relevant metadata. The iterative nature of agile methods means that models, datasets, and configurations are constantly evolving. Each experiment might involve tweaks to the data preprocessing steps, changes in model hyperparameters, or updates to the deployment environment. The need for rapid iteration can lead to shortcuts or oversights in documentation and metadata management. Effective metadata management requires robust yet flexible tools and practices that can integrate and organize this information without slowing down the development process. Traditional context management often emphasizes a ``metadata first'' approach, which can introduce significant friction for developers. FlorDB reduces this friction through multiversion hindsight logging and incremental context maintenance, allowing developers to add and refine metadata after the fact. This ``metadata later'' approach enables a more flexible and incremental development process, allowing data scientists to focus on model creation and refinement without the burden of documentation upfront. As shown in a demo, FlorDB can be used to build AI/ML applications with integrated train-infer pipelines and managed feedback loops. Ultimately, the goal of FlorDB is to ensure that critical metadata is maintained accurately and efficiently, even in fast-paced agile workflows.

We present shadow Hamiltonian simulation, a framework for simulating quantum dynamics using a compressed quantum state that we call the "shadow state". The amplitudes of this shadow state are proportional to the expectations of a set of operators of interest. The shadow state evolves according to its own Schr\"odinger equation, and under broad conditions can be simulated on a quantum computer. We analyze a number of applications of this framework to quantum simulation problems. This includes simulating the dynamics of exponentially large systems of free fermions, or exponentially large systems of free bosons, the latter example recovering a recent algorithm for simulating exponentially many classical harmonic oscillators. Shadow Hamiltonian simulation can be extended to simulate expectations of more complex operators such as two-time correlators or Green's functions, and to study the evolution of operators themselves in the Heisenberg picture.

In the minimal Scotogenic model with fermionic dark matter, the neutrino Yukawa matrix is fine-tuned to satisfy current bounds on $\mu \rightarrow e \gamma$ while producing dark matter through thermal freezeout. One way to avoid this bound is to open a new annihilation channel for DM with a scalar field that breaks the lepton number spontaneously. This introduces a physical Goldstone boson $a$, which can constitute a light relic and opens up the lepton flavor violating channel $\mu\rightarrow e a$. In this work, we introduce a model that contains the new annihilation channel for fermionic dark matter but avoids the introduction of the Goldstone by using a discrete $\mathbb{Z}_4$ instead of a continuous symmetry. In this way, cosmological constraints on the light relic and experimental limits on lepton flavor violating decays to the Goldstone are avoided. We analyze the experimental viability of the model, identifying the region of parameter space where lepton flavor violating constraints are not saturated, DM has the correct relic density, and DM direct detection experiments are sensitive to the DM candidate., Comment: 15 pages, 8 figures

Cosmic Microwave Background experiments need to measure polarization properties of the incoming radiation very accurately to achieve their scientific goals. As a result of that, it is necessary to properly characterize these instruments. However, there are not natural sources that can be used for this purpose. For this reason, we developed the PROTOtype CALibrator for Cosmology, PROTOCALC, which is a calibrator source designed for the 90 GHz band of these telescopes. This source is purely polarized and the direction of the polarization vector is known with an accuracy better than 0.1 deg. This source flew for the first time in May 2022 showing promising result., Comment: Presented at SPIE Astronomical Telescopes 2024. arXiv admin note: text overlap with arXiv:2207.07595

(abridged) The Atacama Large Aperture Submillimeter Telescope (AtLAST) is undergoing a design study for a large (50 meter) single-dish submm-wavelength Ritchey-Chr\'etien telescope to be located 5050 meters above sea level in the Atacama Desert in northern Chile. It will allow for observations covering 30 to 950 GHz. Observing at such high frequencies with a 50~m primary mirror will be challenging, and has never been attempted thus far. This observational capability demands exquisite control of systematics to ensure a reliable beam shape, and to mitigate the expected sidelobe levels. Among them, critical issues that large telescopes like AtLAST need to deal with are introduced by the panel gap pattern, the secondary mirror supporting struts, mirror deformations produced by thermal and gravitational effects, and Ruze scattering due to surface roughness. Proprietary software such as TICRA-Tools allows for full-wave, complex-field physical optics simulations taking into account these features. Such calculations can be computationally expensive since the mirror surfaces are gridded (meshed) into a fine array in which each element is treated as a current source. If the telescope size is large and the wavelengths are short this may lead to very long running times. Here we present a set of physical optics results that allow us to estimate the performance of the telescope in terms of beam shape, directivity, sidelobes level and stray light. We also discuss how we addressed the computational challenges, and provide caveats on how to shorten the run times. Above all, we conclude that the scattering effects from the gaps and tertiary support structure are minimal, and subdominant to the Ruze scattering., Comment: Submitted to SPIE Proceedings

In this work, firstly, we propose how to experimentally demonstrate the single photon steering phenomenon in a simple way. The quantum steering phenomenon was discovered by Erwin Schrodinger, who reason that the laws of quantum mechanics obliges us to admit that by suitable measurements taken on one of two entangled system, then the state of the other system can be determined and steered. On the other hand, the first proposal about the nonlocal property of a single photon focus on showing the Bell nonlocality by using the single-photon path entanglement. Here, we propose a new experimental scheme that, by incorporating and manipulating the internal degree of freedom (IDF) of the photon, easily demonstrate the nonlocal steering phenomenon of single-photon's states. The experimental set-up that we propose differs from those published in the quantum optics' literature to shown the single photon nonlocality, which generally use the path entanglement of photons and homodyne measurements. Secondly, by incorporating its IDF, we show that the single photon steering and the quantum mechanical interaction-free measurement (QM-IFM) are identical phenomena; we will argue that QM-IFM is just a particular instance of the single-photon steering. In short, both the single photon steering and QM-IFM (being identical phenomena) have a common cause: the nonlocality of the wave function. In conclusion, we have demonstrated that it is possible to produce a nonlocal phenomena by manipulating the single photon internal degree of freedom. On the other hand, this unification between steering and QM-IFM could establish a strong support to counterfactual quantum communication and computation., Comment: 26 pages, 7 figures. submitted. arXiv admin note: text overlap with arXiv:2109.01058

Interactive notebooks, such as Jupyter, have revolutionized the field of data science by providing an integrated environment for data, code, and documentation. However, their adoption by robotics researchers and model developers has been limited. This study investigates the logging and record-keeping practices of robotics researchers, drawing parallels to the pre-interactive notebook era of data science. Through interviews with robotics researchers, we identified the reliance on diverse and often incompatible tools for managing experimental data, leading to challenges in reproducibility and data traceability. Our findings reveal that robotics researchers can benefit from a specialized version of interactive notebooks that supports comprehensive data entry, continuous context capture, and agile data staging. We propose extending interactive notebooks to better serve the needs of robotics researchers by integrating features akin to traditional lab notebooks. This adaptation aims to enhance the organization, analysis, and reproducibility of experimental data in robotics, fostering a more streamlined and efficient research workflow.

We present the simulation of nuclear magnetic resonance (NMR) spectroscopy of small organic molecules with two promising quantum computing platforms, namely IBM's quantum processors based on superconducting qubits and IonQ's Aria trapped ion quantum computer addressed via Amazon Braket. We analyze the impact of noise on the obtained NMR spectra, and we formulate an effective decoherence rate that quantifies the threshold noise that our proposed algorithm can tolerate. Furthermore we showcase how our noise analysis allows us to improve the spectra. Our investigations pave the way to better employ such application-driven quantum tasks on current noisy quantum devices., Comment: 10 pages, 13 figures

We demonstrate algorithmic cooling on IBM-Q devices. We utilize inherent qubit noise to simulate the equilibration of an interacting spin system towards its ground state, when coupled to a dissipative auxiliary-spin bath. The steady-state correlations in the system are defined by the system Hamiltonian and are stable as long as the algorithm can be executed. In particular, we demonstrate the relaxation of system spins to ferromagnetic and antiferromagnetic ordering, controlled by the definition of the Hamiltonian. We are able to perform simulated cooling for global systems of up to three system spins and four auxiliary spins., Comment: 17 pages, 12 figures in total: 9 pages main text with 6 figures

In multi-agent reinforcement learning (MARL), coordination plays a crucial role in enhancing agents' performance beyond what they could achieve through cooperation alone. The interdependence of agents' actions, coupled with the need for communication, leads to a domain where effective coordination is crucial. In this paper, we introduce and define $\textit{Multi-Agent Synchronization Tasks}$ (MSTs), a novel subset of multi-agent tasks. We describe one MST, that we call $\textit{Synchronized Predator-Prey}$, offering a detailed description that will serve as the basis for evaluating a selection of recent state-of-the-art (SOTA) MARL algorithms explicitly designed to address coordination challenges through the use of communication strategies. Furthermore, we present empirical evidence that reveals the limitations of the algorithms assessed to solve MSTs, demonstrating their inability to scale effectively beyond 2-agent coordination tasks in scenarios where communication is a requisite component. Finally, the results raise questions about the applicability of recent SOTA approaches for complex coordination tasks (i.e. MSTs) and prompt further exploration into the underlying causes of their limitations in this context., Comment: Adaptive Learning Agents Workshop at AAMAS 2024

We undertake a comprehensive study of structural properties of graph products of von Neumann algebras equipped with faithful, normal states, as well as properties of the graph products relative to subalgebras coming from induced subgraphs. Among the technical contributions in this paper include a complete bimodule calculation for subalgebras arising from subgraphs. As an application, we obtain a complete classification of when two subalgebras coming from induced subgraphs can be amenable relative to each other. We also give complete characterizations of when the graph product can be full, diffuse, or a factor. Our results are obtained in a broad generality, and we emphasize that they are new even in the tracial setting. They also allow us to deduce new results about when graph products of groups can be amenable relative to each other.

Graph independence (also known as $\epsilon$-independence or $\lambda$-independence) is a mixture of classical independence and free independence corresponding to graph products or groups and operator algebras. Using conjugation by certain random permutation matrices, we construct random matrix models for graph independence with amalgamation over the diagonal matrices. This yields a new probabilist,ic proof that graph products of sofic groups are sofic., Comment: 29 pages, multiple figures. Minor replacements, correcting typos etc. arXiv admin note: substantial text overlap with arXiv:2305.19463

We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. Assuming access to a block-encoding of $H'=(H-E)/\lambda$ for some $E \in \mathbb R$, the goal is to implement an $\epsilon$-approximation to $e^{-itH}$ when the initial state is confined to the subspace corresponding to eigenvalues $[-1, -1+\Delta/\lambda]$ of $H'$. We present a quantum algorithm that uses $O(t\sqrt{\lambda\Gamma} + \sqrt{\lambda/\Gamma}\log(1/\epsilon))$ queries to the block-encoding for any $\Gamma$ such that $\Delta \leq \Gamma \leq \lambda$. When $\log(1/\epsilon) = o(t\lambda)$ and $\Delta/\lambda = o(1)$, this result improves over generic methods with query complexity $\Omega(t\lambda)$. Our quantum algorithm leverages spectral gap amplification and the quantum singular value transform. Using standard access models for $H$, we show that the ability to efficiently block-encode $H'$ is equivalent to $H$ being what we refer to as a "gap-amplifiable" Hamiltonian. This includes physically relevant examples such as frustration-free systems, and it encompasses all previously considered settings of low-energy simulation algorithms. We also provide lower bounds for low-energy simulation. In the worst case, we show that the low-energy condition cannot be used to improve the runtime of Hamiltonian simulation. For gap-amplifiable Hamiltonians, we prove that our algorithm is tight in the query model with respect to $t$, $\Delta$, and $\lambda$. In the practically relevant regime where $\log (1/\epsilon) = o(t\Delta)$ and $\Delta/\lambda = o(1)$, we also prove a matching lower bound in gate complexity (up to log factors). To establish the query lower bounds, we consider $\mathrm{PARITY}\circ\mathrm{OR}$ and degree bounds on trigonometric polynomials. To establish the lower bound on gate complexity, we use a circuit-to-Hamiltonian reduction acting on a low-energy state., Comment: 58 pages. Abstract shortened to fit within the arXiv limit

Organizations rely on machine learning engineers (MLEs) to deploy models and maintain ML pipelines in production. Due to models' extensive reliance on fresh data, the operationalization of machine learning, or MLOps, requires MLEs to have proficiency in data science and engineering. When considered holistically, the job seems staggering -- how do MLEs do MLOps, and what are their unaddressed challenges? To address these questions, we conducted semi-structured ethnographic interviews with 18 MLEs working on various applications, including chatbots, autonomous vehicles, and finance. We find that MLEs engage in a workflow of (i) data preparation, (ii) experimentation, (iii) evaluation throughout a multi-staged deployment, and (iv) continual monitoring and response. Throughout this workflow, MLEs collaborate extensively with data scientists, product stakeholders, and one another, supplementing routine verbal exchanges with communication tools ranging from Slack to organization-wide ticketing and reporting systems. We introduce the 3Vs of MLOps: velocity, visibility, and versioning -- three virtues of successful ML deployments that MLEs learn to balance and grow as they mature. Finally, we discuss design implications and opportunities for future work., Comment: arXiv admin note: text overlap with arXiv:2209.09125

Persistence diagrams (PD)s play a central role in topological data analysis, and are used in an ever increasing variety of applications. The comparison of PD data requires computing comparison metrics among large sets of PDs, with metrics which are accurate, theoretically sound, and fast to compute. Especially for denser multi-dimensional PDs, such comparison metrics are lacking. While on the one hand, Wasserstein-type distances have high accuracy and theoretical guarantees, they incur high computational cost. On the other hand, distances between vectorizations such as Persistence Statistics (PS)s have lower computational cost, but lack the accuracy guarantees and in general they are not guaranteed to distinguish PDs (i.e. the two PS vectors of different PDs may be equal). In this work we introduce a class of pseudodistances called Extended Topological Pseudodistances (ETD)s, which have tunable complexity, and can approximate Sliced and classical Wasserstein distances at the high-complexity extreme, while being computationally lighter and close to Persistence Statistics at the lower complexity extreme, and thus allow users to interpolate between the two metrics. We build theoretical comparisons to show how to fit our new distances at an intermediate level between persistence vectorizations and Wasserstein distances. We also experimentally verify that ETDs outperform PSs in terms of accuracy and outperform Wasserstein and Sliced Wasserstein distances in terms of computational complexity., Comment: Accepted for presentation and poster on the 38th Annual AAAI Conference on Artificial Intelligence (AAAI24)

We prove a new general differential identity and an associated integral identity, which entails a pair of solutions of the Poisson equation with constant source term. This generalizes a formula that the first and third authors previously proved and used to obtain quantitative estimates of spherical symmetry for the Serrin overdetermined boundary value problem. As an application, we prove a quantitative symmetry result for the reverse Serrin problem, which we introduce for the first time in this paper. In passing, we obtain a rigidity result for solutions of the aforementioned Poisson equation subject to a constant Neumann condition.

A Proof of Secure Erasure (PoSE) is a communication protocol where a verifier seeks evidence that a prover has erased its memory within the time frame of the protocol execution. Designers of PoSE protocols have long been aware that, if a prover can outsource the computation of the memory erasure proof to another device, then their protocols are trivially defeated. As a result, most software-based PoSE protocols in the literature assume that provers are isolated during the protocol execution, that is, provers cannot receive help from a network adversary. Our main contribution is to show that this assumption is not necessary. We introduce formal models for PoSE protocols playing against provers aided by external conspirators and develop three PoSE protocols that we prove secure in this context. We reduce the requirement of isolation to the more realistic requirement that the communication with the external conspirator is relatively slow. Software-based protocols with such relaxed isolation assumptions are especially pertinent for low-end devices, where it is too costly to deploy sophisticated protection methods.

The dimer tiling problem asks in how many ways can the edges of a graph be covered by dimers so that each site is covered once. In the special case of a planar graph, this problem has a solution in terms of a free fermionic field theory. We rediscover and explore an expression for the number of coverings of an arbitrary graph by arbitrary objects in terms of an interacting fermionic field theory first proposed by Samuel. Generalizations of the dimer tiling problem, which we call `dimer piling problems,' demand that each site be covered N times by indistinguishable dimers. Our field theory provides a solution of these problems in the large-N limit. We give a similar path integral representation for certain lattice coloring problems., Comment: v1: 36 pages plus appendices, 29 figures. v2: improved understanding of large-N artifacts in model B, corrected error and added new results on 3-coloring problems

Using only 34 published tables, we reconstruct five variables (census block, sex, age, race, and ethnicity) in the confidential 2010 Census person records. Using the 38-bin age variable tabulated at the census block level, at most 20.1% of reconstructed records can differ from their confidential source on even a single value for these five variables. Using only published data, an attacker can verify that all records in 70% of all census blocks (97 million people) are perfectly reconstructed. The tabular publications in Summary File 1 thus have prohibited disclosure risk similar to the unreleased confidential microdata. Reidentification studies confirm that an attacker can, within blocks with perfect reconstruction accuracy, correctly infer the actual census response on race and ethnicity for 3.4 million vulnerable population uniques (persons with nonmodal characteristics) with 95% accuracy, the same precision as the confidential data achieve and far greater than statistical baselines. The flaw in the 2010 Census framework was the assumption that aggregation prevented accurate microdata reconstruction, justifying weaker disclosure limitation methods than were applied to 2010 Census public microdata. The framework used for 2020 Census publications defends against attacks that are based on reconstruction, as we also demonstrate here. Finally, we show that alternatives to the 2020 Census Disclosure Avoidance System with similar accuracy (enhanced swapping) also fail to protect confidentiality, and those that partially defend against reconstruction attacks (incomplete suppression implementations) destroy the primary statutory use case: data for redistricting all legislatures in the country in compliance with the 1965 Voting Rights Act.

Calculating dynamical spin correlations is essential for matching model magnetic exchange Hamiltonians to momentum-resolved spectroscopic measurements. A major numerical bottleneck is the diagonalization of the dynamical matrix, especially in systems with large magnetic unit cells, such as those with incommensurate magnetic structures or quenched disorder. In this paper, we demonstrate an efficient scheme based on the kernel polynomial method for calculating dynamical correlations of relevance to inelastic neutron scattering experiments. This method reduces the scaling of numerical cost from cubic to linear in the magnetic unit cell size., Comment: Submission to SciPost. 27 pages, 6 figures. Typos corrected, added additional minor comments to derivations

In this paper we show that the cloning system construction of Skipper and Zaremsky [SZ21], under sufficient conditions, gives rise to Thompson-Like groups which are stable; in particular, these are McDuff groups in the sense of Deprez and Vaes [DV18]. This answers a question of Bashwinger and Zaremsky posed in [BZ23] in the affirmative. In the opposite direction, we show that the group von Neumann algebra for the Higman-Thompson groups $T_d$ and $V_d$ are both prime II$_1$ factors. This follows from a new deformation/rigidity argument for a certain class of groups which admit a proper cocycle into a quasi-regular representation that is not necessarily weakly $\ell^2$., Comment: Groups action on trees removed. Fix the proof Theorem 4.5 which is now Theorem 4.10. Removed an assumption from Theorem A (Theorem 3.3). Fixed the proof of Theorem D/corollary 6.5 (now Theorem C/corollary 5.11). Removed Theorem C. Fix Theorem 4.5 (now Theorem 4.10). Combined section 5 and 6. Corrected the proof of lemma 6.1 (now lemma 5.6). Corrected the proof of lemma 6.1 (now lemma 5.6)