BEGIN:VCALENDAR
METHOD:PUBLISH
PRODID:Microsoft Exchange Server 2010
VERSION:2.0
X-WR-CALNAME:The ZX Seminar
BEGIN:VTIMEZONE
TZID:W. Europe Standard Time
BEGIN:STANDARD
DTSTART:16010101T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=10
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:16010101T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;INTERVAL=1;BYDAY=-1SU;BYMONTH=3
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
DESCRIPTION:Speaker: Alejandro Villoria<https://scholar.google.com/citation
 s?user=BOndx-IAAAAJ&hl=en>\narXiv: https://arxiv.org/pdf/2507.20694\nZoom 
 link: https://uva-live.zoom.us/j/62656414005\nAbstract: Compiling quantum 
 circuits to account for hardware restrictions is an essential part of the 
 quantum computing stack. Circuit compilation allows us to adapt algorithm 
 descriptions into a sequence of operations supported by real quantum hardw
 are\, and has the potential to significantly improve their performance whe
 n optimization techniques are added to the process. One such optimization 
 technique is reducing the number of quantum gates that are needed to execu
 te a circuit. For instance\, methods for reducing the number of non-Cliffo
 rd gates or CNOT gates from a circuit is an extensive research area that h
 as gathered significant interest over the years. For certain hardware plat
 forms such as ion trap quantum computers\, we can leverage some of their s
 pecial properties to further reduce the cost of executing a quantum circui
 t in them. In this work we use global interactions\, such as the Global M
 ølmer-Sørensen gate present in ion trap hardware\, to optimize and synth
 esize quantum circuits. We design and implement an algorithm that is able 
 to compile an arbitrary quantum circuit into another circuit that uses glo
 bal gates as the entangling operation\, while optimizing the number of glo
 bal interactions needed. The algorithm is based on the ZX-calculus and use
 s a specialized circuit extraction routine that groups entangling gates in
 to Global Mølmer-Sørensen gates. We benchmark the algorithm in a variety
  of circuits\, and show how it improves their performance under state-of-t
 heart hardware considerations in comparison to a naive algorithm and the Q
 iskit optimizer.\nJoint-Work With: Henning Basold and Alfons Laarman\n
UID:040000008200E00074C5B7101A82E00800000000D2BA01FC8A29DC01000000000000000
 01000000081DB8AF6DCA0024CBBFE49AFAAA016A5
SUMMARY:Optimization and Synthesis of Quantum Circuits with Global Gates
DTSTART;TZID=W. Europe Standard Time:20251117T150000
DTEND;TZID=W. Europe Standard Time:20251117T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/62656414005
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Collin (Yuanjie) Ren\narXiv: https://arxiv.org/pdf/250
 8.03976\nZoom link: https://uva-live.zoom.us/j/62656414005\nAbstract: We i
 ntroduce a graphical calculus\, consisting of a set of fermionic tensors w
 ith tensor-network equations\, which can be used to perform various comput
 ations in fermionic many-body physics purely diagrammatically. The indices
  of our tensors primarily correspond to fermionic modes\, but also include
  qubits and fixed odd-parity states. Our graphical calculus extends the ZX
  calculus for systems involving qubits. We apply the calculus in order to 
 represent various objects\, operations\, and computations in physics\, inc
 luding fermionic Gaussian states\, the partial trace of Majorana modes\, p
 urification protocols\, fermionization and bosonization maps\, and the con
 struction of fermionic codes.\nJoint-Work With: Kaifeng Bu and Andreas Bau
 er\n\n\nSent from Outlook for Mac\n
UID:040000008200E00074C5B7101A82E008000000004F560B0F8629DC01000000000000000
 0100000002403D9CD70D98C4B85A3E7E5771D2122
SUMMARY:Graphical Calculus for Fermionic Tensors
DTSTART;TZID=W. Europe Standard Time:20251124T150000
DTEND;TZID=W. Europe Standard Time:20251124T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/62656414005
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Ewan Murphy\n\nZoom link: https://uva-live.zoom.us/j/6
 2656414005\n\nAbstract: Clifford circuits are a subset of all possible qua
 ntum circuits that are known to be simulable on a classical computer in po
 lynomial time. These circuits form the backbone of most modern quantum err
 or-correction protocols. To understand the performance of these protocols\
 , we perform numerical simulations of such circuits under specific noise m
 odels.\n\nThe software used by almost all researchers in quantum error cor
 rection to perform these simulations is called Stim\, a Python library dev
 eloped by Craig Gidney\, a researcher at Google Quantum AI. In this tutori
 al I will provide an introduction to Stim\, discussing some of its main fe
 atures and how to use them. I will show you how to simulate an arbitrary C
 lifford circuit\, as well as how to find the threshold of an error-correct
 ing code. A brief understanding of quantum error correction will be helpfu
 l\, but I will try to explain any new concepts as they appear. At the end\
 , I will provide references for useful resources for anyone who wants to l
 earn more about how to use this tool in research.\n\n\nSent from Outlook f
 or Mac\n
UID:040000008200E00074C5B7101A82E00800000000F919FA6C8529DC01000000000000000
 0100000005CD5AA05A1B7E647887D9F2749622221
SUMMARY:Stim 101: Quantum Stabilizer Simulation Made Simple
DTSTART;TZID=W. Europe Standard Time:20251201T150000
DTEND;TZID=W. Europe Standard Time:20251201T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:3
LOCATION:https://uva-live.zoom.us/j/62656414005
X-MICROSOFT-CDO-APPT-SEQUENCE:3
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Daniel Litinski<https://scholar.google.com/citations?u
 ser=YHa5yKYAAAAJ&hl=de>\n\narXiv: https://arxiv.org/pdf/2506.13619\nZoom l
 ink: https://uva-live.zoom.us/j/62656414005\nAbstract: We introduce a cons
 truction for protocols for fault-tolerant quantum computing based on code 
 concatenation and transversal gates. These protocols can be interpreted as
  families of quantum circuits of low-weight stabilizer measurements withou
 t strict locality constraints\, effectively implementing concatenated code
 s. However\, we primarily study these protocols in the context of photonic
  fusion-based quantum computing (FBQC)\, where they yield families of fusi
 on networks with constant-sized resource states. Their high erasure thresh
 olds relative to their resource-state cost establish them as promising can
 didates to replace surface codes in the context of FBQC. Examples include 
 protocol families using 8-\, 10- and 12-qubit resource states\, with erasu
 re thresholds of 13.8%\, 19.1% and 11.5%\, and footprint-per-logical-qubit
  scaling as O(d)\, O(d^1.46) and O(d^0.58)\, respectively\, where d is the
  code distance. We also present techniques for performing logical operatio
 ns\, decoding\, and implementing the protocols in photonic hardware. Altho
 ugh we focus on photonic FBQC\, these ideas may also be of interest in oth
 er settings.\n\n\nSent from Outlook for Mac\n
