Search

We introduce the Maximal Entanglement problem, a 2-local qudit Hamiltonian that we view as a quantum generalization of Unique Games and which naturally encodes the frustration present in entanglement over multiple systems. We prove monogamy of entanglement bounds by certifying the ground state energy of the Maximal Entanglement problem in terms of the maximum matching of the underlying interaction graph via low-degree sum-of-squares proofs. Algorithmically, while a random assignment achieves energy of at least $1/d^2$ times the ground state energy, we show that a simple matching-based algorithm outputs a state with energy at least $1/d$ of the ground state energy for general graphs and at least $1/d + \Theta(1/D)$ for graphs with bounded degree, $D$. Moreover, we show that this state has energy at least $1/2$ of the ground state energy on $D$-regular graphs with degree, $D \leq 5$, for any local dimension, $d$., Comment: 12 + 8 pages

We consider a population of hosts infected by a pathogen that exists in two strains. We use a two-parameter family of Markov kernels on $[0,1]$ to describe the discrete-time evolution of the pathogen type-composition within and across individuals. First, we assume that there is no interaction between pathogen populations across host individuals. For a particular class of parameters, we establish moment duality between the type-frequency process and a process reminiscent of the \emph{Ancestral Selection Graph}. We also show convergence, under appropriate scaling of parameters and time, to a Wright-Fisher diffusion with drift. Next, we assume that pathogen-type compositions are correlated across hosts by their empirical measure. We show a propagation of chaos result comparing the pathogen type-composition of a given host with the evolution of a non-linear chain. Furthermore, we show that under appropriate scaling, the non-linear chain converges to a McKean-Vlasov diffusion. To illustrate our results, we consider a population affected by mutation rates that depend on the instantaneous distribution across multiple hosts. For this example, we study the uniform-in-time propagation of chaos and the ergodicity of the limiting McKean-Vlasov SDE., Comment: 43 pages, 2 figures

We introduce the Faetar Automatic Speech Recognition Benchmark, a benchmark corpus designed to push the limits of current approaches to low-resource speech recognition. Faetar, a Franco-Proven\c{c}al variety spoken primarily in Italy, has no standard orthography, has virtually no existing textual or speech resources other than what is included in the benchmark, and is quite different from other forms of Franco-Proven\c{c}al. The corpus comes from field recordings, most of which are noisy, for which only 5 hrs have matching transcriptions, and for which forced alignment is of variable quality. The corpus contains an additional 20 hrs of unlabelled speech. We report baseline results from state-of-the-art multilingual speech foundation models with a best phone error rate of 30.4%, using a pipeline that continues pre-training on the foundation model using the unlabelled set.

The accretion/ejection processes in T-Tauri stars are fundamental to their physical evolution, while also impacting the properties and evolution of the circumstellar material at a time when planet formation takes place. To this date, characterization of ongoing accretion processes in stellar pairs at 5-50\,au scales has been challenging, high angular resolution spectrographs are required to extract the spectral features of each component. We present the analysis of spectroscopic observations of the tight (160mas, 25au) T-Tauri system HT Lup A/B, obtained with MUSE at VLT in March and July of 2021. We focus on constraining the accretion/ejection processes and variability of the secondary component HT Lup B, by searching for accretion tracers applying High-Resolution Spectral Differential Imaging techniques. We retrieve strong (SNR $>$ 5) $H\alpha, H\beta$ and [OI]$\lambda6300$ emission in both epochs. The $H\alpha$ and $H\beta$ line fluxes showcase high variability, with variations up to 400-500\% between epochs. The fluxes are consistent with accretion rates of $8\times10^{-9} M_\odot \, yr^{-1}$ and $2\times10^{-9} M_\odot \, yr^{-1}$ for the first and second epoch, respectively. We attribute the increased accretion activity during the first night to a "burst" like event, followed by a relaxation period more representative of the common accretion activity of the system. The [OI]$\lambda6300$ line profiles remain relatively similar between epochs and suggest ejection rates on the order of $10^{-9}-10^{-10} M_\odot \, yr^{-1}$, compatible with moderate disk winds emission. Our results also indicate that the accretion processes of HT Lup B are compatible with Classical T Tauri Stars, unlike previous classifications, Comment: 28 pages, 13 fgures, Accepted by ApJ

We initiate the algorithmic study of the Quantum Max-$d$-Cut problem, a quantum generalization of the well-known Max-$d$-Cut problem. The Quantum Max-$d$-Cut problem involves finding a quantum state that maximizes the expected energy associated with the projector onto the antisymmetric subspace of two, $d$-dimensional qudits over all local interactions. Equivalently, this problem is physically motivated by the $SU(d)$-Heisenberg model, a spin glass model that generalized the well-known Heisenberg model over qudits. We develop a polynomial-time randomized approximation algorithm that finds product-state solutions of mixed states with bounded purity that achieve non-trivial performance guarantees. Moreover, we prove the tightness of our analysis by presenting an algorithmic gap instance for Quantum Max-d-Cut problem with $d \geq 3$., Comment: 23 + 12 pages

We compare the performance of a quantum local algorithm to a similar classical counterpart on a well-established combinatorial optimization problem LocalMaxCut. We show that a popular quantum algorithm first discovered by Farhi, Goldstone, and Gutmannn [1] called the quantum optimization approximation algorithm (QAOA) has a computational advantage over comparable local classical techniques on degree-3 graphs. These results hint that even small-scale quantum computation, which is relevant to the current state-of the art quantum hardware, could have significant advantages over comparably simple classical computation.

We explore the performance and portability of the high-level programming models: the LLVM-based Julia and Python/Numba, and Kokkos on high-performance computing (HPC) nodes: AMD Epyc CPUs and MI250X graphical processing units (GPUs) on Frontier's test bed Crusher system and Ampere's Arm-based CPUs and NVIDIA's A100 GPUs on the Wombat system at the Oak Ridge Leadership Computing Facilities. We compare the default performance of a hand-rolled dense matrix multiplication algorithm on CPUs against vendor-compiled C/OpenMP implementations, and on each GPU against CUDA and HIP. Rather than focusing on the kernel optimization per-se, we select this naive approach to resemble exploratory work in science and as a lower-bound for performance to isolate the effect of each programming model. Julia and Kokkos perform comparably with C/OpenMP on CPUs, while Julia implementations are competitive with CUDA and HIP on GPUs. Performance gaps are identified on NVIDIA A100 GPUs for Julia's single precision and Kokkos, and for Python/Numba in all scenarios. We also comment on half-precision support, productivity, performance portability metrics, and platform readiness. We expect to contribute to the understanding and direction for high-level, high-productivity languages in HPC as the first-generation exascale systems are deployed., Comment: Accepted at the 28th HIPS workshop, held in conjunction with IPDPS 2023. 10 pages, 9 figures

We report kinematic and thermal signatures associated with the directly imaged protoplanet candidate in the Elias 2-24 disc. Using the DSHARP ALMA observations of the $^{12}$CO J=2-1 line, we show that the disc kinematics are perturbed, with a detached CO emission spot at the location of the planet candidate and traces of spiral wakes, and also that the observed CO emission intensities require local heating. While the foreground extinction hides the velocity channels associated with the planet, preventing a planet mass estimate, the level of gas heating implied by the CO emission indicates the presence of a warm, embedded giant planet. Comparison with models show this could either be a $\gtrsim 5$M$_\mathrm{Jup}$, or a lower mass ( $\gtrsim 2$M$_\mathrm{Jup}$) but accreting proto-planet., Comment: 6 pages, 3 figures, accepted for publication in MNRAS Letters

The axioms of ZFC provide a foundation for mathematics, however, there are statements independent of ZFC, such as the Continuum Hypothesis (CH). We discuss Martin's axiom, which is an alternative to CH that roughly states that if there is a cardinal strictly between $\omega$ and $2^{\omega}$ it "behaves" like $\omega$.

5G networks intend to cover user demands through multi-party collaborations in a secure and trustworthy manner. To this end, marketplaces play a pivotal role as enablers for network service consumers and infrastructure providers to offer, negotiate, and purchase 5G resources and services. Nevertheless, marketplaces often do not ensure trustworthy networking by analyzing the security and trust of their members and offers. This paper presents a security and trust framework to enable the selection of reliable third-party providers based on their history and reputation. In addition, it also introduces a reward and punishment mechanism to continuously update trust scores according to security events. Finally, we showcase a real use case in which the security and trust framework is being applied.

Trust, security, and privacy are three of the major pillars to assemble the fifth generation network and beyond. Despite such pillars are principally interconnected, they arise a multitude of challenges to be addressed separately. 5G ought to offer flexible and pervasive computing capabilities across multiple domains according to user demands and assuring trustworthy network providers. Distributed marketplaces expect to boost the trading of heterogeneous resources so as to enable the establishment of pervasive service chains between cross-domains. Nevertheless, the need for reliable parties as ``marketplace operators'' plays a pivotal role to achieving a trustworthy ecosystem. One of the principal blockages in managing foreseeable networks is the need of adapting previous trust models to accomplish the new network and business requirements. In this regard, this article is centered on trust management of 5G multi-party networks. The design of a reputation-based trust framework is proposed as a Trust-as-a-Service (TaaS) solution for any distributed multi-stakeholder environment where zero trust and zero-touch principles should be met. Besides, a literature review is also conducted to recognize the network and business requirements currently envisaged. Finally, the validation of the proposed trust framework is performed in a real research environment, the 5GBarcelona testbed, leveraging 12% of a 2.1GHz CPU with 20 cores and 2% of the 30GiB memory. In this regard, these outcomes reveal the feasibility of the TaaS solution in the context of determining reliable network operators.