skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Reggeon field theory and self duality: making ends meet
A bstract Motivated by the question of unitarity of Reggeon Field Theory, we use the effective field theory philosophy to find possible Reggeon Field Theory Hamiltonians H RFT . We require that H RFT is self dual, reproduce all known limits (dilute-dense and dilute-dilute) and exhibits all the symmetries of the JIMWLK Hamiltonian. We find a family of Hamiltonians which satisfy all the above requirements. One of these is identical in form to the so called “diamond action” discussed in [67, 68]. However we show by explicit calculation that the so called “diamond condition” is not satisfied beyond leading perturbative order.  more » « less
Award ID(s):
1913890
PAR ID:
10275992
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
Journal of High Energy Physics
Volume:
2020
Issue:
10
ISSN:
1029-8479
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    A bstract Further developing ideas set forth in [1], we discuss QCD Reggeon Field Theory (RFT) and formulate restrictions imposed on its Hamiltonian by the unitarity of underlying QCD. We identify explicitly the QCD RFT Hilbert space, provide algebra of the basic degrees of freedom (Wilson lines and their duals) and the algorithm for calculating the scattering amplitudes. We formulate conditions imposed on the “Fock states” of RFT by unitary nature of QCD, and explain how these constraints appear as unitarity constraints on possible RFT hamiltonians that generate energy evolution of scattering amplitudes. We study the realization of these constraints in the dense-dilute limit of RFT where the appropriate Hamiltonian is the JIMWLK Hamiltonian H JIMWLK . We find that the action H JIMWLK on the dilute projectile states is unitary, but acting on dense “target” states it violates unitarity and generates states with negative probabilities through energy evolution. 
    more » « less
  2. While terrestrial locomotors often contend with permanently deformable substrates like sand, soil, and mud, principles of motion on such materials are lacking. We study the desert-specialist shovel-nosed snake traversing a model sand and find body inertia is negligible despite rapid transit and speed dependent granular reaction forces. New surface resistive force theory (RFT) calculation reveals how wave shape in these snakes minimizes material memory effects and optimizes escape performance given physiological power limitations. RFT explains the morphology and waveform-dependent performance of a diversity of non-sand-specialist snakes but overestimates the capability of those snakes which suffer high lateral slipping of the body. Robophysical experiments recapitulate aspects of these failure-prone snakes and elucidate how re-encountering previously deformed material hinders performance. This study reveals how memory effects stymied the locomotion of a diversity of snakes in our previous studies (Marvi et al., 2014) and indicates avenues to improve all-terrain robots. 
    more » « less
  3. Color-center–hosting semiconductors are emerging as promising source materials for low-field dynamic nuclear polarization (DNP) at or near room temperature, but hyperfine broadening, susceptibility to magnetic field heterogeneity, and nuclear spin relaxation induced by other paramagnetic defects set practical constraints difficult to circumvent. Here, we explore an alternate route to color-center–assisted DNP using nitrogen-vacancy (NV) centers in diamond coupled to substitutional nitrogen impurities, the so-called P1 centers. Working near the level anticrossing condition—where the P1 Zeeman splitting matches one of the NV spin transitions—we demonstrate efficient microwave-free 13 C DNP through the use of consecutive magnetic field sweeps and continuous optical excitation. The amplitude and sign of the polarization can be controlled by adjusting the low-to-high and high-to-low magnetic field sweep rates in each cycle so that one is much faster than the other. By comparing the 13 C DNP response for different crystal orientations, we show that the process is robust to magnetic field/NV misalignment, a feature that makes the present technique suitable to diamond powders and settings where the field is heterogeneous. Applications to shallow NVs could capitalize on the greater physical proximity between surface paramagnetic defects and outer nuclei to efficiently polarize target samples in contact with the diamond crystal. 
    more » « less
  4. The NLTS (No Low-Energy Trivial State) conjecture [M. H. Freedman and M. B. Hastings, Quantum Inf. Comput. 14, 144 (2014)] posits that there exist families of Hamiltonians with all low energy states of high complexity (with complexity measured by the quantum circuit depth preparing the state). Here, we prove a weaker version called the combinatorial no low error trivial states (NLETS), where a quantum circuit lower bound is shown against states that violate a (small) constant fraction of local terms. This generalizes the prior NLETS results [L. Eldar and A. W. Harrow, in 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (IEEE, 2017), pp. 427–438] and [Nirkhe et al., in 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Leibniz International Proceedings in Informatics (LIPIcs), edited by Chatzigiannakis et al. (Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 2018), Vol. 107, pp. 1–11]. Our construction is obtained by combining tensor networks with expander codes [M. Sipser and D. Spielman, IEEE Trans. Inf. Theory 42, 1710 (1996)]. The Hamiltonian is the parent Hamiltonian of a perturbed tensor network, inspired by the “uncle Hamiltonian” of Fernández-González et al. [Commun. Math. Phys. 333, 299 (2015)]. Thus, we deviate from the quantum Calderbank-Shor-Steane (CSS) code Hamiltonians considered in most prior works. 
    more » « less
  5. A hole in a graph $$G$$ is an induced cycle of length at least four, and an even hole is a hole of even length. The diamond is the graph obtained from the complete graph $$K_4$$ by removing an edge. A pyramid is a graph consisting of a vertex $$a$$ called the apex and a triangle $$\{b_1, b_2, b_3\}$$ called the base, and three paths $$P_i$$ from $$a$$ to $$b_i$$ for $$1 \leq i \leq 3$$, all of length at least one, such that for $$i \neq j$$, the only edge between $$P_i \setminus \{a\}$$ and $$P_j \setminus \{a\}$$ is $$b_ib_j$$, and at most one of $$P_1$$, $$P_2$$, and $$P_3$$ has length exactly one. For a family $$\mathcal{H}$$ of graphs, we say a graph $$G$$ is $$\mathcal{H}$$-free if no induced subgraph of $$G$$ is isomorphic to a member of $$\mathcal{H}$$. Cameron, da Silva, Huang, and Vušković proved that (even hole, triangle)-free graphs have treewidth at most five, which motivates studying the treewidth of even-hole-free graphs of larger clique number. Sintiari and Trotignon provided a construction of (even hole, pyramid, $$K_4$$)-free graphs of arbitrarily large treewidth. Here, we show that for every $$t$$, (even hole, pyramid, diamond, $$K_t$$)-free graphs have bounded treewidth. The graphs constructed by Sintiari and Trotignon contain diamonds, so our result is sharp in the sense that it is false if we do not exclude diamonds. Our main result is in fact more general, that treewidth is bounded in graphs excluding certain wheels and three-path-configurations, diamonds, and a fixed complete graph. The proof uses “non-crossing decompositions” methods similar to those in previous papers in this series. In previous papers, however, bounded degree was a necessary condition to prove bounded treewidth. The result of this paper is the first to use the method of “non-crossing decompositions” to prove bounded treewidth in a graph class of unbounded maximum degree. 
    more » « less