UID:040000008200E00074C5B7101A82E0080000000089F8072F2B2EDC01000000000000000
 0100000003D0DEA7B0AA3014A843115B125493B71
SUMMARY:Blocklet Concatenation: Low-Overhead Fault-Tolerant Protocols for F
 usion-Based Quantum Computation.
DTSTART;TZID=W. Europe Standard Time:20251208T150000
DTEND;TZID=W. Europe Standard Time:20251208T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/62656414005
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Sergi Mas-Mendoza\narXiv: https://arxiv.org/pdf/2509.1
 2355\nZoom link: https://uva-live.zoom.us/j/62656414005\nAbstract: Establi
 shing a universal diagnostic of topological order remains an open theoreti
 cal challenge. In particular\, diagnosing long-range entanglement through 
 the entropic area law suffers from spurious contributions\, failing to una
 mbiguously identify topological order. Here we devise a protocol based on 
 the ZX calculus\, a graphical tensor network\, to determine the topologica
 l order of a state circumventing entropy calculations. The protocol takes 
 as input real-space bipartitions of a state and returns a ZX contour diagr
 am\, D∂A\, displaying long-range graph connectivity only for long-range 
 entangled states. We validate the protocol by showing that the contour dia
 grams of the toric and color codes are equivalent except for the number of
  non-local nodes\, which differentiates their topological order. The numbe
 r of these nodes is robust to the choice of the boundary and ground-state 
 superposition\, and they are absent for trivial states\, even those with s
 purious entropy contributions. Our results single out ZX calculus as a too
 l to detect topological long-range entanglement by leveraging the advantag
 es of diagrammatic reasoning against entropic diagnostics.\nJoint-Work Wit
 h: Richard D. P. East\, Michele Filippone\, and Adolfo G. Grushin\n\nSent 
 from Outlook for Mac\n
UID:040000008200E00074C5B7101A82E00800000000CD56E345332DDC01000000000000000
 0100000005CA0AF1DD5C1D54C86D07C6B56FBF319
SUMMARY:A Graphical Diagnostic of Topological Order Using ZX Calculus
DTSTART;TZID=W. Europe Standard Time:20251215T150000
DTEND;TZID=W. Europe Standard Time:20251215T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uva-live.zoom.us/j/62656414005
X-MICROSOFT-CDO-APPT-SEQUENCE:1
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Tobias Fischbach<https://netforceexplorer.gitlab.io/we
 bsite/> (University of Luxembourg)\narXiv: https://arxiv.org/pdf/2509.2066
 3\nZoom link: https://uva-live.zoom.us/j/65093307759\nAbstract: Quantum co
 mputing promises significant speed-ups for certain algorithms but the prac
 tical use of current noisy intermediate-scale quantum (NISQ) era computers
  remains limited by resources constraints (e.g.\, noise\, qubits\, gates\,
  and circuit depth). Quantum circuit optimization is a key mitigation stra
 tegy. In this context\, ZX-calculus has emerged as an alternative framewor
 k that allows for semantics-preserving quantum circuit optimization.\n\nWe
  review ZX-based optimization of quantum circuits\, categorizing them by o
 ptimization techniques\, target metrics and intended quantum computing arc
 hitecture. In addition\, we outline critical challenges and future researc
 h directions\, such as multi-objective optimization\, scalable algorithms\
 , and enhanced circuit extraction methods. This survey is valuable for res
 earchers in both combinatorial optimization and quantum computing. For res
 earchers in combinatorial optimization\, we provide the background to unde
 rstand a new challenging combinatorial problem: ZX-based quantum circuit o
 ptimization. For researchers in quantum computing\, we classify and explai
 n existing circuit optimization techniques.\n\n\nJoint-Work With: Pierre T
 albot and Pascal Bouvry\n
UID:040000008200E00074C5B7101A82E00800000000FB32E3FA1E6DDC01000000000000000
 010000000FCC7087B8F3DDE43BA82B4432822496D
SUMMARY:A Review on Quantum Circuit Optimization using ZX-Calculus
DTSTART;TZID=W. Europe Standard Time:20260202T150000
DTEND;TZID=W. Europe Standard Time:20260202T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:1
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Maike Ostmann<https://scholar.google.com/citations?use
 r=pCE9P6oAAAAJ&hl=en> (ORCA Computing)\n\narXiv: https://arxiv.org/pdf/251
 0.06890\nZoom link: https://uva-live.zoom.us/j/65093307759\nAbstract: We p
 ropose a novel architecture for fault-tolerant quantum computing that inco
 rporates strong single-photon nonlinearities into a photonic GHZ-measureme
 nt-based architecture. The nonlinearities substantially reduce resource ov
 erheads compared to conventional linear-optics-based architectures\, which
  require significant redundancy to accommodate probabilistic photon genera
 tion and probabilistic entangling operations. By removing linear-optical f
 ailure modes\, our nonlinear architecture can also tolerate much higher op
 tical losses than linear approaches\, with a baseline loss tolerance of 
 ∼12% using a 32-photon resource state and a foliated surface code. Our r
 esults show how introducing a nonlinear primitive enables dramatic improve
 ments in practical implementations of fault-tolerant quantum computing.\n\
 nJoint-Work With: Joshua Nunn and Alex E. Jones\n
UID:040000008200E00074C5B7101A82E00800000000171056C38E6EDC01000000000000000
 010000000B1F8A34BD533684296F17118F90E0C39
SUMMARY:Nonlinear Photonic Architecture for Fault-Tolerant Quantum Computin
 g
