BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:715@lincs.fr
DTSTART;TZID=Europe/Paris:20221026T150000
DTEND;TZID=Europe/Paris:20221026T160000
DTSTAMP:20221102T100234Z
URL:https://www.lincs.fr/events/work-memory-requirements-in-error-suscepti
 ble-quantum-networks/
SUMMARY:Work Memory Requirements in Error Susceptible Quantum Networks
DESCRIPTION:We consider the problem of path congestion avoidance in
 networks of quantum repeaters and terminals. In other words\, the avoidance
 of situations when demands exceed capacity. We assume networks in which the
 sets of complete paths between terminals may affect the capacity of
 repeaters in the network. We compare the reduction of congestion avoidance
 of path establishment algorithms: shortest-path establishment vs.
 layer-peeling path establishment. We observe that both strategies provide
 an equivalent entanglement rate\, while the layer-peeling establishment
 algorithm considerably reduces the congestion in the network of repeaters.
 Repeaters in the inner layers get less congested and require a lower number
 of qubits while providing a similar entanglement rate.\n\n&nbsp\;\n\nMichel
 Barbeau\,\nProfessor and Director\nSchool of Computer Science\nCarleton
 University\, Ottawa\, Canada
CATEGORIES:Seminars,Youtube
LOCATION:Room 4A467 - Telecom Paris\, 19 place marguerite perey\,
 Palaiseau\, 91120\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=19 place marguerite perey\,
 Palaiseau\, 91120\, France;X-APPLE-RADIUS=100;X-TITLE=Room 4A467 - Telecom
 Paris:geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20220327T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR