Thermal effects on bipartite and multipartite correlations in fiber coupled cavity arrays

We investigate the thermal influence of fibers on the dynamics of bipartite and multipartite correlations in fiber coupled cavity arrays where each cavity is resonantly coupled to a two-level atom. The atom-cavity systems connected by fibers can be considered as polaritonic qubits. We first derive a master equation to describe the evolution of the atom-cavity systems. The bipartite (multipartite) correlations is measured by concurrence and discord (spin squeezing). Then, we solve the master equation numerically and study the thermal effects on the concurrence, discord, and spin squeezing of qubits. On the one hand, at zero temperature, there are steady-state bipartite and multipartite correlations. One the other hand, the thermal fluctuations of a fiber may blockade the generation of entanglement of two qubits connected directly by the fiber while the discord can be generated and stored for a long time. This thermal-induced blockade effects of bipartite correlations may be useful for quantum information processing. The bipartite correlations of a longer chain of qubits is more robust than a shorter one in the presence of thermal fluctuations

Diagnosis for topological semimetals in the absence of spin-orbital coupling

Topological semimetals are under intensive theoretical and experimental studies. The first step of these studies is always the theoretical (numerical) predication of one of several candidate materials, starting from first principles. In these calculations, it is crucial that all topological band crossings, including their types and positions in the Brillouin zone, are found. While band crossings along high-symmetry lines, which are routinely scanned in numerics, are simple to locate, the ones at generic momenta are notoriously time-consuming to find, and may be easily missed. In this paper, we establish a theoretical scheme of diagnosis for topological semimetals where all band crossings are at generic momenta in systems with time-reversal symmetry and negligible spin-orbital coupling. The scheme only uses the symmetry (inversion and rotation) eigenvalues of the valence bands at high-symmetry points in the BZ as input, and provides the types, numbers and configurations of all topological band crossings, if any, at generic momenta. The nature of new diagnosis scheme allows for full automation and parallelizations, and paves way to high throughput numerical predictions of topological materials.Comment: 21 pages, 5 figures, 1 table; v4: accepted in PRX, a "PRELIMINARIES" section adde

Strong stability of Nash equilibria in load balancing games

We study strong stability of Nash equilibria in the load balancing games of m (m >= 2) identical servers, in which every job chooses one of the m servers and each job wishes to minimize its cost, given by the workload of the server it chooses. A Nash equilibrium (NE) is a strategy profile that is resilient to unilateral deviations. Finding an NE in such a game is simple. However, an NE assignment is not stable against coordinated deviations of several jobs, while a strong Nash equilibrium (SNE) is. We study how well an NE approximates an SNE. Given any job assignment in a load balancing game, the improvement ratio (IR) of a deviation of a job is defined as the ratio between the pre-and post-deviation costs. An NE is said to be a ρ-approximate SNE (ρ >= 1) if there is no coalition of jobs such that each job of the coalition will have an IR more than ρ from coordinated deviations of the coalition. While it is already known that NEs are the same as SNEs in the 2-server load balancing game, we prove that, in the m-server load balancing game for any given m >= 3, any NE is a (5=4)-approximate SNE, which together with the lower bound already established in the literature implies that the approximation bound is tight. This closes the final gap in the literature on the study of approximation of general NEs to SNEs in the load balancing games. To establish our upper bound, we apply with novelty a powerful graph-theoretic tool

Discriminative Nonparametric Latent Feature Relational Models with Data Augmentation

We present a discriminative nonparametric latent feature relational model (LFRM) for link prediction to automatically infer the dimensionality of latent features. Under the generic RegBayes (regularized Bayesian inference) framework, we handily incorporate the prediction loss with probabilistic inference of a Bayesian model; set distinct regularization parameters for different types of links to handle the imbalance issue in real networks; and unify the analysis of both the smooth logistic log-loss and the piecewise linear hinge loss. For the nonconjugate posterior inference, we present a simple Gibbs sampler via data augmentation, without making restricting assumptions as done in variational methods. We further develop an approximate sampler using stochastic gradient Langevin dynamics to handle large networks with hundreds of thousands of entities and millions of links, orders of magnitude larger than what existing LFRM models can process. Extensive studies on various real networks show promising performance.Comment: Accepted by AAAI 201