BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//pretalx//pretalx.com//juliacon-2026//talk//M3HL7P
BEGIN:VTIMEZONE
TZID:CET
BEGIN:STANDARD
DTSTART:20001029T040000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20000326T030000
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:pretalx-juliacon-2026-M3HL7P@pretalx.com
DTSTART;TZID=CET:20260814T114500
DTEND;TZID=CET:20260814T121500
DESCRIPTION:We investigate the problem of partitioning graph states for dis
 tributed quantum computing. Graph states are a way of representing certain
  quantum entangled states as graphs. Due to the nature of entanglement\, i
 t's far better to partition graphs to minimize the size of the maximum mat
 chings between partitions rather than the number of edges\, as traditional
  algorithms do. We provide an algorithm for this in our Julia software pac
 kage for graph state partitioning evaluation\, QuantumHamlets.jl.
DTSTAMP:20260502T113842Z
LOCATION:Room 3
SUMMARY:Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph
  States - Anthony Micciche
URL:https://pretalx.com/juliacon-2026/talk/M3HL7P/
END:VEVENT
END:VCALENDAR