Search

We introduce Polaris, a network null model for colored multi-graphs that preserves the Joint Color Matrix. Polaris is specifically designed for studying network polarization, where vertices belong to a side in a debate or a partisan group, represented by a vertex color, and relations have different strengths, represented by an integer-valued edge multiplicity. The key feature of Polaris is preserving the Joint Color Matrix (JCM) of the multigraph, which specifies the number of edges connecting vertices of any two given colors. The JCM is the basic property that determines color assortativity, a fundamental aspect in studying homophily and segregation in polarized networks. By using Polaris, network scientists can test whether a phenomenon is entirely explained by the JCM of the observed network or whether other phenomena might be at play. Technically, our null model is an extension of the configuration model: an ensemble of colored multigraphs characterized by the same degree sequence and the same JCM. To sample from this ensemble, we develop a suite of Markov Chain Monte Carlo algorithms, collectively named Polaris-*. It includes Polaris-B, an adaptation of a generic Metropolis-Hastings algorithm, and Polaris-C, a faster, specialized algorithm with higher acceptance probabilities. This new null model and the associated algorithms provide a more nuanced toolset for examining polarization in social networks, thus enabling statistically sound conclusions.

We demonstrate that the Balitsky-Fadin-Kuraev-Lipatov regime of maximally supersymmetric Yang-Mills theory can be explicitly solved up to the L+1 order in weak coupling by uncovering a novel long-range asymptotic Baxter-Bethe ansatz for trajectories with L scalar fields. The set of equations we have found is reminiscent of the Beisert-Eden-Staudacher equations for local operators but instead applies to non-local operators corresponding to the horizontal Regge trajectories. We also verify and give new predictions for the light-ray operator spectrum by resummation of the leading singularities in our result., Comment: 6 pages + supplementary material, 6 figures and 1 table

Short-wavelength repulsive potentials for quantum gases allow to realize new systems and to study new phenomena. Here we report the realization of repulsive optical potentials for dysprosium atoms in the blue region of the spectrum, at wavelengths close to 400 nm. We employ a spectrallyfiltered diode laser system to measure both scalar and tensorial components of the polarizability of dysprosium, which we find in good agreement with the theoretical predictions. We demonstrate the implementation of potential strengths appropriate to manipulate Bose-Einstein condensates, with scattering-limited lifetimes exceeding one second. This type of optical potentials opens interesting directions for the study of dipolar superfluids and supersolids., Comment: 7 pages, 8 figures

Despite the widespread adoption of higher-order mathematical structures such as hypergraphs, methodological tools for their analysis lag behind those for traditional graphs. This work addresses a critical gap in this context by proposing two micro-canonical random null models for directed hypergraphs: the Directed Hypergraph Configuration Model (DHCM) and the Directed Hypergraph JOINT Model (DHJM). These models preserve essential structural properties of directed hypergraphs such as node in- and out-degree sequences and hyperedge head and tail size sequences, or their joint tensor. We also describe two efficient MCMC algorithms, NuDHy-Degs and NuDHy-JOINT, to sample random hypergraphs from these ensembles. To showcase the interdisciplinary applicability of the proposed null models, we present three distinct use cases in sociology, epidemiology, and economics. First, we reveal the oscillatory behavior of increased homophily in opposition parties in the US Congress over a 40-year span, emphasizing the role of higher-order structures in quantifying political group homophily. Second, we investigate non-linear contagion in contact hyper-networks, demonstrating that disparities between simulations and theoretical predictions can be explained by considering higher-order joint degree distributions. Last, we examine the economic complexity of countries in the global trade network, showing that local network properties preserved by NuDHy explain the main structural economic complexity indexes. This work advances the development of null models for directed hypergraphs, addressing the intricate challenges posed by their complex entity relations, and providing a versatile suite of tools for researchers across various domains., Comment: Accepted for publication in PRX

We prove that every separable infinite-dimensional Banach space admits a G\^ateaux smooth and rotund norm which is not midpoint locally uniformly rotund. Moreover, by using a similar technique, we provide in every infinite-dimensional Banach space with separable dual a Fr\'echet smooth and weakly uniformly rotund norm which is not midpoint locally uniformly rotund. These two results provide a positive answer to some open problems by A. J. Guirao, V. Montesinos, and V. Zizler.

Quantitative characterization of two-qubit entanglement purification protocols is introduced. Our approach is based on the concurrence and the hit-and-run algorithm applied to the convex set of all two-qubit states. We demonstrate that pioneering protocols are unable to improve the estimated initial average concurrence of almost uniformly sampled density matrices, however, as it is known, they still generate pairs of qubits in a state that is close to a Bell state. We also develop a more efficient protocol and investigate it numerically together with a recent proposal based on an entangling rank-$2$ projector. Furthermore, we present a class of variational purification protocols with continuous parameters and optimize their output concurrence. These optimized algorithms turn out to surpass former proposals and our protocol by means of not wasting too many entangled states., Comment: 16 pages, 6 figures

