More Like this

1. The Weak Gravity Conjecture and BPS Particles

   https://doi.org/10.1002/prop.202100125  

   Alim, Murad ; Heidenreich, Ben ; Rudelius, Tom ( September 2021 , Fortschritte der Physik)

   Motivated by the Weak Gravity Conjecture, we uncover an intricate interplay between black holes, BPS particle counting, and Calabi‐Yau geometry in five dimensions. In particular, we point out that extremal BPS black holes exist only in certain directions in the charge lattice, and we argue that these directions fill out a cone that is dual to the cone of effective divisors of the Calabi‐Yau threefold. The tower and sublattice versions of the Weak Gravity Conjecture require an infinite tower of BPS particles in these directions, and therefore imply purely geometric conjectures requiring the existence of infinite towers of holomorphic curves in every direction within the dual of the cone of effective divisors. We verify these geometric conjectures in a number of examples by computing Gopakumar‐Vafa invariants.
2. The Scale of Supersymmetry Breaking and the Dark Dimension

   https://doi.org/10.1007/JHEP05(2023)060  

   Anchordoqui, Luis A. ; Antoniadis, Ignatios ; Cribiori, Niccolò ; Lüst, Dieter ; Scalisi, Marco ( May 2023 , Journal of High Energy Physics)

   A bstract We argue for a relation between the supersymmetry breaking scale and the measured value of the dark energy density Λ. We derive it by combining two quantum gravity consistency swampland constraints, which tie the dark energy density Λ and the gravitino mass M 3 / 2 , respectively, to the mass scale of a light Kaluza-Klein tower and, therefore, to the UV cut-off of the effective theory. Whereas the constraint on Λ has recently led to the Dark Dimension scenario, with a prediction of a single mesoscopic extra dimension of the micron size, we use the constraint on M 3 / 2 to infer the implications of such a scenario for the scale of supersymmetry breaking. We find that a natural scale for supersymmetry signatures is $$ M=\mathcal{O}\left({\Lambda}^{\frac{1}{8}}\right)=\mathcal{O}\left(\textrm{TeV}\right). $$ M = O Λ 1 8 = O TeV . This mass scale is within reach of LHC and of the next generation of hadron colliders. Finally, we discuss possible string theory and effective supergravity realizations of the Dark Dimension scenario with broken supersymmetry.
3. A CFT distance conjecture

   https://doi.org/10.1007/JHEP10(2021)070  

   Perlmutter, Eric ; Rastelli, Leonardo ; Vafa, Cumrun ; Valenzuela, Irene ( October 2021 , Journal of High Energy Physics)

   A bstract We formulate a series of conjectures relating the geometry of conformal manifolds to the spectrum of local operators in conformal field theories in d > 2 spacetime dimensions. We focus on conformal manifolds with limiting points at infinite distance with respect to the Zamolodchikov metric. Our central conjecture is that all theories at infinite distance possess an emergent higher-spin symmetry, generated by an infinite tower of currents whose anomalous dimensions vanish exponentially in the distance. Stated geometrically, the diameter of a non-compact conformal manifold must diverge logarithmically in the higher-spin gap. In the holographic context our conjectures are related to the Distance Conjecture in the swampland program. Interpreted gravitationally, they imply that approaching infinite distance in moduli space at fixed AdS radius, a tower of higher-spin fields becomes massless at an exponential rate that is bounded from below in Planck units. We discuss further implications for conformal manifolds of superconformal field theories in three and four dimensions.
4. Trans-Planckian Censorship and the Swampland

   Bedroya, Alek ; Vafa, Cumrun ( September 2019 , ArXivorg)

   In this paper, we propose a new Swampland condition, the Trans-Planckian Censorship Conjecture (TCC), based on the idea that in a consistent quantum theory of gravity sub-Planckian quantum fluctuations should remain quantum and never become larger than the Hubble horizon and freeze in an expanding universe. Applied to the case of scalar fields, it leads to conditions that are similar to the refined dS Swampland conjecture. For large field ranges, TCC is stronger than the dS Swampland conjecture but it is weaker for small field ranges. In particular for asymptotic regions of field space, TCC leads to a bound |V′|≥2(d−1)(d−2)√V, which is consistent with all known cases in string theory. Like the dS Swampland conjecture, the TCC forbids long-lived meta-stable dS spaces, but it does allow sufficiently short-lived ones.
5. Approximate Unitary t-Designs by Short Random Quantum Circuits Using Nearest-Neighbor and Long-Range Gates

   https://doi.org/10.1007/s00220-023-04675-z  

   Harrow, Aram W. ; Mehraban, Saeed ( May 2023 , Communications in Mathematical Physics)

   We prove that$${{\,\textrm{poly}\,}}(t) \cdot n^{1/D}$$$\text{poly}\left(t\right)·n^{1/D}$-depth local random quantum circuits with two qudit nearest-neighbor gates on aD-dimensional lattice withnqudits are approximatet-designs in various measures. These include the “monomial” measure, meaning that the monomials of a random circuit from this family have expectation close to the value that would result from the Haar measure. Previously, the best bound was$${{\,\textrm{poly}\,}}(t)\cdot n$$$\text{poly}\left(t\right)·n$due to Brandão–Harrow–Horodecki (Commun Math Phys 346(2):397–434, 2016) for$$D=1$$$D=1$. We also improve the “scrambling” and “decoupling” bounds for spatially local random circuits due to Brown and Fawzi (Scrambling speed of random quantum circuits, 2012). One consequence of our result is that assuming the polynomial hierarchy ($${{\,\mathrm{\textsf{PH}}\,}}$$$\mathrm{PH}$) is infinite and that certain counting problems are$$\#{\textsf{P}}$$$\#P$-hard “on average”, sampling within total variation distance from these circuits is hard for classical computers. Previously, exact sampling from the outputs of even constant-depth quantum circuits was known to be hard for classical computers under these assumptions. However the standard strategy for extending this hardness result to approximate sampling requires the quantum circuits to have a property called “anti-concentration”, meaning roughly that the output has near-maximal entropy. Unitary 2-designs have the desired anti-concentration property. Our result improves the required depth for this level of anti-concentration from linear depthmore »to a sub-linear value, depending on the geometry of the interactions. This is relevant to a recent experiment by the Google Quantum AI group to perform such a sampling task with 53 qubits on a two-dimensional lattice (Arute in Nature 574(7779):505–510, 2019; Boixo et al. in Nate Phys 14(6):595–600, 2018) (and related experiments by USTC), and confirms their conjecture that$$O(\sqrt{n})$$$O\left(\sqrt{n}\right)$depth suffices for anti-concentration. The proof is based on a previous construction oft-designs by Brandão et al. (2016), an analysis of how approximate designs behave under composition, and an extension of the quasi-orthogonality of permutation operators developed by Brandão et al. (2016). Different versions of the approximate design condition correspond to different norms, and part of our contribution is to introduce the norm corresponding to anti-concentration and to establish equivalence between these various norms for low-depth circuits. For random circuits with long-range gates, we use different methods to show that anti-concentration happens at circuit size$$O(n\ln ^2 n)$$$O\left(n{ln}^{2}n\right)$corresponding to depth$$O(\ln ^3 n)$$$O\left({ln}^{3}n\right)$. We also show a lower bound of$$\Omega (n \ln n)$$$\Omega (nlnn)$for the size of such circuit in this case. We also prove that anti-concentration is possible in depth$$O(\ln n \ln \ln n)$$$O(lnnlnlnn)$(size$$O(n \ln n \ln \ln n)$$$O(nlnnlnlnn)$) using a different model.

   « less