DTSTART;TZID=W. Europe Standard Time:20260209T150000
DTEND;TZID=W. Europe Standard Time:20260209T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Maximilian Rüsch (Quantinuum)\narXiv: https://arxiv.o
 rg/pdf/2510.08477\nZoom link: https://uva-live.zoom.us/j/65093307759\nAbst
 ract: Two circuits are considered to be equivalent under noise if the effe
 ct of faults on one circuit is no worse than the effect of faults on the o
 ther circuit. We call this relationship fault equivalence. Fault equivalen
 ce offers a way to transform circuits while provably preserving their faul
 t-tolerant properties\, enabling a framework for faulttolerant circuit syn
 thesis and optimisation that is correct by construction. The ZX calculus\,
  a set of graphical rewrite rules for quantum computations\, provides a us
 eful tool for manipulating circuits while preserving fault equivalence. Fo
 r this\, the usual set of ZX rewrites has to be restricted to not only pre
 serve the underlying linear map represented by the diagram but also fault 
 equivalence.\n\nIn this work\, we provide a set of ZX rewrites that are so
 und and complete for fault equivalence of Clifford ZX diagrams. This means
  that any equivalence that can be derived using the proposed rules is cert
 ain to be correct\, and any correct equivalence can be derived using only 
 these rules. For this\, we utilise diagrammatic constructions called fault
  gadgets to reason about arbitrary\, possibly correlated Pauli faults in Z
 X diagrams. Fault gadgets allow us to separate the diagram into a fault-fr
 ee part\, which captures the noise-free behaviour of a diagram\, and a noi
 sy part that enumerates the effects of all possible faults. Using this\, w
 e provide a unique normal form for ZX diagrams under noise and show that a
 ny diagram can be brought into this normal form using our proposed rule se
 t.\n\n\nJoint-Work With: Benjamin Rodatz and Aleks Kissinger\n
UID:040000008200E00074C5B7101A82E00800000000973AB9EC496CDC01000000000000000
 0100000005791F8694D653944880D926594196265
SUMMARY:Completeness for Fault Equivalence of Clifford ZX Diagrams
DTSTART;TZID=W. Europe Standard Time:20260216T150000
DTEND;TZID=W. Europe Standard Time:20260216T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Vivien Vandaele<https://scholar.google.com/citations?u
 ser=DMWetzMAAAAJ&hl=en> (Quantinuum)\nPhD Thesis: https://inspirehep.net/f
 iles/1b9b518d03054c5810e04caaa89b6626\nZoom link: https://uva-live.zoom.us
 /j/65093307759\nAbstract: This talk presents a series of results forming a
  logical-level optimization stack for fault-tolerant quantum computing. We
  introduce a method for minimizing the number of Hadamard gates\, which is
  relevant to design efficient non-Clifford gate count optimizers. We also 
 present algorithms for optimizing the T-count and the number of qubits in 
 quantum circuits. We show how these procedures relate to one another and c
 ombine into a unified optimizer for fault-tolerant quantum computing. The 
 ZX-calculus is used throughout\, either to exemplify these procedures intu
 itively or to formulate and solve the optimization problems.\n
UID:040000008200E00074C5B7101A82E0080000000039097820C56ADC01000000000000000
 0100000002FE7962A9B9CBC4596954301546527D5
SUMMARY:Optimization of Fault-Tolerant Quantum Computing by the ZX-Calculus
DTSTART;TZID=W. Europe Standard Time:20260223T150000
DTEND;TZID=W. Europe Standard Time:20260223T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:1
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker:  Rafael Haenel<https://scholar.google.com/citations?us
 er=5eRfN4UAAAAJ&hl=en> and Chen Zhao<https://chenzhao.dev/>\nGitHub: https
 ://github.com/QuEraComputing/tsim\nZoom link: https://uva-live.zoom.us/j/6
 5093307759\nAbstract: We present tsim\, a high-throughput universal quantu
 m circuit simulator designed for quantum error correction with native GPU 
 support. In tsim\, quantum circuits are represented as ZX diagrams\, where
  Pauli channels are modeled as parametrized vertices. Diagrams are compile
 d for vectorized sampling as described in Sutcliffe et al. 2025. And tsim 
 fully supports the stim format and extends it with T and arbitrary rotatio
 n instructions. For pure Clifford and low-magic circuits\, tsim throughput
  can match or even exceed the sampling performance of stim.\n
UID:040000008200E00074C5B7101A82E008000000004F4FC294E5A1DC01000000000000000
 0100000007D557F7702A2BA4B8256A464ECA4FA0C
SUMMARY:Fast Simulation of Universal Quantum Circuits under Pauli Noise via
  ZX Stabilizer Rank Decomposition
DTSTART;TZID=W. Europe Standard Time:20260302T150000
DTEND;TZID=W. Europe Standard Time:20260302T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:1
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Yuchen Pang<https://scholar.google.com/citations?user=
 BL5bd5cAAAAJ&hl=en>\narXiv: https://arxiv.org/pdf/2511.06012\nZoom link: h
 ttps://uva-live.zoom.us/j/65093307759\nAbstract: Quantum circuits are cons
 idered more powerful than classical circuits and require exponential resou
 rces to simulate classically. Clifford circuits are a special class of qua
 ntum circuits that can be simulated in polynomial time but still show impo
 rtant quantum effects such as entanglement. In this work\, we present an a
 lgorithm that simulates Clifford circuits by performing Gaussian eliminati
 on on a modified adjacency matrix derived from the circuit structure. Our 
 work builds on an ZX-calculus tensor network representation of Clifford ci
 rcuits that reduces to quantum graph states. We give a concise formula of 
 amplitudes of graph states based on the LDL decomposition of matrices over
  GF(2)\, and use it to get efficient algorithms for strong and weak simula
 tion of Clifford circuits using tree-decomposition-based fast LDL algorith
 m. The complexity of our algorithm matches the state of art for weak graph
  state simulation and improves the state of art for strong graph state sim
 ulation by taking advantage of Strassen-like fast matrix multiplication. O
 ur algorithm is also efficient when computing many amplitudes or samples o
 f a Clifford circuit. Further\, our amplitudes formula provides a new char
 acterization of locally Clifford equivalent graph states as well as an eff
 icient protocol to learn graph states with low-rank adjacency matrices.\nJ
 oint-Work With: Edgar Solomonik\n\n
UID:040000008200E00074C5B7101A82E0080000000037BFC2EABA6ADC01000000000000000
 010000000D9D76B85BD0BDF4E85F32079D560F090
