<node id="663412">
  <nid>663412</nid>
  <type>event</type>
  <uid>
    <user id="27707"><![CDATA[27707]]></user>
  </uid>
  <created>1669142388</created>
  <changed>1669142388</changed>
  <title><![CDATA[PhD Defense by Wangwei Lan]]></title>
  <body><![CDATA[<p><strong>School of Physics Thesis Dissertation Defense</strong></p>

<p>&nbsp;</p>

<p><strong>Presenter</strong>:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Wangwei Lan</p>

<p><strong>Title</strong>:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; More efficient contraction algorithms for 2D tensor networks</p>

<p><strong>Date/Time</strong>:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Monday, November 28, 2022 at 1:00 p.m.</p>

<p><strong>Location</strong>:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Howey N201/202</p>

<p><strong>Virtual Link</strong>:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; <a href="https://gatech.zoom.us/j/2500120410?pwd=RXFXMWFBeGl2RHBqWlRsL25uVitZZz09">https://gatech.zoom.us/j/2500120410?pwd=RXFXMWFBeGl2RHBqWlRsL25uVitZZz09</a></p>

<p>Meeting ID: 250 012 0410 / Passcode: 765708</p>

<p>&nbsp;</p>

<p><strong>Committee</strong>:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; Dr. Glen Evenbly, School of Physics, Georgia Institute of Technology (Advisor)</p>

<p>Dr. Zhigang Jiang, School of Physics, Georgia Institute of Technology</p>

<p>Dr. Martin Mourigal, School of Physics, Georgia Institute of Technology</p>

<p>Dr. Dragomir Davidovic, School of Physics, Georgia Institute of Technology</p>

<p>Dr. Spencer Bryngelson, School of Computational Science and Engineering, Georgia Institute of Technology</p>

<p>&nbsp;</p>

<p><strong>Abstract</strong>:</p>

<p>Tensor network algorithms are important numerical tools for studying quantum many-body</p>

<p>problems. However, the high computational costs have prevented its applications in two-</p>

<p>dimensional (2D) systems. In this thesis, we discussed our work on more efficient con-</p>

<p>tractions of 2D tensor networks. In particular, for 2D statistical mechanics, we propose</p>

<p>a modified form of a tensor renormalization group algorithm for evaluating partition func-</p>

<p>tions of classical statistical mechanical models on 2D lattices. This algorithm coarse-grains</p>

<p>only the rows and columns of the lattice adjacent to a single core tensor at each step, such</p>

<p>that the lattice size shrinks linearly with the number of coarse-graining steps as opposed</p>

<p>to shrinking exponentially as in the usual tensor renormalization group (TRG). However,</p>

<p>the cost of this new approach only scales as O(&chi;4) in terms of the bond dimension &chi;, sig-</p>

<p>nificantly cheaper than the O(&chi;6) cost scaling of TRG, whereas numerical benchmarking</p>

<p>indicates that both approaches have comparable accuracy for the same bond dimension &chi;.</p>

<p>In 2D quantum mechanics, we propose a pair of approximations that allows the leading</p>

<p>order computational cost of contracting an infinite projected entangled-pair state (iPEPS)</p>

<p>to be reduced from O(&chi;3D6) to O(&chi;3D3) when using a corner-transfer approach. The first</p>

<p>approximation involves (i) reducing the environment needed for truncation of the bound-</p>

<p>ary tensors (ii) relies on the sequential contraction and truncation of bra and ket indices,</p>

<p>rather than doing both together as with the established algorithm. Our benchmark results</p>

<p>are comparable to the standard iPEPS algorithm. The improvement in computational cost</p>

<p>enables us to perform large bond dimension calculations, extending its potential to solve</p>

<p>challenging problems.</p>

<p>&nbsp;</p>
]]></body>
  <field_summary_sentence>
    <item>
      <value><![CDATA[More efficient contraction algorithms for 2D tensor networks]]></value>
    </item>
  </field_summary_sentence>
  <field_summary>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_summary>
  <field_time>
    <item>
      <value><![CDATA[2022-11-28T13:00:00-05:00]]></value>
      <value2><![CDATA[2022-11-28T15:00:00-05:00]]></value2>
      <rrule><![CDATA[]]></rrule>
      <timezone><![CDATA[America/New_York]]></timezone>
    </item>
  </field_time>
  <field_fee>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_fee>
  <field_extras>
      </field_extras>
  <field_audience>
          <item>
        <value><![CDATA[Faculty/Staff]]></value>
      </item>
          <item>
        <value><![CDATA[Public]]></value>
      </item>
          <item>
        <value><![CDATA[Undergraduate students]]></value>
      </item>
      </field_audience>
  <field_media>
      </field_media>
  <field_contact>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_contact>
  <field_location>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_location>
  <field_sidebar>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_sidebar>
  <field_phone>
    <item>
      <value><![CDATA[]]></value>
    </item>
  </field_phone>
  <field_url>
    <item>
      <url><![CDATA[]]></url>
      <title><![CDATA[]]></title>
            <attributes><![CDATA[]]></attributes>
    </item>
  </field_url>
  <field_email>
    <item>
      <email><![CDATA[]]></email>
    </item>
  </field_email>
  <field_boilerplate>
    <item>
      <nid><![CDATA[]]></nid>
    </item>
  </field_boilerplate>
  <links_related>
      </links_related>
  <files>
      </files>
  <og_groups>
          <item>221981</item>
      </og_groups>
  <og_groups_both>
          <item><![CDATA[Graduate Studies]]></item>
      </og_groups_both>
  <field_categories>
          <item>
        <tid>1788</tid>
        <value><![CDATA[Other/Miscellaneous]]></value>
      </item>
      </field_categories>
  <field_keywords>
          <item>
        <tid>100811</tid>
        <value><![CDATA[Phd Defense]]></value>
      </item>
      </field_keywords>
  <field_userdata><![CDATA[]]></field_userdata>
</node>