The effort to generate matrix exponentials and associated differentials, required to determine the time evolution of quantum systems, frequently constrains the evaluation of problems in quantum control theory, variational circuit compilation, or Monte-Carlo sampling. We introduce two ideas for the time-efficient approximation of matrix exponentials of linear multi-parametric Hamiltonians. We modify the Suzuki-Trotter product formula from an approximation to an interpolation schemes to improve both accuracy and computational time. This allows us to achieve high fidelities within a single interpolation step, which can be computed directly from cached matrices. We furthermore define the interpolation on a grid of system parameters, and show that the infidelity of the interpolation converges with $4^\mathrm{th}$ order in the number of interpolation bins.

The combination of integrability and crossing symmetry has proven to give tight non-perturbative bounds on some planar structure constants in $\mathcal{N}$=4 SYM, particularly in the setup of defect observables built on a Wilson-Maldacena line. Whereas the precision is good for the low lying states, higher in the spectrum it drops due to the degeneracies at weak coupling when considering a single correlator. As this could be a clear obstacle in restoring higher point functions, we studied the problem of bounding directly a 4-point function at generic cross ratio, showing how to adapt for this purpose the numerical bootstrap algorithms based on semidefinite programming. Another tool we are using to further narrow the bounds is a parity symmetry descending from the $\mathcal{N}$=4 SYM theory, which allowed us to reduce the number of parameters. We also give an interpretation for the parity in terms of the Quantum Spectral Curve at weak coupling. Our numerical bounds give an accurate determination of the 4-point function for physical values of the cross ratio, with at worst 5-6 digits precision at weak coupling and reaching more than 11 digits for 't Hooft coupling $\frac{\sqrt{\lambda}}{4 \pi} \sim 4$., Comment: 39 pages, 11 figures, 5 tables and a Mathematica notebook

We present our first set of results for charm physics, using the mixed-action setup introduced in a companion paper. Maximally twisted Wilson valence fermions are used on a sea of non-perturbatively $O(a)$-improved Wilson fermions, made up by CLS $N_{\mathrm{\scriptstyle f}}=2+1$ ensembles. Our charm-sector observables are free from $O(am_c)$ discretisation effects, without need of tuning any improvement coefficient, and show continuum-limit scaling properties consistent with leading cutoff effects of $O(a^2)$. We consider a subset of CLS ensembles -- including four values of the lattice spacing and pion masses down to 200 MeV -- allowing to take the continuum limit and extrapolate to the physical pion mass. A number of techniques are incorporated in the analysis in order to estimate the systematic uncertainties of our results for the charm quark mass and the $D_{(s)}$-meson decay constants. This first study of observables in the charm sector, where the emphasis has been on the control of the methodology, demonstrates the potential of our setup to achieve high-precision results., Comment: 44 pages, 21 figures

Hadronic matrix elements involving tensor currents play an important r\^ole in decays that allow to probe the consistency of the Standard Model via precision lattice QCD calculations. The non-singlet tensor current is a scale-dependent (anomalous) quantity. We fully resolve its renormalisation group (RG) running in the continuum by carrying out a recursive finite-size scaling technique. In this way ambiguities due to a perturbative RG running and matching to lattice data at low energies are eliminated. We provide the total renormalisation factor at a hadronic scale of 233 MeV, which converts the bare current into its RG-invariant form. Our calculation features three flavours of O(a) improved Wilson fermions and tree-level Symanzik-improved gauge action. We employ the (massless) Schr\"odinger functional renormalisation scheme throughout and present the first non-perturbative determination of the Symanzik counterterm $c_\mathrm{T}$ derived from an axial Ward identity. We elaborate on various details of our calculations, including two different renormalisation conditions., Comment: 39 pages, 10 figures, 11 tables

Markov Chain Monte Carlo (MCMC) algorithms are commonly used to sample from graph ensembles. Two graphs are neighbors in the state space if one can be obtained from the other with only a few modifications, e.g., edge rewirings. For many common ensembles, e.g., those preserving the degree sequences of bipartite graphs, rewiring operations involving two edges are sufficient to create a fully-connected state space, and they can be performed efficiently. We show that, for ensembles of bipartite graphs with fixed degree sequences and number of butterflies (k2,2 bi-cliques), there is no universal constant c such that a rewiring of at most c edges at every step is sufficient for any such ensemble to be fully connected. Our proof relies on an explicit construction of a family of pairs of graphs with the same degree sequences and number of butterflies, with each pair indexed by a natural c, and such that any sequence of rewiring operations transforming one graph into the other must include at least one rewiring operation involving at least c edges. Whether rewiring these many edges is sufficient to guarantee the full connectivity of the state space of any such ensemble remains an open question. Our result implies the impossibility of developing efficient, graph-agnostic, MCMC algorithms for these ensembles, as the necessity to rewire an impractically large number of edges may hinder taking a step on the state space., Comment: Accepted for publication in Physical Review E

We study a family of higher-twist Regge trajectories in $\mathcal{N}=4$ supersymmetric Yang-Mills theory using the Quantum Spectral Curve. We explore the many-sheeted Riemann surface connecting the different trajectories and show the interplay between the degenerate non-local operators known as horizontal trajectories. We resolve their degeneracy analytically by computing the first non-trivial order of the Regge intercept at weak coupling, which exhibits new behaviour: it depends linearly on the coupling. This is consistent with our numerics, which interpolate all the way to strong coupling., Comment: main text: 6 pages, 5 figures; supplemental material: 17 pages, 3 figures, 3 tables

