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:In this special seminar\, leading minds from different aspects
of ZX research will share the state of the art and discuss interesting ope
n problems. We aim to provide a bird's eye view of different research dire
ctions and trigger interdisciplinary discussions. Below are invited speake
rs and their discussion topics.\n\n\n *\nMiriam Backens: ZX Calculus and
Measurement-Based Quantum Computing\n *\nAleks Kissinger: ZX Calculus and
Quantum Error Correction\n *\nRazin Shaikh: ZX Calculus to study Qudit a
nd the Completeness Problem\n *\nMatthew Sutcliffe and Richie Yeung: ZX C
alculus and Machine learning\n *\nJohn van de Wetering: ZX Calculus for Q
uantum Compilation\n *\nLia Yeh: ZX Calculus for Education\n\n\n_________
_______________________________________________________________________\nM
icrosoft Teams Need help?\nJoi
n the meeting now\nMeeting ID: 391 516 311 499\nPas
scode: joW2dd\n________________________________\nFor organizers: Meeting o
ptions\n__________________________________________
______________________________________\n
UID:040000008200E00074C5B7101A82E0080000000086859DDCB403DB01000000000000000
010000000049780D3D6811F4CB89BBA80DE85C8EE
SUMMARY:The State of ZX
DTSTART;TZID=W. Europe Standard Time:20240924T140000
DTEND;TZID=W. Europe Standard Time:20240924T153000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uva-live.zoom.us/j/89134034880
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: Qunsheng Huang (Technical University of Munich)\narXiv: https://arx
iv.org/pdf/2408.00354\nTime: 9 - 10 am ET = 2 - 3 pm UK = 3 - 4 pm Netherl
ands/Germany\n\nAbstract: In quantum computing\, the efficient optimizatio
n of Pauli string decompositions is a crucial aspect for the compilation o
f quantum circuits for many applications\, such as chemistry simulations a
nd quantum machine learning. In this paper\, we propose a novel algorithm
for the synthesis of trotterized time-evolution operators that results in
circuits with significantly fewer gates than previous solutions. Our synth
esis procedure takes the qubit connectivity of a target quantum computer i
nto account. As a result\, the generated quantum circuit does not require
routing\, and no additional CNOT gates are needed to run the resulting cir
cuit on a target device. We compare our algorithm against Paulihedral and
TKET\, and show a significant improvement for randomized circuits and diff
erent molecular ansatzes. We also investigate the Trotter error introduced
by our ordering of the terms in the Hamiltonian versus default ordering a
nd the ordering from the baseline methods and conclude that our method on
average does not increase the Trotter error.\n\nJoint-Work With: David Win
derl\, Arianne Meijer–van de Griend\, Richie Yeung\n
UID:040000008200E00074C5B7101A82E00800000000D4A886F15308DB01000000000000000
010000000FD2597DD4F1F5740ACAAA622B21B068E
SUMMARY:Redefining Lexicographical Ordering: Optimizing Pauli String Decomp
ositions for Quantum Compiling
DTSTART;TZID=W. Europe Standard Time:20240930T150000
DTEND;TZID=W. Europe Standard Time:20240930T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/89276936334
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: Simon Burton (
Quantinuum)\nZoom link: https://uwaterloo.zoom.us/j/92023713131?pwd=Ni8zZ3
BVSIBaNQmHzuy6pHdqVGKNhP.1\narXiv: http
s://arxiv.org/pdf/2406.09951\nAbstract: A great deal of work has been done
developing quantum codes with varying overhead and connectivity constrain
ts. However\, given the such an abundance of codes\, there is a surprising
shortage of fault-tolerant logical gates supported therein. We define a c
onstruction\, such that given an input [[n\,k\,d]] code\, yields a [[2n\,2
k\,≥d]] symplectic double code with naturally occurring fault-tolerant l
ogical Clifford gates. As applied to 2-dimensional D(ℤ2)-topological cod
es with genons (twists) and domain walls\, we find the symplectic double i
s genon free\, and of possibly higher genus. Braiding of genons on the ori
ginal code becomes Dehn twists on the symplectic double. Such topological
operations are particularly suited for architectures with all-to-all conne
ctivity\, and we demonstrate this experimentally on Quantinuum’s H1-1 tr
apped-ion quantum computer.\nJoint-Work With: Elijah Durso-Sabina and Nata
lie C. Brown\n
UID:040000008200E00074C5B7101A82E00800000000252802B95408DB01000000000000000
010000000AEFC90978D66084DB6044ECA9636FC69
SUMMARY:Genons\, Double Covers and Fault-tolerant Clifford Gates
DTSTART;TZID=W. Europe Standard Time:20241007T150000
DTEND;TZID=W. Europe Standard Time:20241007T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uva-live.zoom.us/j/89276936334
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 link: https://uva
-live.zoom.us/j/89276936334\narXiv: htt
ps://arxiv.org/pdf/2401.16225\nTime: 9 - 10 am ET = 2 - 3 pm UK = 3 - 4 pm
Netherlands/France\nAbstract: The ZW-calculus is a graphical language cap
able of representing 2-dimensional quantum systems (qubit) through its dia
grams\, and manipulating them through its equational theory. We extend the
formalism to accommodate finite dimensional Hilbert spaces beyond qubit s
ystems. First we define a qudit version of the language\, where all system
s have the same arbitrary finite dimension d\, and show that the provided
equational theory is both complete – i.e. semantical equivalence is enti
rely captured by the equations – and minimal – i.e. none of the equati
ons are consequences of the others. We then extend the graphical language
further to accommodate all finite dimensional Hilbert spaces at the same t
ime. We again show the completeness of the provided equational theory.\n
UID:040000008200E00074C5B7101A82E00800000000BEDF63791909DB01000000000000000
010000000D26DD4EF719DB444911ABB9041DC140A
SUMMARY:Minimality in Finite-Dimensional ZW-Calculi
DTSTART;TZID=W. Europe Standard Time:20241014T150000
DTEND;TZID=W. Europe Standard Time:20241014T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/89276936334
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 (
Eviden Quantum Lab and Université de Lorraine)\nZoom link: https://uva-li
ve.zoom.us/j/89276936334\narXiv: https:
//arxiv.org/pdf/2407.10171\nAbstract: We propose several methods for optim
izing the number of qubits in a quantum circuit while preserving the numbe
r of non-Clifford gates. One of our approaches consists in reversing\, as
much as possible\, the gadgetization of Hadamard gates\, which is a proced
ure used by some T-count optimizers to circumvent Hadamard gates at the ex
pense of additional qubits. We prove the NP-hardness of this problem and w
e present an algorithm for solving it. We also propose a more general appr
oach to optimize the number of qubits by showing how it relates to the pro
blem of finding a minimal-width path-decomposition of the graph associated
with a given ZX-diagram. This approach can be used to optimize the number
of qubits for any computational model that can natively be depicted in ZX
-calculus\, such as the Pauli Fusion computational model which can represe
nt lattice surgery operations. We also show how this method can be used to
efficiently optimize the number of qubits in a quantum circuit by using t
he ZX-calculus as an intermediate representation.\n
UID:040000008200E00074C5B7101A82E0080000000052E47EB31909DB01000000000000000
0100000000645043DBDE19245B161B8E146AA39AB
SUMMARY:Qubit-Count Optimization Using ZX-Calculus
DTSTART;TZID=W. Europe Standard Time:20241021T150000
DTEND;TZID=W. Europe Standard Time:20241021T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/89276936334
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: Lia Yeh (Quantinuum and University of Oxford)\nZoom link: https://
uva-live.zoom.us/j/89276936334\narXiv:
https://arxiv.org/pdf/2312.03653\nAbstract: Quantum theory is often regard
ed as challenging to learn and teach\, with advanced mathematical prerequi
sites ranging from complex numbers and probability theory to matrix multip
lication\, vector space algebra and symbolic manipulation within the Hilbe
rt space formalism. It is traditionally considered an advanced undergradua
te or graduate-level subject. In this work\, we challenge the conventional
view by proposing “Quantum Picturalism” as a new approach to teaching
the fundamental concepts of quantum theory and computation. We establish
the foundations and methodology for an ongoing educational experiment to i
nvestigate the question “From what age can students learn quantum theory
if taught using a diagrammatic approach?”. We anticipate that the prima
ry benefit of leveraging such a diagrammatic approach\, which is conceptua
lly intuitive yet mathematically rigorous\, will be eliminating some of th
e most daunting barriers to teaching and learning this subject while enabl
ing young learners to reason proficiently about high-level problems. We po
sit that transitioning from symbolic presentations to pictorial ones will
increase the appeal of STEM education\, attracting more diverse audience.\
n\nJoint-Work With: Selma Dundar-Coecke\, Caterina Puca\, Sieglinde M.-L.
Pfaendler\, Muhammad Hamza Waseem\, Thomas Cervoni\, Aleks Kissinger\, Ste
fano Gogioso\, and Bob Coecke\n
UID:040000008200E00074C5B7101A82E008000000008437D2EE1909DB01000000000000000
010000000C5EBF4E6E6C3434681CC9D0863E16FDE
SUMMARY:Quantum Picturalism: Learning Quantum Theory in High School
DTSTART;TZID=W. Europe Standard Time:20241028T150000
DTEND;TZID=W. Europe Standard Time:20241028T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/89276936334
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 link: https://uva-live.zoom.us/j/89276936334\narXiv: https://arxiv.org/pdf/2404.09915\nTime: 9 -
10 am ET = 2 - 3 pm UK = 3 - 4 pm Netherlands\n\nAbstract: A catalysis sta
te is a quantum state that is used to make some desired operation possible
or more efficient\, while not being consumed in the process. Recent years
have seen catalysis used in state-of-the-art protocols for implementing m
agic state distillation or small angle phase rotations. In this paper we w
ill see that we can also use catalysis to prove that certain gate sets are
computationally universal\, and to extend completeness results of graphic
al languages to larger fragments. In particular\, we give a simple proof o
f the computational universality of the CS+Hadamard gate set using the cat
alysis of a T gate using a CS gate\, which sidesteps the more complicated
analytic arguments of the original proof by Kitaev. This then also gives u
s a simple self-contained proof of the computational universality of Toffo
li+Hadamard. Additionally\, we show that the phase-free ZH-calculus can be
extended to a larger complete fragment\, just by using a single catalysis
rule (and one scalar rule).\n\nJoint-Work With: Aleks Kissinger and Neil
J. Ross\n
UID:040000008200E00074C5B7101A82E00800000000D7910026E809DB01000000000000000
0100000005CA2961CEDF3EF44BA0954EE67E54E71
SUMMARY:Catalysing Completeness and Universality
DTSTART;TZID=W. Europe Standard Time:20241104T150000
DTEND;TZID=W. Europe Standard Time:20241104T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:ttps://uva-live.zoom.us/j/89276936334
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: Alexander Koziell-Pipe
(University of Oxford)\nZoom link: https://uva-live.zoom.us/j/89276936334\
npaper:https://openreview.net/pdf?id=54060pbCKY\nAbstract: In this work\,
we train a graph neural network with reinforcement learning to more effici
ently simulate quantum circuits using the ZX-calculus. Our experiments sho
w a marked improvement in simulation efficiency using the trained model ov
er existing methods that do not incorporate AI. In this way\, we demonstra
te a machine learning model that can reason effectively within a mathemati
cal framework such that it enhances scientific research in the important d
omain of quantum computing.\n\nJoint-Work With: Richie Yeung and Matthew S
utcliffe\n
UID:040000008200E00074C5B7101A82E00800000000158176091909DB01000000000000000
010000000F5F7A3D2F2468A4A98E27F42E1D21463
SUMMARY:Towards Faster Quantum Circuit Simulation Using Graph Decomposition
s\, GNNs and Reinforcement Learning
DTSTART;TZID=W. Europe Standard Time:20241111T150000
DTEND;TZID=W. Europe Standard Time:20241111T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:2
LOCATION:https://uva-live.zoom.us/j/89276936334
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:Speaker: Julio C. Magdalena de la Fuente (Freie Universität Be
rlin) and Josias Old (Forschungszentrum Jülich\, RWTH Aachen University)\
nZoom link: https://uva-live.zoom.us/j/89276936334\narXiv: https://arxiv.org/pdf/2407.08566\n\nAbstract: Analyzin
g and developing new quantum error-correcting schemes is one of the most p
rominent tasks in quantum computing research. In such efforts\, introducin
g time dynamics explicitly in both analysis and design of error-correcting
protocols constitutes an important cornerstone. In this work\, we present
a graphical formalism based on tensor networks to capture the logical act
ion and error-correcting capabilities of any Clifford circuit with Pauli m
easurements. We showcase the functioning of the formalism on new Floquet c
odes derived from topological subsystem codes\, which we call XYZ ruby cod
es. Based on the projective symmetries of the building blocks of the tenso
r network we develop a framework of Pauli flows. Pauli flows allow for a g
raphical understanding of all quantities entering an error correction anal
ysis of a circuit\, including different types of QEC experiments\, such as
memory and stability experiments. We lay out how to derive a well-defined
decoding problem from the tensor network representation of a protocol and
its Pauli flows alone\, independent of any stabilizer code or fixed circu
it. Importantly\, this framework applies to all Clifford protocols and enc
ompasses both measurement-based and circuit-based approaches to fault tole
rance. We apply our method to our new family of dynamical codes which are
in the same topological phase as the 2+1-dimensional color code\, making t
hem a promising candidate for low-overhead logical gates. In contrast to i
ts static counterpart\, the dynamical protocol applies a ℤ3 automorphism
to the logical Pauli group every three timesteps. We highlight some of it
s topological properties and comment on the anyon physics behind a planar
layout. Lastly\, we benchmark the performance of the XYZ ruby code on a to
rus by performing both memory and stability experiments and find competiti
ve circuit-level noise thresholds of ≈0.18\, comparable with other Floqu
et codes and 2+1-dimensional color codes.\n\nJoint-Work With: Alex Townsen
d-Teague\, Manuel Rispler\, Jens Eisert\, and Markus Müller\n
UID:040000008200E00074C5B7101A82E008000000003878AB6A5508DB01000000000000000
0100000004B116A9C8B7C1945ABF45A37608B6B3A
SUMMARY:The XYZ Ruby Code: Making a Case for a Three-Colored Graphical Calc
ulus for Quantum Error Correction in Spacetime
DTSTART;TZID=W. Europe Standard Time:20241118T150000
DTEND;TZID=W. Europe Standard Time:20241118T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/89276936334
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: Razin A. Shaikh (University of Oxford)\n\nZoom link: https://uva-l
ive.zoom.us/j/89276936334\narXiv: https
://arxiv.org/pdf/2406.02905\n\nAbstract: While the ZX and ZW calculi have
been effective as graphical reasoning tools for finite-dimensional quantum
computation\, the possibilities for continuous-variable quantum computati
on (CVQC) in infinite-dimensional Hilbert space are only beginning to be e
xplored. In this work\, we formulate a graphical language for CVQC. Each d
iagram is an undirected graph made of two types of spiders: the Z spider f
rom the ZX calculus defined on the reals\, and the newly introduced Fock s
pider defined on the natural numbers. The Z and X spiders represent functi
ons in position and momentum space respectively\, while the Fock spider re
presents functions in the discrete Fock basis. In addition to the Fourier
transform between Z and X\, and the Hermite transform between Z and Fock\,
we present exciting new graphical rules capturing heftier CVQC interactio
ns.\n\nWe ensure this calculus is complete for all of Gaussian CVQC interp
reted in infinite-dimensional Hilbert space\, by translating the completen
ess in affine Lagrangian relations by Booth\, Carette\, and Comfort. Apply
ing our calculus for quantum error correction\, we derive graphical repres
entations of the Gottesman-Kitaev-Preskill (GKP) code encoder\, syndrome m
easurement\, and magic state distillation of Hadamard eigenstates. Finally
\, we elucidate Gaussian boson sampling by providing a fully graphical pro
of that its circuit samples submatrix hafnians.\n\nJoint-Work With: Lia Ye
h and Stefano Gogioso\n
UID:040000008200E00074C5B7101A82E00800000000E3B301A0E809DB01000000000000000
010000000653FAEF159075845BA62734CF3F75555
SUMMARY:The Focked-up ZX Calculus: Picturing Continuous-Variable Quantum Co
mputation
DTSTART;TZID=W. Europe Standard Time:20241125T150000
DTEND;TZID=W. Europe Standard Time:20241125T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/89276936334
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: Aleks Kissinger (University of Oxford)\nZoom link: https://uva-live.zoom.us/j/8
9276936334\narXiv: https://arxiv.org/pdf/2404.07828\n\nAbstract: This is t
he second in a series of "graphical grokking" papers in which we study how
stabiliser codes can be understood using the ZX-calculus. In this paper w
e show that certain complex rules involving ZX-diagrams\, called spider ne
st identities\, can be captured succinctly using the scalable ZX-calculus\
, and all such identities can be proved inductively from a single new rule
using the Clifford ZX-calculus. This can be combined with the ZX picture
of CSS codes\, developed in the first "grokking" paper\, to give a simple
characterisation of the set of all transversal diagonal gates at the third
level of the Clifford hierarchy implementable in an arbitrary CSS code.\n
\nJoint-Work With: John van de Wetering\n
UID:040000008200E00074C5B7101A82E0080000000099EBD510EC09DB01000000000000000
010000000208758BF04E2EF409295E701BB7BE0E6
SUMMARY:Scalable Spider Nests (...Or How to Graphically Grok Transversal No
n-Clifford Gates)
DTSTART;TZID=W. Europe Standard Time:20241202T150000
DTEND;TZID=W. Europe Standard Time:20241202T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:1
LOCATION:https://uva-live.zoom.us/j/89276936334
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: Dichuan (David) Gao (University of Oxford)\nZoom link:
https://uva-live.zoom.us/j/89276
936334\narXiv: https://arxiv.org/pdf/24
06.02219\nAbstract: We propose a generalization of the graphical ZH calcul
us to qudits of prime-power dimensions q=p^t\, implementing field arithmet
ic in arbitrary finite fields. This is an extension of a previous result [
17] which implemented arithmetic of prime-sized fields\; and an alternativ
e to a result in [3] which extended the ZH to implement cyclic ring arithm
etic in ℤ/qℤ rather than field arithmetic in 𝔽q. We show this gener
alized ZH calculus to be universal over matrices ℂ^{q^n}→ℂ^{q^m} wit
h entries in the ring ℤ[ω] where ω is a pth root of unity. As an illus
tration of the necessity of such an extension of ZH for field rather than
cyclic ring arithmetic\, we offer a graphical description and proof for a
quantum algorithm for polynomial interpolation. This algorithm relies on t
he invertibility of multiplication\, and therefore can only be described i
n a graphical language that implements field\, rather than ring\, multipli
cation.\n[3] Simple ZX and ZH Calculi for Arbitrary Finite Dimensions\, vi
a Discrete Integrals.\n[17] The Qudit ZH
-Calculus: Generalised Toffoli+Hadamard and Universality.\n\n
UID:040000008200E00074C5B7101A82E0080000000088C31E121C09DB01000000000000000
010000000AC6B8DD66C9AE847AAFAE638CE83A939
SUMMARY:The Qudit ZH Calculus for Arbitrary Finite Fields: Universality and
Application
DTSTART;TZID=W. Europe Standard Time:20241209T150000
DTEND;TZID=W. Europe Standard Time:20241209T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/89276936334
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: Daniel Bochen Tan (Google Quantum AI and University of California\
, Los Angeles)\n\nZoom link: https://uva-live.zoom.us/j/89276936334\narXiv
: https://arxiv.org/pdf/2404.18369\n\nA
bstract: Quantum error correction is necessary for largescale quantum comp
uting. A promising quantum error correcting code is the surface code. For
this code\, fault-tolerant quantum computing (FTQC) can be performed via l
attice surgery\, i.e.\, splitting and merging patches of code. Given the f
requent use of certain lattice-surgery subroutines (LaS)\, it becomes cruc
ial to optimize their design in order to minimize the overall spacetime vo
lume of FTQC. In this study\, we define the variables to represent LaS and
the constraints on these variables. Leveraging this formulation\, we deve
lop a synthesizer for LaS\, LaSsynth\, that encodes a LaS construction pro
blem into a SAT instance\, subsequently querying SAT solvers for a solutio
n. Starting from a baseline design\, we can gradually invoke the solver wi
th shrinking spacetime volume to derive more compact designs. Due to our f
oundational formulation and the use of SAT solvers\, LaSsynth can exhausti
vely explore the design space\, yielding optimal designs in volume. For ex
ample\, it achieves 8% and 18% volume reduction respectively over two stat
es-of-the-art human designs for the 15-to-1 T-factory\, a bottleneck in FT
QC.\n\nJoint-Work With: Murphy Yuezhen Niu and Craig Gidney\n
UID:040000008200E00074C5B7101A82E00800000000C93E7BEEE809DB01000000000000000
010000000E5162B7C1AE73D4DB5C41CA81E242BD7
SUMMARY:A SAT Scalpel for Lattice Surgery: Representation and Synthesis of
Subroutines for Surface-Code Fault-Tolerant Quantum Computing
DTSTART;TZID=W. Europe Standard Time:20241216T150000
DTEND;TZID=W. Europe Standard Time:20241216T162000
CLASS:PUBLIC
PRIORITY:5
DTSTAMP:20241109T232327Z
TRANSP:OPAQUE
STATUS:CONFIRMED
SEQUENCE:0
LOCATION:https://uva-live.zoom.us/j/89276936334
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
END:VCALENDAR