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:20260422T215007Z
UID:hep-tn/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/hep-tn/1/">R
 elativistic continuous matrix product states: new results and perspectives
 </a>\nby Antoine Tilloy (Max Planck Institute of Quantum Optics (Garching/
 Munich)) as part of Tensor Networks in High-Energy Physics\n\n\nAbstract\n
 Abstract: Relativistic CMPS are a new class of states adapted to relativis
 tic quantum field theory (QFT) in 1+1 dimensions. The originality is that 
 it requires no cutoff (UV or IR) and thus allows to get truly variational 
 results. I will explain how the ansatz works and present new (more efficie
 nt) ways to carry computations with it. With these\, the ansatz should be 
 usable for most super-renormalizable 1+1 dimensional QFTs. I will then dis
 cuss possible extensions and open problems.\n
LOCATION:https://researchseminars.org/talk/hep-tn/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Jonas Haferkamp (FU Berlin)
DTSTART:20210708T130000Z
DTEND:20210708T140000Z
DTSTAMP:20260422T215007Z
UID:hep-tn/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/hep-tn/2/">L
 inear growth of quantum circuit complexity</a>\nby Jonas Haferkamp (FU Ber
 lin) as part of Tensor Networks in High-Energy Physics\n\n\nAbstract\nTitl
 e: Linear growth of quantum circuit complexity\n\nAbstract: Quantifying qu
 antum states' complexity is a key problem in various subfields of science\
 , from quantum computing to black-hole physics. We prove a prominent conje
 cture by Brown and Susskind about how random quantum circuits' complexity 
 increases. Consider constructing a unitary from Haar-random two-qubit quan
 tum gates. Implementing the unitary exactly requires a circuit of some min
 imal number of gates - the unitary's exact circuit complexity. We prove th
 at this complexity grows linearly in the number of random gates\, with uni
 t probability\, until saturating after exponentially many random gates. Ou
 r proof is surprisingly short\, given the established difficulty of lower-
 bounding the exact circuit complexity. Our strategy combines differential 
 topology and elementary algebraic geometry with an inductive construction 
 of Clifford circuits.\n\nZoom link: https://mpi-aei.zoom.us/j/93184951966\
 n
LOCATION:https://researchseminars.org/talk/hep-tn/2/
END:VEVENT
END:VCALENDAR