SUMMARY:Simulating Clifford Circuits with Gaussian Elimination
DTSTART;TZID=W. Europe Standard Time:20260316T150000
DTEND;TZID=W. Europe Standard Time:20260316T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:1
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Quanlong Wang<https://scholar.google.com/citations?use
 r=pGp18eQAAAAJ&hl=en>\narXiv: https://arxiv.org/pdf/2511.06012\nZoom link:
  https://uva-live.zoom.us/j/65093307759\nAbstract: We introduce the Spin-Z
 X calculus as an elevation of Penrose’s diagrams and associated binor ca
 lculus to the level of a formal diagrammatic language. The power of doing 
 so is illustrated by the variety of scientific areas we apply it to: permu
 tational quantum computing\, quantum machine learning\, condensed matter p
 hysics\, and quantum gravity. Respectively\, we analyse permutational comp
 uting transition amplitudes\, evaluate barren plateaus for SU(2) symmetric
  ansatze\, study properties of AKLT states\, and derive the minimum quanti
 sed volume in loop quantum gravity.\n\nOur starting point is the mixed-dim
 ensional ZX calculus\, a purely diagrammatic language that has been proven
  to be complete for finite-dimensional Hilbert spaces. That is\, any equat
 ion that can be derived in the Hilbert space formalism\, can also be deriv
 ed in the mixed-dimensional ZX calculus. We embed the Spin-ZX calculus ins
 ide the mixeddimensional ZX calculus\, rendering it a quantum information 
 flavoured diagrammatic language for the quantum theory of angular momentum
 \, i.e. SU(2) representation theory. We diagrammatically derive the fundam
 ental spin coupling objects — such as Clebsch-Gordan coefficients\, symm
 etrising mappings between qubits and spin spaces\, and spin Hamiltonians 
 — under this embedding.\n\nOur results establish the Spin-ZX calculus as
  a powerful tool for representing and computing with SU(2) systems graphic
 ally\, offering new insights into foundational relationships and paving th
 e way for new diagrammatic algorithms for theoretical physics.\n\n\nJoint-
 Work With: Richard D. P. East\, Razin A. Shaikh\, Lia Yeh\, Boldizsár Po
 ór\, and Bob Coecke\n
UID:040000008200E00074C5B7101A82E00800000000711840FAB96ADC01000000000000000
 010000000B903B23033109B45AE4F49A70214691A
SUMMARY:Beyond Penrose Tensor Diagrams with the ZX Calculus
DTSTART;TZID=W. Europe Standard Time:20260323T150000
DTEND;TZID=W. Europe Standard Time:20260323T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker:  Andrey Boris Khesin<https://scholar.google.com/citati
 ons?user=PwP7294AAAAJ&hl=en>\narXiv: https://arxiv.org/pdf/2603.05391\nZoo
 m link: https://uva-live.zoom.us/j/65093307759\nAbstract: The ability to f
 ault-tolerantly prepare CAT states\, also known as multiqubit GHZ states\,
  is an important primitive for quantum error correction. It is required fo
 r Shor-style syndrome extraction\, and can also be used as a subroutine fo
 r doing fault-tolerant state preparation of CSS codewords. Existing approa
 ches to fault-tolerant CAT state preparations have been found using comput
 ationally expensive heuristics involving SAT solving\, reinforcement learn
 ing\, or exhaustive analysis. In this paper\, we constructively find optim
 al circuits for CAT states in a more scalable way. In particular\, we deri
 ve formal lower bounds on the number of CNOT gates required for circuits i
 mplementing n-qubit CAT states that do not spread errors of weight at most
  t for 1 ≤ t ≤ 5. We do this by using fault-equivalent rewrites of ZX-
 diagrams to reduce it to a problem of characterising certain 3-regular sim
 ple graphs. We then provide families of such optimal graphs for infinitely
  many values of n and t ≤ 5. By encoding the construction of optimal gra
 phs as a constraint satisfaction problem we find explicit constructions fo
 r circuits that match this lower bound on CNOT count for all n ≤ 50 and 
 t ≤ 5 and for nearly all pairs (n\, t) with n ≤ 100 and t ≤ 5 or n 
 ≤ 50 and t ≤ 7\, significantly extending the regimes that were achieva
 ble by previous methods and improving the resource counts for existing con
 structions. We additionally show how to trade CNOT count against depth\, a
 llowing us to construct constant-depth fault-tolerant implementations usin
 g O(n) ancilla and O(n) CNOT gates.\n\nJoint-work with: Sarah Meng Li\, Bo
 ldizsár Poór\, Benjamin Rodatz\, John van de Wetering\, and Richie Yeung
 \n
UID:040000008200E00074C5B7101A82E008000000001C9540E382ADDC01000000000000000
 01000000065E173E0515B524F9D6133C773C81B23
SUMMARY:SpiderCat: Optimal Fault-Tolerant Cat State Preparation
DTSTART;TZID=W. Europe Standard Time:20260330T150000
DTEND;TZID=W. Europe Standard Time:20260330T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Peter-Jan H. S. Derks<https://scholar.google.com/citat
 ions?user=Kb35YgQAAAAJ&hl=en>\narXiv: https://arxiv.org/pdf/2505.07658\nZo
 om link: https://uva-live.zoom.us/j/65093307759\nAbstract: Dynamical stabi
 lizer codes may offer a practical route to large-scale quantum computation
 . Such codes are defined by a schedule of error-detecting measurements\, w
 hich allows for flexibility in their construction. In this work\, we ask h
 ow best to optimise the measurement schedule of dynamically condensed colo
 ur codes in various limits of noise bias. We take a particular focus on th
 e setting where measurements introduce more noise than unitary and idling 
 operations – a noise model relevant to some hardware proposals. For meas
 urementbiased noise models\, we improve code performance by strategically 
 repeating measurements within the schedule. For unbiased or Z-biased noise
  models\, we find repeating measurements offers little improvement – som
 ewhat contrary to our expectations – and investigate why this is. To per
 form this analysis\, we generalise a metric called the teraquop footprint 
 to the teraquop volume. This is the product of the number of qubits and nu
 mber of rounds of measurements required such that the probability of a spa
 celike or timelike logical error occurring is less than 10−12. In most c
 ases\, we find differences in performance are primarily due to the number 
 of rounds of measurements required\, rather than the number of qubits – 
 emphasising the importance of using the teraquop volume in the analysis. A
 dditionally\, our results provide another example of the importance of mak
 ing use of correlated errors when decoding\, in that using belief matching
  rather than minimum-weight perfect matching can turn a worst-performing c
 ode under a given noise model into a best-performing code.\nJoint-Work Wit
 h: Alex Townsend-Teague\, Jens Eisert\, Markus S. Kesselring\, Oscar Higgo
 tt\, and Benjamin J. Brown\n
UID:040000008200E00074C5B7101A82E008000000005AB770E67B6BDC01000000000000000
 010000000AEE53ABA07C9564CA6F3AA9B51D2F9E4
