BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Antoine Tilloy (Max Planck Institute of Quantum Optics (Garching/M
 unich))
DTSTART:20210520T130000Z
DTEND:20210520T140000Z
DTSTAMP:20260404T111333Z
UID:hep-tn/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/hep-t
 n/1/">Relativistic continuous matrix product states: new results and persp
 ectives</a>\nby Antoine Tilloy (Max Planck Institute of Quantum Optics (Ga
 rching/Munich)) as part of Tensor Networks in High-Energy Physics\n\n\nAbs
 tract\nAbstract: Relativistic CMPS are a new class of states adapted to re
 lativistic quantum field theory (QFT) in 1+1 dimensions. The originality i
 s that it requires no cutoff (UV or IR) and thus allows to get truly varia
 tional results. I will explain how the ansatz works and present new (more 
 efficient) ways to carry computations with it. With these\, the ansatz sho
 uld be usable for most super-renormalizable 1+1 dimensional QFTs. I will t
 hen discuss possible extensions and open problems.\n
LOCATION:https://stable.researchseminars.org/talk/hep-tn/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jonas Haferkamp (FU Berlin)
DTSTART:20210708T130000Z
DTEND:20210708T140000Z
DTSTAMP:20260404T111333Z
UID:hep-tn/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/hep-t
 n/2/">Linear growth of quantum circuit complexity</a>\nby Jonas Haferkamp 
 (FU Berlin) as part of Tensor Networks in High-Energy Physics\n\n\nAbstrac
 t\nTitle: Linear growth of quantum circuit complexity\n\nAbstract: Quantif
 ying quantum states' complexity is a key problem in various subfields of s
 cience\, from quantum computing to black-hole physics. We prove a prominen
 t conjecture by Brown and Susskind about how random quantum circuits' comp
 lexity increases. Consider constructing a unitary from Haar-random two-qub
 it quantum gates. Implementing the unitary exactly requires a circuit of s
 ome minimal number of gates - the unitary's exact circuit complexity. We p
 rove that this complexity grows linearly in the number of random gates\, w
 ith unit probability\, until saturating after exponentially many random ga
 tes. Our proof is surprisingly short\, given the established difficulty of
  lower-bounding the exact circuit complexity. Our strategy combines differ
 ential topology and elementary algebraic geometry with an inductive constr
 uction of Clifford circuits.\n\nZoom link: https://mpi-aei.zoom.us/j/93184
 951966\n
LOCATION:https://stable.researchseminars.org/talk/hep-tn/2/
END:VEVENT
END:VCALENDAR