BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Anthony Munson (University of Maryland)
DTSTART:20220329T193000Z
DTEND:20220329T203000Z
DTSTAMP:20260423T004825Z
UID:HET/32
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/HET/32/">Qua
 ntum (Un)complexity: A Resource for Quantum Computation</a>\nby Anthony Mu
 nson (University of Maryland) as part of Purdue HET\n\n\nAbstract\nUnder r
 andom dynamics\, a system’s quantum complexity—which quantifies the di
 fficulty of preparing a desired state from a simple\, tensor-product state
 —increases linearly up to times exponential in the system’s size\, lon
 g after most physical observables have thermalized. The observation that c
 omplexity saturation is a late stage of quantum thermalization suggests th
 at a state’s lack of complexity\, or ``uncomplexity\,'' is a useful reso
 urce for quantum computation: Much as a system far from thermal equilibriu
 m can serve as a resource in information-processing tasks\, a state with h
 igh uncomplexity—i.e.\, a low-complexity state such as |0^n>—can be ut
 ilized as ``blank scrap paper'' for quantum computers. It is natural\, the
 refore\, to view uncomplexity through the lens of a resource theory. In a 
 resource theory\, an agent can perform any operation subject to a fixed se
 t of simple rules\, and can identify which tasks are achievable under thes
 e rules and which tasks require additional resources. We define a resource
  theory of uncomplexity\, and then construct protocols in the resource the
 ory for extracting uncomplexity from a state and for expending uncomplexit
 y to imitate a state. Moreover\, we show that a new quantity\, the complex
 ity entropy\, quantifies the efficiencies with which we can perform uncomp
 lexity extraction and expenditure\, and thereby quantifies the resource re
 quirements for one-shot thermodynamic erasure (Landauer erasure) under com
 putational limitations.\n\nYunger Halpern\, Kothakonda\, Haferkamp\, Munso
 n\, Eisert\, and Faist (2021). https://arxiv.org/abs/2110.11371\n
LOCATION:https://researchseminars.org/talk/HET/32/
END:VEVENT
END:VCALENDAR