SUMMARY:Dynamical Codes for Hardware with Noisy Readouts
DTSTART;TZID=W. Europe Standard Time:20260413T150000
DTEND;TZID=W. Europe Standard Time:20260413T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Thomas Perez (Institut Polytechnique de Paris)\narXiv:
  https://arxiv.org/pdf/2508.14671\nZoom link: https://uva-live.zoom.us/j/6
 5093307759\nAbstract: In the one-way model of measurement-based quantum co
 mputation (MBQC)\, computation proceeds via single-qubit measurements on a
  resource state. Flow conditions ensure that the overall computation is de
 terministic in a suitable sense\, and are required for efficient translati
 on into quantum circuits. Procedures that rewrite MBQC patterns – e.g. f
 or optimisation\, or adapting to hardware constraints – thus need to pre
 serve the existence of flow. Most previous work has focused on rewrites th
 at reduce the number of qubits in the computation\, or that introduce new 
 Pauli-measured qubits.\n\nHere\, we consider the insertion of planar-measu
 red qubits into MBQC patterns\, i.e. arbitrary measurements in a plane of 
 the Bloch sphere spanned by a pair of Pauli operators\; such measurements 
 are necessary for universal MBQC. We extend the definition of causal flow\
 , previously restricted to XY-measurements only\, to also permit YZ-measur
 ements and derive the conditions under which a YZ-insertion preserves caus
 al flow. Then we derive conditions for YZ-insertion into patterns with gfl
 ow or Pauli flow\, in which case the argument straightforwardly extends to
  XZ-insertions as well. We also show that the ‘vertex splitting’ or 
 ‘neighbour unfusion’ rule previously used in the literature can be der
 ived from YZ-insertion and pivoting. This work contributes to understandin
 g the broad properties of flow-preserving rewriting in MBQC and in the ZX-
 calculus more broadly\, and it will enable more efficient optimisation\, o
 bfuscation\, or routing.\nJoint-Work With: Miriam Backens\n\n
UID:040000008200E00074C5B7101A82E008000000007ADFC08BEC70DC01000000000000000
 010000000C416E4C5EF5EA74C902B371AB02006ED
SUMMARY:Inserting Planar-Measured Qubits into MBQC Patterns while Preservin
 g Flow
DTSTART;TZID=W. Europe Standard Time:20260420T150000
DTEND;TZID=W. Europe Standard Time:20260420T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Kwok Ho Wan<https://scholar.google.com/citations?hl=en
 &user=0QlJInEAAAAJ&view_op=list_works&sortby=pubdate> (PsiQuantum)\narXiv:
  https://arxiv.org/pdf/2509.08658\nZoom link: https://uva-live.zoom.us/j/6
 5093307759\nAbstract: Building upon [arXiv:2509.01224]<https://arxiv.org/p
 df/2509.01224>\, we present a sketch on how to simulate the non-Clifford d
 =5 magic state cultivation circuits [arXiv:2409.17595]<https://arxiv.org/p
 df/2409.17595> with a sum of ≈8 Clifford ZX-diagrams on average\, at 0.1
 % noise. Compared to a magic cat state stabiliser decomposition of all 53 
 non-Clifford spiders (6\,377\,292 terms required)\, this is more than 7×1
 0^5 times reduction in the number of terms. Our stabiliser decomposition h
 as the advantage of representing the final non-Clifford state (in light of
  circuit errors) as a sum of Clifford ZX-diagrams. This will be useful in 
 simulating the escape stage of magic state cultivation\, where one needs t
 o port the resultant state of cultivation into a larger Clifford circuit w
 ith many more qubits. Still\, it's necessary to only track ≈8 Clifford t
 erms. Our result sheds light on the simulability of operationally relevant
 \, high T-count quantum circuits with some internal structure.\n\nJoint-Wo
 rk With: Zhenghao Zhong\n\n
UID:040000008200E00074C5B7101A82E008000000006A2C81E0BD70DC01000000000000000
 010000000F3D4E39B97AD174EAFEA6D0E40A812C2
SUMMARY:How to Simulate Magic State Cultivation with around 8 Clifford Term
 s on Average
DTSTART;TZID=W. Europe Standard Time:20260427T150000
DTEND;TZID=W. Europe Standard Time:20260427T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Titouan Carette<https://www.lix.polytechnique.fr/Labo/
 Titouan.CARETTE/> (Institut Polytechnique de Paris)\narXiv: https://arxiv.
 org/pdf/2508.04296\nZoom link: https://uva-live.zoom.us/j/65093307759\nAbs
 tract: The discard ZX-calculus is known to be complete and universal for m
 ixed-state quantum mechanics\, allowing for both quantum and classical pro
 cesses. However\, if the quantum aspects of ZX-calculus have been explored
  in depth\, little work has been done on the classical side. In this paper
 \, we investigate a fragment of discard ZX-calculus obtained by decohering
  the usual generators of ZX calculus. We show that this calculus is univer
 sal and complete for affinely supported probability distributions over 
 𝔽2^n. To do so\, we exhibit a normal form\, mixing ideas from the graph
 ical linear algebra program and diagrammatic Fourier transforms. Our resul
 ts both clarify how to handle hybrid classical-quantum processes in the di
 scard ZX-calculus and pave the way to the picturing of more general random
  variables and probabilistic processes.\n\nJoint-Work With: Daniela Cojoca
 ru and Renaud Vilmart\n\n
UID:040000008200E00074C5B7101A82E0080000000019FBE59DFC70DC01000000000000000
 01000000003153206C4DA8D4EBE3454DEE16C6259
SUMMARY:The Decohered ZX-Calculus
DTSTART;TZID=W. Europe Standard Time:20260504T150000
DTEND;TZID=W. Europe Standard Time:20260504T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: José A Bolanos\n\nGitHub: https://github.com/tqec/top
 ologiq\nZoom link: https://uva-live.zoom.us/j/65093307759\nAbstract: TBA\n
 \n
UID:040000008200E00074C5B7101A82E00800000000975268565870DC01000000000000000
 010000000EC2D9FCBAC3AA54EAF2B738AA4B36A8A
SUMMARY:Back and Forth between ZX and Lattice Surgery Representations of Qu
 antum Circuits Using PyZX\, Topologiq\, and TQEC
DTSTART;TZID=W. Europe Standard Time:20260511T150000
DTEND;TZID=W. Europe Standard Time:20260511T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:1
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Maximilian Schweikart<https://maxschweik.art/>\narXiv:
  https://arxiv.org/pdf/2603.19522\nZoom link: https://uva-live.zoom.us/j/6
 5093307759\nAbstract: Decoding a quantum error correction code is generall
 y NP-hard\, but corrections must be applied at a high frequency to suppres
 s noise successfully. Matchable codes\, like the surface code\, exhibit a 
 special structure that makes it possible to efficiently\, approximately so
 lve the decoding problem through minimum-weight perfect matching (MWPM). H
 owever\, this efficiency-enabling property can be lost when constructing i
 mplementations for fault-tolerant gadgets such as syndrome-extraction circ
 uits or logical operations.\nIn this work\, we take a circuit-centric pers
 pective to formalise how the decoding problem changes when applying ZX rew
 rites to a ZX diagram with a given detector basis. We demonstrate a set of
 \nrewrites that preserve MWPM-decodability of circuits and show that these
  matchability-preserving rewrites can be used to fault-tolerantly extract 
 quantum circuits from phase-free ZX diagrams. In particular\, this allows 
 us to build efficiently decodable\, fault-tolerant syndrome-extraction cir
 cuits for matchable codes.\nJoint-Work With: Linnea Grans-Samuelsson\, Ale
 ks Kissinger\, and Benjamin Rodatz\n
