QCD corrections to single slepton production at hadron colliders

We evaluate the cross section for single slepton production at hadron colliders in supersymmetric theories with R-parity violating interactions to the next-to-leading order in QCD. We obtain fully differential cross section by using the phase space slicing method. We also perform soft-gluon resummation to all order in $\alpha_s$ of leading logarithm to obtain a complete transverse momentum spectrum of the slepton. We find that the full transverse momentum spectrum is peaked at a few GeV, consistent with the early results for Drell-Yan production of lepton pairs. We also consider the contribution from gluon fusion via quark-triangle loop diagrams dominated by the $b$-quark loop. The cross section of this process is significantly smaller than that of the tree-level process induced by the initial $b\bar{b}$ annihilation.Comment: one new reference is adde

Easing Embedding Learning by Comprehensive Transcription of Heterogeneous Information Networks

Heterogeneous information networks (HINs) are ubiquitous in real-world applications. In the meantime, network embedding has emerged as a convenient tool to mine and learn from networked data. As a result, it is of interest to develop HIN embedding methods. However, the heterogeneity in HINs introduces not only rich information but also potentially incompatible semantics, which poses special challenges to embedding learning in HINs. With the intention to preserve the rich yet potentially incompatible information in HIN embedding, we propose to study the problem of comprehensive transcription of heterogeneous information networks. The comprehensive transcription of HINs also provides an easy-to-use approach to unleash the power of HINs, since it requires no additional supervision, expertise, or feature engineering. To cope with the challenges in the comprehensive transcription of HINs, we propose the HEER algorithm, which embeds HINs via edge representations that are further coupled with properly-learned heterogeneous metrics. To corroborate the efficacy of HEER, we conducted experiments on two large-scale real-words datasets with an edge reconstruction task and multiple case studies. Experiment results demonstrate the effectiveness of the proposed HEER model and the utility of edge representations and heterogeneous metrics. The code and data are available at https://github.com/GentleZhu/HEER.Comment: 10 pages. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, London, United Kingdom, ACM, 201

A Note on Symplectic, Multisymplectic Scheme in Finite Element Method

We find that with uniform mesh, the numerical schemes derived from finite element method can keep a preserved symplectic structure in one-dimensional case and a preserved multisymplectic structure in two-dimentional case in certain discrete version respectively. These results are in fact the intrinsic reason that the numerical experiments indicate that such finite element algorithms are accurate in practice.Comment: 7 pages, 3 figure

Generating entanglement between microwave photons and qubits in multiple cavities coupled by a superconducting qutrit

We discuss how to generate entangled coherent states of four \textrm{microwave} resonators \textrm{(a.k.a. cavities)} coupled by a superconducting qubit. We also show \textrm{that} a GHZ state of four superconducting qubits embedded in four different resonators \textrm{can be created with this scheme}. In principle, \textrm{the proposed method} can be extended to create an entangled coherent state of $n$ resonators and to prepare a Greenberger-Horne-Zeilinger (GHZ) state of $n$ qubits distributed over $n$ cavities in a quantum network. In addition, it is noted that four resonators coupled by a coupler qubit may be used as a basic circuit block to build a two-dimensional quantum network, which is useful for scalable quantum information processing.Comment: 13 pages, 7 figure

Forced Exploration in Bandit Problems

The multi-armed bandit(MAB) is a classical sequential decision problem. Most work requires assumptions about the reward distribution (e.g., bounded), while practitioners may have difficulty obtaining information about these distributions to design models for their problems, especially in non-stationary MAB problems. This paper aims to design a multi-armed bandit algorithm that can be implemented without using information about the reward distribution while still achieving substantial regret upper bounds. To this end, we propose a novel algorithm alternating between greedy rule and forced exploration. Our method can be applied to Gaussian, Bernoulli and other subgaussian distributions, and its implementation does not require additional information. We employ a unified analysis method for different forced exploration strategies and provide problem-dependent regret upper bounds for stationary and piecewise-stationary settings. Furthermore, we compare our algorithm with popular bandit algorithms on different reward distributions