Counterfactual examples have emerged as an effective approach to produce simple and understandable post-hoc explanations. In the context of graph classification, previous work has focused on generating counterfactual explanations by manipulating the most elementary units of a graph, i.e., removing an existing edge, or adding a non-existing one. In this paper, we claim that such language of explanation might be too fine-grained, and turn our attention to some of the main characterizing features of real-world complex networks, such as the tendency to close triangles, the existence of recurring motifs, and the organization into dense modules. We thus define a general density-based counterfactual search framework to generate instance-level counterfactual explanations for graph classifiers, which can be instantiated with different notions of dense substructures. In particular, we show two specific instantiations of this general framework: a method that searches for counterfactual graphs by opening or closing triangles, and a method driven by maximal cliques. We also discuss how the general method can be instantiated to exploit any other notion of dense substructures, including, for instance, a given taxonomy of nodes. We evaluate the effectiveness of our approaches in 7 brain network datasets and compare the counterfactual statements generated according to several widely-used metrics. Results confirm that adopting a semantic-relevant unit of change like density is essential to define versatile and interpretable counterfactual explanation methods.

Shortening quantum circuits is crucial to reducing the destructive effect of environmental decoherence and enabling useful algorithms. Here, we demonstrate an improvement in such compilation tasks via a combination of using hybrid discrete-continuous optimization across a continuous gate set, and architecture-tailored implementation. The continuous parameters are discovered with a gradient-based optimization algorithm, while in tandem the optimal gate orderings are learned via a deep reinforcement learning algorithm, based on projective simulation. To test this approach, we introduce a framework to simulate collective gates in trapped-ion systems efficiently on a classical device. The algorithm proves able to significantly reduce the size of relevant quantum circuits for trapped-ion computing. Furthermore, we show that our framework can also be applied to an experimental setup whose goal is to reproduce an unknown unitary process., Comment: 25 pages, 9 figures

We study point-to-point distance estimation in hypergraphs, where the query is parameterized by a positive integer s, which defines the required level of overlap for two hyperedges to be considered adjacent. To answer s-distance queries, we first explore an oracle based on the line graph of the given hypergraph and discuss its limitations: the main one is that the line graph is typically orders of magnitude larger than the original hypergraph. We then introduce HypED, a landmark-based oracle with a predefined size, built directly on the hypergraph, thus avoiding constructing the line graph. Our framework allows to approximately answer vertex-to-vertex, vertex-to-hyperedge, and hyperedge-to-hyperedge s-distance queries for any value of s. A key observation at the basis of our framework is that, as s increases, the hypergraph becomes more fragmented. We show how this can be exploited to improve the placement of landmarks, by identifying the s-connected components of the hypergraph. For this task, we devise an efficient algorithm based on the union-find technique and a dynamic inverted index. We experimentally evaluate HypED on several real-world hypergraphs and prove its versatility in answering s-distance queries for different values of s. Our framework allows answering such queries in fractions of a millisecond, while allowing fine-grained control of the trade-off between index size and approximation error at creation time. Finally, we prove the usefulness of the s-distance oracle in two applications, namely, hypergraph-based recommendation and the approximation of the s-closeness centrality of vertices and hyper-edges in the context of protein-to-protein interactions., Comment: To appear in VLDBJ

In this paper we conclude the program of 2012.15792 and 2105.00257 about perturbative approaches for $\mathcal{N}=2$ superconformal quiver theories in 4D. We consider several classes of observables that involve multitrace local operators and Wilson loops scattered in all the possible ways among the quiver. We evaluate them exploiting the multi-matrix model arising from supersymmetric localisation and we generalise the solution to both $SU(N)$ and $U(N)$ cases. Moreover, we provide QUICK (QUIver Correlator Kit) a Wolfram Mathematica package designed to automatise the perturbative solution of the $A_{q-1}$ multi-matrix model for all the observables mentioned above. Given the interpolating nature of the superconformal quiver theories $A_{q-1}$, the package is an efficient tool to compute correlators also in SCQCD, $\mathcal{N}=4$ SYM and its $\mathbb{Z}_q$ orbifolds. This manuscript includes a user guide and some pedagogical examples., Comment: 26 pages, 1 figure, 1 table

We present a systematic method for the derivation of a relation which connects the correlation function of operators on the straight Maldacena-Wilson line with the integrability data for the cusp anomalous dimension. As we show, the derivation requires very careful treatment of the UV divergences. Our method opens a way to derive infinitely many constraints on integrals of multi-point correlation functions, relating them with the integrability data for the generalised cusp anomalous dimension governed by the Quantum Spectral Curve. Such constraints have been shown recently to be very powerful in combination with the numerical conformal bootstrap, leading to very narrow non-perturbative bounds on conformal data beyond the spectrum., Comment: 45 pages, 6 figures, ancillary Mathematica notebook; 1 figure added and minor changes in Appendix C