UID:040000008200E00074C5B7101A82E0080000000047D257BD64C8DC01000000000000000
 0100000008870CFF289D82147B411553437230368
SUMMARY:Preserving MWPM-Decodability in Fault-Equivalent Rewrites
DTSTART;TZID=W. Europe Standard Time:20260518T150000
DTEND;TZID=W. Europe Standard Time:20260518T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Speaker: Richie Yeung<https://y-richie-y.github.io/>\narXiv: ht
 tps://arxiv.org/pdf/2605.10910\nZoom link: https://uva-live.zoom.us/j/6509
 3307759\nAbstract: We use reinforcement learning to synthesize Clifford ci
 rcuits on all-to-all connected devices. Equipped with a qubit-relabeling e
 quivariant\, size-agnostic neural architecture and trained via a random-wa
 lk curriculum\, our agent reduces symplectic Clifford representations to t
 he identity using elementary column operations. On six-qubit benchmarks\, 
 it finds circuits within one two-qubit gate of optimality in milliseconds 
 and exact optima for 99.2% of instances within seconds. After further trai
 ning on ten-qubit cases\, it scales to unseen tableaus with up to thirty q
 ubits and achieves lower average two-qubit gate counts than Qiskit’s Aar
 onson-Gottesman and greedy Clifford synthesizers.\nJoint-Work With: Aleks 
 Kissinger and Rob Cornish\n
UID:040000008200E00074C5B7101A82E0080000000090D75E82EFE3DC01000000000000000
 010000000C514035AD9DF6C4CA2BAF40618FF6F14
SUMMARY:Season Finale: Equivariant Reinforcement Learning for Clifford Quan
 tum Circuit Synthesis
DTSTART;TZID=W. Europe Standard Time:20260525T150000
DTEND;TZID=W. Europe Standard Time:20260525T163000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/65093307759
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Zoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60Q
 fZPruBz2PwctSi4kb.1\n\narXiv: https://arxiv.org/pdf/2605.10910\n\nAbstract
 : We consider the problem of synthesizing Clifford quantum circuits for de
 vices with all-to-all qubit connectivity. We approach this task as a reinf
 orcement learning problem in which an agent learns to discover a sequence 
 of elementary Clifford gates that reduces a given symplectic matrix repres
 entation of a Clifford circuit to the identity. This formulation permits a
  simple learning curriculum based on random walks from the identity. We in
 troduce a novel neural network architecture that is equivariant to qubit r
 elabelings of the symplectic matrix representation\, and which is size-agn
 ostic\, allowing a single learned policy to be applied across different qu
 bit counts without circuit splicing or network reparameterization. On six-
 qubit Clifford circuits\, the largest regime for which optimal references 
 are available\, our agent finds circuits within one two-qubit gate of opti
 mality in milliseconds per instance\, and finds optimal circuits in 99.2% 
 of instances within seconds per instance. After continued training on ten-
 qubit instances\, the agent scales to unseen Clifford tableaus with up to 
 thirty qubits\, including targets generated from circuits with over a thou
 sand Clifford gates\, where it achieves lower average two-qubit gate count
 s than Qiskit’s Aaronson-Gottesman and greedy Clifford synthesizers.\n\n
 Joint-work with: Aleks Kissinger and Rob Cornish\n
UID:040000008200E00074C5B7101A82E00800000000BF6DC2B0D04ADD01000000000000000
 010000000FD0BA017DD23DE45911B1270E12AB2A4
SUMMARY:Equivariant Reinforcement Learning for Clifford Quantum Circuit Syn
 thesis
DTSTART;TZID=W. Europe Standard Time:20261006T163000
DTEND;TZID=W. Europe Standard Time:20261006T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:\narXiv: https://arxiv.org/pdf/2606.12383 and https://arxiv.org
 /abs/2608.14872\n\nZoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4O
 gvaaK60QfZPruBz2PwctSi4kb.1\n\nAbstract: The stabilizer and universal frag
 ments of the ZX calculus are amongst the most important fragments of the t
 heory. Crucially\, both can be described by small collections of rewrites\
 , most of which have been shown to be necessary\, by Backens–Perdrix–W
 ang and Vilmart\, respectively. However\, the necessity of the important b
 ialgebra law\, as well as the status of the red and green compact-structur
 e rules\, had remained unresolved.\nWe present recent minimality results i
 n both fragments\, showing\, in particular\, that the bialgebra rule is ne
 cessary in each. Furthermore\, while the red compact-structure rule is nec
 essary in the stabilizer fragment\, the red identity rule is derivable in 
 the universal fragment\, and the green identity rule remains necessary acr
 oss both.  These results resolve longstanding open questions and give the 
 first complete\, minimal rulesets for both fragments. We also discuss conn
 ections to the categorical literature.\n\nJoint-Work With: Renaud Vilmart\
 n
UID:040000008200E00074C5B7101A82E008000000003750EA18D14ADD01000000000000000
 010000000092FB09521378D40947D0DB6F3EC15CA
SUMMARY:Minimality of the Stabilizer and Universal ZX Calculus
DTSTART;TZID=W. Europe Standard Time:20261013T163000
DTEND;TZID=W. Europe Standard Time:20261013T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:1
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Zoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60Q
 fZPruBz2PwctSi4kb.1\n\nAbstract: TBA\n\nJoint-work with: Andrey Boris Khes
 in\, Sarah Meng Li\, Benjamin Rodatz\, John van de Wetering\, and Richie Y
 eung\n
UID:040000008200E00074C5B7101A82E008000000009EC7EA6ED14ADD01000000000000000
 0100000006792CCE96D78F6459FEF0798CC9C1010
