708,908 research outputs found

    About the stability of a D4 - anti D 4 system

    Get PDF
    We study a system of coincident D4D4 and Dˉ4\bar D 4 branes with non zero world-volume magnetic fields in the weak coupling limit. We show that the conditions for absence of tachyons in the spectrum coincide exactly with those found in hep-th/0206041, in the low energy effective theory approach, for the system to preserve a 14\frac 14 of the supersymmetries of the Type IIA string theory vacuum. We present further evidence about the stability of the system by computing the lowest order interaction amplitude from both open and closed channels, thus verifying the no force condition as well as the supersymmetric character of the spectrum. A brief discussion of the low energy effective five dimensional world-volume theory is given.Comment: 37 pages, latex file, no figures, heavy changes in language all along the paper, references added; to appear in Nuclear Physics

    Monotone Projection Lower Bounds from Extended Formulation Lower Bounds

    Get PDF
    In this short note, we reduce lower bounds on monotone projections of polynomials to lower bounds on extended formulations of polytopes. Applying our reduction to the seminal extended formulation lower bounds of Fiorini, Massar, Pokutta, Tiwari, & de Wolf (STOC 2012; J. ACM, 2015) and Rothvoss (STOC 2014; J. ACM, 2017), we obtain the following interesting consequences. 1. The Hamiltonian Cycle polynomial is not a monotone subexponential-size projection of the permanent; this both rules out a natural attempt at a monotone lower bound on the Boolean permanent, and shows that the permanent is not complete for non-negative polynomials in VNPR_{{\mathbb R}} under monotone p-projections. 2. The cut polynomials and the perfect matching polynomial (or "unsigned Pfaffian") are not monotone p-projections of the permanent. The latter, over the Boolean and-or semi-ring, rules out monotone reductions in one of the natural approaches to reducing perfect matchings in general graphs to perfect matchings in bipartite graphs. As the permanent is universal for monotone formulas, these results also imply exponential lower bounds on the monotone formula size and monotone circuit size of these polynomials.Comment: Published in Theory of Computing, Volume 13 (2017), Article 18; Received: November 10, 2015, Revised: July 27, 2016, Published: December 22, 201

    The Power of Unentanglement

    Get PDF
    The class QMA(k). introduced by Kobayashi et al., consists of all languages that can be verified using k unentangled quantum proofs. Many of the simplest questions about this class have remained embarrassingly open: for example, can we give any evidence that k quantum proofs are more powerful than one? Does QMA(k) = QMA(2) for k ≥ 2? Can QMA(k) protocols be amplified to exponentially small error? In this paper, we make progress on all of the above questions. * We give a protocol by which a verifier can be convinced that a 3SAT formula of size m is satisfiable, with constant soundness, given Õ (√m) unentangled quantum witnesses with O(log m) qubits each. Our protocol relies on the existence of very short PCPs. * We show that assuming a weak version of the Additivity Conjecture from quantum information theory, any QMA(2) protocol can be amplified to exponentially small error, and QMA(k) = QMA(2) for all k ≥ 2. * We prove the nonexistence of "perfect disentanglers" for simulating multiple Merlins with one
    corecore