BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Europe/Stockholm
X-LIC-LOCATION:Europe/Stockholm
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260421T090514Z
LOCATION:Plenary Room (Bldg. 6 - 001)
DTSTART;TZID=Europe/Stockholm:20260629T150000
DTEND;TZID=Europe/Stockholm:20260629T153000
UID:submissions.pasc-conference.org_PASC26_sess112_msa173@linklings.com
SUMMARY:Time Evolution on Hybrid Tensor Networks - A Novel Parallelizable 
 Algorithm
DESCRIPTION:Tobias Valentin Bauer (Leibniz Supercomputing Centre) and Rich
 ard Milbradt and Christian Mendl (Technical University of Munich)\n\nWe pr
 opose a novel and parallelizable hybrid quantum-classical algorithm for th
 e time evolution of a quantum state. To achieve this, we begin with the ma
 trix product state (MPS) representation of the initial state and offload i
 ts central sites to a quantum computer. This happens as soon as the classi
 cal memory requirements become prohibitively large due to growing virtual 
 bond dimensions.\nFor the remaining classical tensors, we use the Basis Up
 date and Galerkin integrator (BUG) algorithm for time evolution, whereas f
 or the quantum tensors, we can use any quantum time-evolution algorithm. T
 he algorithm does not require strict serial execution of its quantum and c
 lassical components, and we can trade off the number of qubits and the num
 ber of quantum states to be time-evolved.\n\nDomain: Chemistry and Materia
 ls, Engineering, Physics, Computational Methods and Applied Mathematics\n\
 nSession Chair: Alfio Lazzaro (HPE)\n\n
END:VEVENT
END:VCALENDAR