SUMMARY:SpiderCSS: Scalable Fault-Tolerant CSS State Preparation
DTSTART;TZID=W. Europe Standard Time:20261020T163000
DTEND;TZID=W. Europe Standard Time:20261020T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Zoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60Q
 fZPruBz2PwctSi4kb.1\n\narXiv: https://arxiv.org/pdf/2610.12447\n\nAbstract
 : Entanglement and non-stabilizerness are complementary resources underlyi
 ng the complexity of quantum states\, yet extracting either quantity from 
 large quantum circuits generally requires exponentially scaling resources.
  In diagrammatic approaches to quantum computation\, such as the ZX-calcul
 us\, both quantities likewise typically require expensive tensor contracti
 ons that are not native to graphical rewriting. Here we show that both ent
 anglement and magic can be efficiently estimated directly from ZX-diagrams
 . Flow enables efficient extraction of a normal form separating a potentia
 lly extensively entangled graph-state backbone from non-Clifford Pauli gad
 gets. This structure yields additive upper and lower bounds on bipartite e
 ntanglement entropy\, which we further tighten through a preprocessing pro
 cedure that removes or merges redundant non-Clifford contributions. The sa
 me normal form gives an upper bound on logarithmic stabilizer extent. We b
 enchmark these methods in random unitary and monitored circuits\, and a ci
 rcuit combining Trotterized Hamiltonian evolution with Clifford layers\, f
 inding that the resulting bounds remain informative even at large qubit nu
 mbers\, circuit depths\, and internal spider counts. Our results provide s
 calable probes of entanglement and non-stabilizerness of ZX-diagrams and e
 stablish a bridge between ZX-calculus and quantum many-body resource chara
 cterization\, with applications across quantum computing\, quantum informa
 tion\, and condensed-matter physics.\n\nJoint-work with: Razin Shaikh and 
 Aleks Kissinger\n
UID:040000008200E00074C5B7101A82E00800000000FB06F1DBD14ADD01000000000000000
 01000000004FA8D1C61EDB248BFA1B5579CCC335A
SUMMARY:Entanglement Entropy and Magic of ZX-Diagrams
DTSTART;TZID=W. Europe Standard Time:20261027T163000
DTEND;TZID=W. Europe Standard Time:20261027T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:2
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:2
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Zoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60Q
 fZPruBz2PwctSi4kb.1\n\narXiv: https://arxiv.org/pdf/2608.24370\n\nAbstract
 : Recent years have seen a rapid growth in literature presenting new metho
 ds for simulating nonClifford quantum circuits with classical hardware. Th
 ese methods span a range of approaches\, including stabiliser decompositio
 n and tensor contraction techniques\, varying in efficiency depending on c
 ircuit class\, depth\, non-Clifford gate count\, and other metrics. A nota
 ble limitation of this literature is the lack of a standardised approach t
 o benchmarking\, with each new paper outlining its own specification\, sim
 ulating its own set of circuits on the authors’ own hardware. This paper
  seeks to address this issue by presenting a standardised and canonical be
 nchmark suite and infrastructure for quantifying the efficiency of non-Cli
 fford classical simulators\, with a consistent dataset of circuits and pro
 viding consistent (virtual) hardware\, thereby enabling a fair comparison 
 of results.\n\nJoint-work with: John van de Wetering\n
UID:040000008200E00074C5B7101A82E008000000008FAADFD22C4CDD01000000000000000
 01000000094CC46F1B7464E4BA0ABB99123AEEE7E
SUMMARY:ABSTRACTS: Amsterdam Benchmark Suite for the Time and Resource Anal
 ysis of Clifford+T Simulators
DTSTART;TZID=W. Europe Standard Time:20261103T163000
DTEND;TZID=W. Europe Standard Time:20261103T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Zoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60Q
 fZPruBz2PwctSi4kb.1\n\narXiv: https://arxiv.org/pdf/2609.03048\n\nAbstract
 : Distributed architectures have been proposed as a pathway to large-scale
  quantum computers. Combined with the need for fault-tolerance\, such arch
 itectures require distributed quantum error correction (DQEC) and distribu
 ted logical gates. An important challenge is how to realize DQEC primitive
 s in the setting where interaction between modules is restricted to shared
  Bell pairs that are significantly noisier than on-chip operations. We ext
 end the work in [1] on fault tolerance by construction to this setting\, d
 eriving different strategies for handling the additional noise. Through fa
 ultimprovement we recover conventional entanglement distillation\, and als
 o find more dynamical protocols that enable space-time trade-offs. We show
  that integrated decoding halves the required distillation code distance c
 ompared to entanglement distillation implemented using separate decoding\,
  thus requiring significantly fewer Bell pairs. As a main focus of the wor
 k\, we synthesize efficient circuits for an important primitive in distrib
 uted fault tolerance: distributed stabilizer measurements. These circuits 
 can be adapted to resource constraints\, e.g. on the Bell pair generation 
 rate or the space available for on-chip auxiliary qubits. Noting that full
  local fault-tolerance is not always needed to preserve the correct scalin
 g of logical error rates\, we further optimize the circuits depending on t
 he surrounding context. We consider in particular the surface code and the
  color code\, both as distributed memories and in the case of lattice surg
 ery across separate modules. Here\, robustness to certain hook and readout
  errors reduces the number of required Bell pairs even further\, compared 
 to the context-free setting. We numerically benchmark the resulting implem
 entations under circuit level noise with additional interconnect noise.\n\
 nJoint-work with: Martin Moureau\, Benjamin Rodatz\, Boldizsár Poór\, El
 ie Mounzer\, and Linnea Grans-Samuelsson\n
UID:040000008200E00074C5B7101A82E0080000000050CCF7925D4BDD01000000000000000
 0100000003A12D720D7FFB74A9E9196F376BA864C
SUMMARY:Resource-adaptive distributed fault tolerance with very noisy Bell 
 pairs
DTSTART;TZID=W. Europe Standard Time:20261110T163000
DTEND;TZID=W. Europe Standard Time:20261110T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Zoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60Q
 fZPruBz2PwctSi4kb.1\n\narXiv: https://arxiv.org/pdf/2606.02542\n\nAbstract
 : The ZX-calculus is a powerful graphical language for manipulating quantu
 m circuits\, which has recently found many applications in quantum error c
 orrection. We extend this language to handle Floquet and other dynamical s
 tabilizer codes via the connection between measurement-based code switchin
 g and gauge fixing [1]. We combine gauge-fixing steps to implement a close
 d loop in the space of stabilizer codes\, returning to the original codesp
 ace up to a logical Clifford gate. These measurement-based paths in the sp
 ace of stabilizer codes can be viewed as shortcuts\, or “chutes and ladd
 ers”\, relative to single-qubit Clifford operations and qubit permutatio
 ns. This yields a machine-interpretable method for constructing dynamical 
 automorphisms and facilitates the search for implementations of desired lo
 gical gates. As an example\, we implement a logical phase gate via distanc
 e-preserving code switching for the seven-qubit code bare code [2]\, which
  has no non-trivial logical Clifford gates based on single-qubit Clifford 
 operations and qubit permutations [3].\n\nJoint-work with: Sascha Zakaib
 –Bernier\, Zachary Mann\, Michael Vasmer\, and Victor V. Albert\n
UID:040000008200E00074C5B7101A82E008000000001F83095A9751DD01000000000000000
 01000000026B69588AECEB6458BB607E102E60CB2
SUMMARY:Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus
DTSTART;TZID=W. Europe Standard Time:20261117T163000
DTEND;TZID=W. Europe Standard Time:20261117T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Zoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60Q
 fZPruBz2PwctSi4kb.1\n\narXiv: https://arxiv.org/pdf/2602.10183\n\nAbstract
 : The one-dimensional transverse-field Ising model is a celebrated Hamilto
 nian in condensed matter and statistical physics which admits the so-calle
 d Kramers-Wannier duality\, which exchanges the order and disorder phases.
  Interestingly\, at criticality\, the duality manifests as a non-invertibl
 e symmetry. However\, extending such constructions beyond Abelian groups (
 such as the clock and Potts models) in tensor-product Hilbert spaces has\,
  however\, remained challenging. I will show how to construct a generalize
 d transverse-field Ising model with a Kramers-Wannier transformation based
  on a finite-dimensional semisimple self-dual Hopf algebra. The Hamiltonia
 n and symmetry operators can be conveniently described diagrammatically by
  a noncommutative version of ZX-calculus.\n\nJoint-work with: Da-Chuan Lu 
 and Arkya Chatterjee\n
UID:040000008200E00074C5B7101A82E00800000000DFA74E38074FDD01000000000000000
 0100000008D10E0E52E2BF643A2CC49377D2EDF8F
SUMMARY:Generalized Kramers-Wannier Self-Duality in Hopf-Ising Models
DTSTART;TZID=W. Europe Standard Time:20261124T163000
DTEND;TZID=W. Europe Standard Time:20261124T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:1
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Zoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60Q
 fZPruBz2PwctSi4kb.1\n\narXiv: https://arxiv.org/pdf/2607.05501\n\nAbstract
 : Pipe diagrams have emerged as a powerful framework for flexible lattice 
 surgery compilation and spacetime optimization for the surface code. In co
 ntrast\, analogous compilation techniques for color code architectures rem
 ain largely unexplored\, despite the color code’s favorable properties\,
  including reduced qubit overhead and transversal single-qubit Clifford ga
 tes. In this work\, we develop a pipe diagram representation for the trian
 gular color code on the 6.6.6 lattice and establish its correspondence to 
 ZX-diagrammatic descriptions of computation. We present distance-independe
 nt constructions of color code pipe diagrams together with explicit realiz
 ations of correlation surfaces\, stabilizers\, and syndrome extraction cir
 cuits. This framework enables both macroscopic optimization of logical com
 putations in spacetime and microscopic compilation to executable syndrome 
 extraction circuits. We demonstrate the potential for compact spacetime em
 beddings with the color code’s geometry. These results provide a foundat
 ion for automated lattice surgery compilation and diagrammatic optimizatio
 n in color code architectures.\n\nJoint-work with: Gilad Kishony\, Robert 
 Wille\, and Austin Fowler\n
UID:040000008200E00074C5B7101A82E00800000000A9ADFA7C2D4CDD01000000000000000
 0100000004091B912A3B5884F913D83A9A2720E44
SUMMARY:Towards Lattice Surgery Compilation for the Color Code Using Pipe D
 iagrams
DTSTART;TZID=W. Europe Standard Time:20261201T163000
DTEND;TZID=W. Europe Standard Time:20261201T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:0
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
BEGIN:VEVENT
DESCRIPTION:Zoom: https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60Q
 fZPruBz2PwctSi4kb.1\n\narXiv: https://arxiv.org/pdf/2601.20007\n\nSpeaker:
  Ludwig Schmid<https://scholar.google.com/citations?user=LZfODxEAAAAJ&hl=i
 t>\n\nAbstract: We present a novel quantum circuit extraction scheme that 
 tightly integrates graph-like ZX diagrams with hardware-adaptive routing. 
 The method utilizes the degrees of freedom during the conversion from a ZX
  diagram to a quantum circuit (extraction). It alternates between generati
 ng multiple extraction options and evaluating them based on hardware const
 raints\, allowing the routing algorithm to inform and guide the extraction
  process. This feedback loop extends existing graph-like ZX extraction and
  supports modular integration of different extraction algorithms\, routing
  strategies\, and target hardware\, making it a versatile building block d
 uring compilation. To perform numerical evaluations\, a reference instance
  of the scheme is implemented with SWAP-based routing for neutral atom har
 dware and evaluated using various benchmark collections on small-to mid-sc
 ale circuits. The reference code is available as open-source\, allowing fa
 st integration of other extraction and/or routing tools to stimulate furth
 er research and foster improvements of the proposed scheme.\n\nJoint-work 
 with: Korbinian Staudacher and Robert Wille\n\n
UID:040000008200E00074C5B7101A82E008000000001F882213B652DD01000000000000000
 010000000D9EFF0E0FC639A4886AFCBB0CD734D19
SUMMARY:Alternating ZX Circuit Extraction for Hardware-Adaptive Compilation
DTSTART;TZID=W. Europe Standard Time:20261208T163000
DTEND;TZID=W. Europe Standard Time:20261208T173000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20261117T114201Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:2
LOCATION:https://uwaterloo.zoom.us/j/92932201235?pwd=HUg4OgvaaK60QfZPruBz2P
 wctSi4kb.1
X-MICROSOFT-CDO-APPT-SEQUENCE:2
X-MICROSOFT-CDO-BUSYSTATUS:BUSY
X-MICROSOFT-CDO-INTENDEDSTATUS:BUSY
X-MICROSOFT-CDO-ALLDAYEVENT:FALSE
X-MICROSOFT-CDO-IMPORTANCE:1
X-MICROSOFT-CDO-INSTTYPE:0
X-MICROSOFT-DONOTFORWARDMEETING:FALSE
X-MICROSOFT-DISALLOW-COUNTER:FALSE
X-MICROSOFT-REQUESTEDATTENDANCEMODE:DEFAULT
X-MICROSOFT-ISRESPONSEREQUESTED:FALSE
END:VEVENT
END:VCALENDAR
