BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Mark Webster (University of Sydney)
DTSTART:20220606T090000Z
DTEND:20220606T100000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/1
DESCRIPTION:Title: The XP Stabiliser Formalism: a Generalisation of the Pauli Stabili
ser Formalism with Arbitrary Phases\nby Mark Webster (University of Sy
dney) as part of Bilkent Quantum Computing Seminar\n\n\nAbstract\nMark Web
ster works in the field of quantum error correction\nand he will be discus
sing a generalisation of the Pauli stabiliser\nformalism. The new XP stabi
liser formalism allows us to represent a much\nwider set of states and XP
codes have a much richer logical operator\nstructure compared to the Pauli
stabiliser formalism. In addition\, XP\ncodes cannot be classically simul
ated which suggests that they capture\nsome aspects of quantum advantage.\
n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Michael Zurel (University of British Columbia)
DTSTART:20220620T130000Z
DTEND:20220620T140000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/2
DESCRIPTION:Title: Polytope theory and classical simulation of quantum computation wi
th magic states\nby Michael Zurel (University of British Columbia) as
part of Bilkent Quantum Computing Seminar\n\n\nAbstract\nPolytopes come up
in several areas of quantum information science. They appear in the found
ations of quantum theory\, for example through Bell inequalities and nonco
ntextuality inequalities. They are also useful tools in the study of quant
um information processing tasks like quantum computation and quantum commu
nication. Here they can describe separations between the capabilities of c
lassical theories\, quantum theory\, and beyond-quantum theories like the
no-signalling polytope. In this talk I will give an overview of some examp
les of where polytopes are used in quantum computation. In particular\, I
will focus on a few families of polytopes that provide useful descriptions
for a universal model of quantum computation and I will describe how thes
e families of polytopes can be used to characterize the quantum computatio
nal advantage over classical computation. In addition\, I will review some
of the algorithms and tools used for studying these polytopes.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sivert Aasnæss (University of Oxford)
DTSTART:20220704T130000Z
DTEND:20220704T140000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/3
DESCRIPTION:Title: Contextuality as a resource for quantum circuits\nby Sivert Aa
snæss (University of Oxford) as part of Bilkent Quantum Computing Seminar
\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Martti Karvonen (University of Ottawa)
DTSTART:20220801T130000Z
DTEND:20220801T140000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/4
DESCRIPTION:Title: Neither Contextuality nor Nonlocality Admits Catalysts\nby Mar
tti Karvonen (University of Ottawa) as part of Bilkent Quantum Computing S
eminar\n\n\nAbstract\nIn this talk\, I will give an overview of https://ar
xiv.org/abs/2102.07637 \, showing that the resource theory of contextualit
y does not admit catalysts\, i.e.\, there are no correlations that can ena
ble an otherwise impossible resource conversion and still be recovered aft
erward. As a corollary\, we observe that the same holds for nonlocality. A
s entanglement allows for catalysts\, this adds a further example to the l
ist of "anomalies of entanglement\," showing that nonlocality and entangle
ment behave differently as resources. On the way\, I will explain the cons
truction of the resource theories of contextuality and nonlocality\, and d
iscuss some categorical aspects of these. Time permitting\, we will also s
how that catalysis remains impossible even if\, instead of classical rando
mness\, we allow some more powerful behaviors to be used freely in the fre
e transformations of the resource theory.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nicola Pinzani (University of Oxford)
DTSTART:20220808T130000Z
DTEND:20220808T140000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/5
DESCRIPTION:Title: The Topology and Geometry of Causality\nby Nicola Pinzani (Uni
versity of Oxford) as part of Bilkent Quantum Computing Seminar\n\n\nAbstr
act\nIn my talk I am going to present a unified operational\nframework for
the study of causality\, non-locality and contextuality\, in\na fully dev
ice-independent and theory-independent setting. Our\ninvestigation proceed
s from two complementary fronts: a topological one\,\nusing tools from she
af theory\, and a geometric one\, based on polytopes\nand linear programmi
ng. From the topological perspective\, we understand\nexperimental outcome
probabilities as bundles of compatible contextual\ndata over certain topo
logical spaces\, encoding causality constraints.\n From the geometric pers
pective\, we understand the same experimental\noutcome probabilities as po
ints in high-dimensional causal polytopes\,\nwhich we explicitly construct
and fully characterise.\nOur work is a significant extension of both the
established\nAbramsky-Brandenburger framework for contextuality and the cu
rrent body\nof work on indefinite causality. We provide definitions of cau
sal\nfraction and causal separability for empirical models relative to a\n
broad class of causal constraints: this allows us to construct and\ncharac
terise novel examples which explicitly connect causal\ninseparability to n
on-locality and contextuality. In particular\, we\nclearly demonstrate the
existence of "causal contextuality"\, a\nphenomenon where causal structur
e is explicitly correlated to the\nclassical inputs and outputs of local i
nstruments\, so that contextuality\nof the associated empirical model dire
ctly implies causal\ninseparability.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Amy Searle (University of Oxford)
DTSTART:20220919T130000Z
DTEND:20220919T140000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/6
DESCRIPTION:Title: Classifying the Noncontextual Measurement Spaces via the Sheaf App
roach\nby Amy Searle (University of Oxford) as part of Bilkent Quantum
Computing Seminar\n\n\nAbstract\nThe sheaf theoretic approach to contextu
ality\, as has been emphasised before\, is favourable because the generali
ty of the sheaf approach allows for the uncovering of connections to other
fields\, and also because theoretical developments in the active field of
sheaf theory can be directly applied to the context of quantum informatio
n. One such theoretical development\, the application to contextuality of
which was first discussed in [1]\, is Vorob'ev's theorem. In the context o
f quantum information\, it allows us to identify which setups can never ex
hibit contextuality. In this sense\, and by negation\, we know that for ob
servation of non-classical behaviour attention must be focused on the meas
urement setups which do not fall into this category. Besides explaining th
is theorem\, I will discuss some of the other results contained within [1]
\, such as using such principles to derive monogamy of entanglement. I wil
l moreover explain why and how we might hope to extend such results to mor
e general setups\, such as setups where some measurements occur before oth
ers so that there is a temporal ordering on the measurement set.\n\n[1] So
ares Barbosa\, Rui 2015\, 'Contextuality in Quantum Mechanics and Beyond'\
, PhD thesis\, University of Oxford.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/6/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Arne Heimendahl (University of Cologne)
DTSTART:20220912T130000Z
DTEND:20220912T140000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/7
DESCRIPTION:Title: Wigner’s theorem of stabilizer states\nby Arne Heimendahl (U
niversity of Cologne) as part of Bilkent Quantum Computing Seminar\n\n\nAb
stract\nStabilizer states are one of the main components for quantum compu
tation with magic states and the basis for the design of quantum error cor
recting codes.\n\nIn this talk\, I will describe the symmetry group of the
set of stabilizer states for any number of qubits or qudits with d being
an odd prime.\nPreviously\, the group was understood only in the qubit cas
e\, where it coincides with the linear and anti-linear Clifford operations
.\nHowever\, for qudits\, the structure is somewhat richer and depends on
whether one or more than one qudit is considered. \n\nFurthermore\, I will
relate our result to various notions of symmetries that appear in the con
text of quantum systems (such as Wigner and Kadison symmetries) and discus
s some (potential) applications of our result.\n\nBased on joint work with
Valentin Obst and David Gross.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/7/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20221104T113000Z
DTEND:20221104T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/8
DESCRIPTION:Title: Introduction to Measurement-Based Quantum Computing\nby Selman
Ipek (Bilkent University) as part of Bilkent Quantum Computing Seminar\n\
nLecture held in SA 141.\n\nAbstract\nQuantum teleportation is a basic pro
tocol in quantum information science that harnesses many quintessential fe
atures of quantum theory. Here we introduce MBQC by making connections to
quantum teleportation. We will show how basic quantum gates familiar from
the so-called circuit model of quantum computation are performed in the me
asurement-based framework. \nReferences: arXiv:quant-ph/0508124\nAdditiona
l sources: arXiv:quant-ph/0504097\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20221111T113000Z
DTEND:20221111T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/9
DESCRIPTION:Title: Nonlocal correlations as an information-theoretic resource (2005)<
/a>\nby Selman Ipek (Bilkent University) as part of Bilkent Quantum Comput
ing Seminar\n\nLecture held in SA 141.\n\nAbstract\nThe statistics of meas
urement outcomes coming from quantum theory satisfy a principle known as n
o-signaling which prevents faster than light information transfer. It is p
ossible to study statistical models that satisfy this principle independen
tly of quantum theory. Here we introduce the notion of nonsignaling distri
butions and the implications of such models for information processing. \n
References: arXiv:quant-ph/0404097\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Aziz Kharoof (Bilkent University)
DTSTART:20221202T113000Z
DTEND:20221202T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/11
DESCRIPTION:Title: The Sheaf-Theoretic Structure of Definite Causality\nby Aziz
Kharoof (Bilkent University) as part of Bilkent Quantum Computing Seminar\
n\nLecture held in SA 141.\n\nAbstract\nIn its full generality MBQC is ada
ptive: the outcomes of a prior measurement determine the measurement bases
of a subsequent measurement. One possible way to incorporate this adaptiv
ity is by introducing the notion of a causal order. This can be done by in
troducing the notion of partially ordered sets (posets) as a bookkeeping d
evice which takes this causal ordering into account. Here the notion of ca
usal sheaves is introduced\, which in one sense generalizes the sheaf-theo
retic approach to include causal order\, but at the same time considers a
more restricted set of measurement scenarios dealing only with space-like
separated parties.\nReferences: arXiv:1701.01888\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/11/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mehmet Kırtışoğlu (Bilkent University)
DTSTART:20221209T113000Z
DTEND:20221209T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/12
DESCRIPTION:Title: Simplicial quantum contextuality\nby Mehmet Kırtışoğlu (B
ilkent University) as part of Bilkent Quantum Computing Seminar\n\nLecture
held in SA 141.\n\nAbstract\nSimplicial sets are well-known in the mathem
atics community as combinatorial models of topological spaces. Here they a
re utilized for modeling measurement scenarios. The resulting simplicial a
pproach to contextuality generalizes the sheaf-theoretic approach of Abram
sky and Brandenberger. Many standard results like the theorems of Fine\, K
ochen and Specker\, and Gleason can be established from this perspective.
Owing to its generality\, the simplicial approach is a good candidate for
modeling adaptive MBQC.\nReferences: arXiv:2204.06648\nAdditional Sources:
arXiv:0809.4221\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20221216T113000Z
DTEND:20221216T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/13
DESCRIPTION:Title: Nonclassical correlations as a resource for computation\nby S
elman Ipek (Bilkent University) as part of Bilkent Quantum Computing Semin
ar\n\nLecture held in SA 141.\n\nAbstract\nComputational power in MBQC res
ides in the correlations between measurement outcomes. Here we consider an
MBQC scheme that is fully adaptive (feedforward of measurement outcomes i
s allowed)\, but where the classical side processing only performs linear
operations (mod 2 arithmetic). Although such a model is not even universal
for classical computation\, once supplied with a nonclassical resource (e
.g.\, quantum state\, PR box\, etc.)\, it is possible to compute nonlinear
functions within this computational model\, thus promoting the model to c
lassical universality.\nReferences: Anders/Browne (2008): arXiv:0907.5449\
nReferences: Raussendorf (2013): arXiv:0805.1002\nBackground material: arX
iv:0712.0921\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20221223T113000Z
DTEND:20221223T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/14
DESCRIPTION:Title: Generalized Bell Inequality Experiments and Computation\nby S
elman Ipek (Bilkent University) as part of Bilkent Quantum Computing Semin
ar\n\nLecture held in SA 141.\n\nAbstract\nIn the simplified setting of no
n-adaptive MBQC the choice of measurement basis for one local system (e.g.
\, qubit) does not depend on the outcomes of any previous measurements. Th
us non-adaptive MBQC is similar in spirit to Bell-type experiments consist
ing of distant parties that do not communicate. Following Hoban\, et al. w
e consider such Bell-type experiments and study the convex geometry of the
corresponding local and nonlocal regions. Experimental setups with classi
cal statistics that are explained by local hidden variable models (LVH) ar
e found to have limited computational power\, which is related to Bell-typ
e inequalities.\nReferences: arXiv:1009.5213\nReferences: arXiv:1108.4798\
n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/14/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ho Yiu Chung (Bilkent University)
DTSTART:20221230T113000Z
DTEND:20221230T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/15
DESCRIPTION:Title: Contextuality as a resource for measurement-based quantum computa
tion beyond qubits\nby Ho Yiu Chung (Bilkent University) as part of Bi
lkent Quantum Computing Seminar\n\nLecture held in SA 141.\n\nAbstract\nWh
en dealing with an MBQC with binary outcome measurements the following is
true: a nonlinear function is computed if and only if the resource is stro
ngly contextual. However\, this tidy result does not remain true when the
set of outcomes is 𝑑>2. Frembs\, et al. consider the more general case
of 𝑑-outcome measurements and establish that strong contextuality is ne
eded to compute functions (i.e.\, polynomials) of a certain degree not pos
sible for the classical side-processor.\n\nReferences: arXiv:1804.07364\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Igor Sikora (Bilkent University)
DTSTART:20230210T113000Z
DTEND:20230210T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/16
DESCRIPTION:Title: Cohomological framework for contextual quantum computation\nb
y Igor Sikora (Bilkent University) as part of Bilkent Quantum Computing Se
minar\n\nLecture held in SA 141.\n\nAbstract\nCohomological framework for
contextual quantum computation (2019) (Igor)\nIn a previous talk the topol
ogical approach to contextuality was introduced based on chain complexes a
nd cohomology theory. Here many aspects of this framework are carried over
with the explicit goal of studying (temporally flat) MBQC more carefully.
Within this framework two types of topological invariants are identified\
; one relevant for the deterministic case\, while the other for the probab
ilistic case. An essential takeaway is that the outputs of a computation w
ithin this formalism are directly related to these topological invariants\
, thus the “hardness” of the computation is characterized by equivalen
ce classes related to topology.\n\nReferences: arXiv:1602.04155\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/16/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20230217T113000Z
DTEND:20230217T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/17
DESCRIPTION:Title: Putting paradoxes to work: contextuality in measurement-based qua
ntum computation\nby Selman Ipek (Bilkent University) as part of Bilke
nt Quantum Computing Seminar\n\nLecture held in SA 141.\n\nAbstract\nThe t
opological approach to MBQC based on arXiv:1701.01888 and arXiv:1602.04155
deals with the temporally flat case. One possible avenue to accommodating
adaptivity is discussed using a so-called “iffy” proof.\n\nReferences
: arXiv:2208.06624\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/17/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Ho Yiu Chung (Bilkent University)
DTSTART:20230203T113000Z
DTEND:20230203T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/18
DESCRIPTION:Title: Contextuality as a resource for measurement-based quantum computa
tion beyond qubits\nby Ho Yiu Chung (Bilkent University) as part of Bi
lkent Quantum Computing Seminar\n\nLecture held in SA 141.\n\nAbstract\nWh
en dealing with an MBQC with binary outcome measurements the following is
true: a nonlinear function is computed if and only if the resource is stro
ngly contextual. However\, this tidy result does not remain true when the
set of outcomes is $d>2$. Frembs\, et al. consider the more general case o
f $d$-outcome measurements and establish that strong contextuality is need
ed to compute functions (i.e.\, polynomials) of a certain degree not possi
ble for the classical side-processor.\n\nReferences: arXiv:1804.07364\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/18/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20230303T113000Z
DTEND:20230303T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/19
DESCRIPTION:Title: Introduction to the Stabilizer Formalism\nby Selman Ipek (Bil
kent University) as part of Bilkent Quantum Computing Seminar\n\nLecture h
eld in SA 141.\n\nAbstract\nIn the finite-dimensional regime certain pure
quantum states can be completely characterized by maximal abelian (i.e.\,
commuting) subgroups of the Pauli group. These are called stabilizer state
s and well-known examples include Bell as well as Greenberger\, Horne\, Ze
ilinger states. The stabilizer formalism is a subtheory of finite-dimensio
nal quantum mechanics consisting of stabilizer states\, Clifford unitaries
(i.e.\, unitaries that map one Pauli operator to another)\, and measureme
nt of Pauli observables. The ability to fully describe such quantum states
in group theoretic terms makes their analysis extremely convenient and th
ey play an important role in quantum information processing and also quant
um error correction. A key result for our purposes in this seminar is the
celebrated Gottesman-Knill theorem which establishes that any quantum circ
uit built out of stabilizer states\, Clifford unitaries\, and Pauli measur
ements (called stabilizer circuits) can be efficiently simulated on a clas
sical computer.\n\nReferences: arXiv:quant-ph/9807006\n\nReferences: Niels
en/Chuang: QCQI (Ch. 10)\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20230317T113000Z
DTEND:20230317T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/20
DESCRIPTION:Title: Improved Simulation of Stabilizer Circuits\nby Selman Ipek (B
ilkent University) as part of Bilkent Quantum Computing Seminar\n\nLecture
held in SA 141.\n\nAbstract\nThe Gottesman-Knill theorem establishes that
stabilizer circuits (defined previously) can be simulated efficiently on
a classical computer. In arXiv:quant-ph/0406196 Aaronson and Gottesman imp
rove the efficiency of the classical simulation and demonstrate that stabi
lizer circuits are (most likely) not universal for classical computation.
Circuits that are otherwise stabilizer with the exception of a small numbe
r of non-Clifford gates are also considered and the complexity of such cir
cuits scales exponentially with the number of non-Clifford gates.\n\nRefer
ences: arXiv:quant-ph/0406196\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20230324T113000Z
DTEND:20230324T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/21
DESCRIPTION:Title: Universal Quantum Computation with ideal Clifford gates and noisy
ancillas\nby Selman Ipek (Bilkent University) as part of Bilkent Quan
tum Computing Seminar\n\nLecture held in SA 141.\n\nAbstract\nIn studying
the resources necessary to achieve a quantum speedup it is useful to disti
nguish between operations that are (a) free\, or (b) costly. The fact that
stabilizer circuits can be efficiently classically simulated suggests tha
t stabilizer operations be designated as free. This begs the question of w
hether it is possible to augment the free stabilizer operations with an ad
ditional costly resource (to be consumed) which promotes stabilizer circui
ts to quantum universality. Bravyi and Kitaev (arXiv:quant-ph/0403025) dem
onstrate that there are certain quantum states (deemed “magic”) which
achieve precisely this. They also detail a protocol for distilling such ma
gic states from a collection of noisy ancilla states.\n\nReferences: arXiv
:quant-ph/0403025\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20230331T113000Z
DTEND:20230331T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/22
DESCRIPTION:Title: Quantum universality and magic state distillation\nby Selman
Ipek (Bilkent University) as part of Bilkent Quantum Computing Seminar\n\n
Lecture held in SA 141.\n\nAbstract\nStabilizer circuits can be promoted t
o quantum universality via the injection of magic states. An open question
is the determination of precisely which non-stabilizer quantum states can
be considered “magic”. Following Reichardt\, we discuss magic state d
istillation protocols that tighten the boundary between the classically ef
ficiently simulatable regime and that of full universal quantum computatio
n.\n\nReferences: arXiv:0608085\n\nReferences: https://core.ac.uk/download
/pdf/44132852.pdf\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/22/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20230414T113000Z
DTEND:20230414T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/23
DESCRIPTION:Title: Trading classical and quantum resources\nby Selman Ipek (Bilk
ent University) as part of Bilkent Quantum Computing Seminar\n\nLecture he
ld in SA 141.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/23/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20230522T103000Z
DTEND:20230522T120000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/24
DESCRIPTION:Title: Quasiprobability methods in classical simulation (I)\nby Selm
an Ipek (Bilkent University) as part of Bilkent Quantum Computing Seminar\
n\nLecture held in SA 141.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/24/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Mark Howard (University of Galway)
DTSTART:20230407T113000Z
DTEND:20230407T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/25
DESCRIPTION:Title: Topics in Stabilizer Quantum Computation\nby Mark Howard (Uni
versity of Galway) as part of Bilkent Quantum Computing Seminar\n\nLecture
held in SA 141.\n\nAbstract\nThe central question in quantum information
theory is to delineate the operational capabilities achievable under the r
ules of quantum mechanics but not achievable with classical physics. As su
ch\, it can be useful to tinker with hypothetical theories having differen
t sets of allowed state preparations\, transformations and measurements\;
different combinations can give us theories that are less powerful than\,
equal to\, or more powerful than quantum mechanics. When we attempt to und
erstand the computational power of circuits\, so-called stabilizer circuit
s comprise a restricted class that are provably weaker than a general (“
universal”) quantum computer. For stabilizer circuits\, the description
of the achievable states and their updates is efficient leading to a class
ical simulation algorithm that is polynomial in the number of qubits. Rema
rkably\, it is easy to boost the power of stabilizer circuits to that of a
universal quantum computer by adding access to non-stabilizer states or o
perations. When error-correction is used these additional states or operat
ions are typically very costly. All of the above naturally suggests a few
questions that I will address:\n\n1) How should we classically simulate st
abilizer circuits interspersed with a few non-stabilizer gates\, and how d
oes the runtime scale?\n\n2) How can we minimize the use of costly non-sta
bilizer operations?\n\n3) What quantum mechanical property is missing from
stabilizer circuits but present in universal quantum computers?\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/25/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Hakop Pashayan (Freie Universität Berlin)
DTSTART:20230526T113000Z
DTEND:20230526T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/26
DESCRIPTION:Title: Classical simulation of quantum circuits\nby Hakop Pashayan (
Freie Universität Berlin) as part of Bilkent Quantum Computing Seminar\n\
nLecture held in SA 141.\n\nAbstract\nI will give some background on class
ical simulation then I will present a general framework for simulating qua
ntum circuits using quasiprobabilistic methods. Through examples\, I will
demonstrate the strengths of this approach in its runtime performance\, fl
exibility and generality.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/26/
END:VEVENT
BEGIN:VEVENT
SUMMARY:James Seddon (Phasecraft)
DTSTART:20230512T113000Z
DTEND:20230512T130000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/27
DESCRIPTION:Title: Stabilizer simulation methods for mixed magic states and noisy ch
annels\nby James Seddon (Phasecraft) as part of Bilkent Quantum Comput
ing Seminar\n\nLecture held in SA 141.\n\nAbstract\nIt has been known sinc
e the early days of the stabilizer formalism that while Clifford circuits
with stabilizer state inputs can be simulated efficiently in the number of
qubits and operations\, more general circuits can be simulated with an ov
erhead growing exponentially with\, for example\, the number of T gates\,
or some other "magic" resource. Quantifiers of magic resource known as mag
ic monotones formalize the notion that some states/operations are harder t
o simulate than others\, and various classical simulation algorithms have
been proposed where performance guarantees depend explicitly on some magic
monotone. A sequence of works on stabilizer rank culminated in the powerf
ul simulator of Ref. [1]\, which reduces runtime by replacing an exact sta
bilizer decomposition with a sparsified approximation\, but is largely res
tricted to simulating pure state evolution. Meanwhile\, a parallel avenue
of research developed links between quasiprobability simulation methods an
d robustness-type monotones [2\, 3]\, yielding the insight that noisier ci
rcuits can be easier to simulate. Simulators of this type admit mixed init
ial states and more general quantum channels\, but tend to be slower than
stabilizer rank-based methods. In this seminar I will outline how stabiliz
er rank methods can be extended to deal with mixed magic states [4] and no
isy non-Clifford operations [5]\, in the process improving on the runtime
bounds of Ref. [1]. I will also discuss how this method (and the others in
troduced in Ref. [4]) can be situated within a broader framework of simula
tors for general quantum circuits on qubits\, each with an associated magi
c monotone\, showing that stabilizer rank and quasiprobability methods are
more closely related than they first appear.\n\n[1] Bravyi\, Browne\, Cal
pin\, Campbell\, Gosset & Howard (2019) arxiv:1808.00128\n\n[2] Pashayan\,
Wallman & Bartlett (2015) arxiv:1503.07525\n\n[3] Howard & Campbell (2017
) arxiv:1609.07488\n\n[4] Seddon\, Regula\, Pashayan\, Ouyang and Campbell
(2021) arxiv:2002.06181\n\n[5] Seddon (2022) https://discovery.ucl.ac.uk/
id/eprint/10146361/\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/27/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Walker Stern (Bilkent University)
DTSTART:20240209T110000Z
DTEND:20240209T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/28
DESCRIPTION:Title: Introduction to Category Theory\nby Walker Stern (Bilkent Uni
versity) as part of Bilkent Quantum Computing Seminar\n\nLecture held in S
A 141.\n\nAbstract\nThough category theory often feels abstruse when first
encountered\, it rests upon a few simple definitions which draw on common
alities in mathematical arguments. In this preliminary talk\, we present s
ome of the basic definitions of category theory\, and illustrate them thro
ugh numerous examples. To wit\, we will discuss categories\, functors\, na
tural transformations. The talk will conclude with a discussion of univers
al properties and (co)limits\, with a particular emphasis on (co)products.
\n\nReferences:\n\n1. Emily Riehl. Category theory in Context. Dover\, 201
6. Chapters 1 & 2\n\n2. Tom Leinster. Basic Category Theory. Cambridge\, 2
014. Chapter 1\n\n3. Saunders Mac Lane. Categories for the Working Mathema
tician. Springer GTM volume 5\, 1978.\nChapter\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/28/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20240216T110000Z
DTEND:20240216T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/29
DESCRIPTION:Title: Motivating Categorical Quantum Mechanics\nby Selman Ipek (Bil
kent University) as part of Bilkent Quantum Computing Seminar\n\nLecture h
eld in SA 141.\n\nAbstract\nCircuit diagrams\, such as those that implemen
t quantum protocols have long been a useful tool in the\nfield of quantum
information and computation. Such diagrams\, in fact\, have a marked simil
arity to string\ndiagrams appearing in category theory\, an analogy that w
as made precise by the seminal work of Abramsky\nand Coecke [1]. Here we i
llustrate the naturalness of the categorical setting for describing quantu
m protocols\nusing the example of quantum teleportation [1\, §2.1] and mo
tivate the kind of structures that will be needed\nto faithfully realize s
uch quantum processes. Key notions in quantum theory\, such as state\, tra
nsformation\,\nand measurement will be stated in a fully categorical langu
age [1\, §6] whose precise meaning will be unpacked\nin subsequent talks.
\n\nReferences:\n\n1. Abramsky\, Samson\, and Bob Coecke. “Categorical q
uantum mechanics.” Handbook of quantum logic\nand quantum structures 2 (
2009): 261-325. Section 2.\n\n2. Heunen\, Chris\, and Jamie Vicary. Catego
ries for Quantum Theory: an introduction. Oxford University\nPress\, 2019.
Chapter 0.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/29/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Walker Stern (Bilkent University)
DTSTART:20240223T110000Z
DTEND:20240223T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/30
DESCRIPTION:Title: Symmetric Monoidal Categories (I)\nby Walker Stern (Bilkent U
niversity) as part of Bilkent Quantum Computing Seminar\n\nLecture held in
SA 141.\n\nAbstract\nWe will introduce monoidal categories and symmetric
monoidal categories (SMCs) as well as the string\ndiagrams which provide g
raphical calculi for computations in SMCs (Primary reference: [1\,Ch. 1]\,
secondary\nreferences: [2\, §3.1\, §3.3]\, [5\, Ch. XI]\, [3\, Ch. 3]\,
[4\, Track 1]). We define dual objects and duality data\nin a SMC (Primar
y reference: [1\, Ch. 3]\, secondary references: [2\,§3.3]\, [4\, Track 1
]). We illustrate these\ndefinitions with examples drawn from categories o
f vector spaces\, categories of finite dimensional Hilbert\nspaces\, and s
everal others.\n\nReferences:\n\n1. Heunen\, Chris\, and Jamie Vicary. Cat
egories for Quantum Theory: an introduction. Oxford University\nPress\, 20
19.\n\n2. Samson Abramsky and Bob Coecke. Categorical Quantum Mechanics. a
rXiv:0808.1023\n\n3. Peter Selinger. A survey of graphical languages for m
onoidal categories. arXiv:0908.3347\n\n4. John Baez. Quantum Gravity Semin
ar - Fall 2000. online notes\n\n5. Saunders Mac Lane. Categories for the W
orking Mathematician. Springer GTM volume 5\, 1978.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/30/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Redi Haderi (Bilkent University)
DTSTART:20240301T110000Z
DTEND:20240301T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/31
DESCRIPTION:Title: Symmetric Monoidal Categories (II)\nby Redi Haderi (Bilkent U
niversity) as part of Bilkent Quantum Computing Seminar\n\nLecture held in
SA 141.\n\nAbstract\nThe structure involved in a symmetric monoidal categ
ory is very broad\, which is of benefit to the general\ntheory. However\,
quantum mechanics\, which is typically formulated using Hilbert spaces\, r
equires substantially more structure than is present in an arbitrary SMC.
In particular\, the notions of conjugation and transpose are of key impor
t in the study of quantum mechanics. In this talk\, we introduce dagger st
ructures\non categories\, and dagger SMCs\, which axiomatize some of the n
ecessary structure (Primary reference: [1\,\n§4.3]\, secondary reference:
[2\,§2.3.1]). We then discuss internal mapping objects and compact close
d categories (Primary reference: [1.§4.3]\, secondary references: [2\,§
3.4]\, [3]). We motivate these definitions for the\nfeatures of the catego
ry of finite dimensional Hilbert Spaces\, and provide other examples throu
ghout.\n\nReferences:\n\n1. Abramsky\, Samson\, and Bob Coecke. Categorica
l quantum mechanics. Handbook of quantum logic\nand quantum structures 2 (
2009): 261-325.\n\n2. Heunen\, Chris\, and Jamie Vicary. Categories for Qu
antum Theory: an introduction. Oxford University\nPress\, 2019.\n\n3. Bria
n Day Note on compact closed categories. (doi: 10.1017/S1446788700020334).
\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/31/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Walker Stern (Bilkent University)
DTSTART:20240315T110000Z
DTEND:20240315T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/32
DESCRIPTION:Title: Symmetric Monoidal Categories (III)\nby Walker Stern (Bilkent
University) as part of Bilkent Quantum Computing Seminar\n\nLecture held
in SA 141.\n\nAbstract\nIn a symmetric monoidal category\, the set of maps
from the monoidal unit to itself inherits additional\nstructure. These sc
alars in the category are inspired by\, for instance\, the isomorphism bet
ween linear maps\nfrom $\\mathbb{C}$ to itself and the field $\\mathbb{C}$
. However\, the additive structure and the notion of traces which are key
to\nthe computation of quantum probabilities require some development. In
this talk\, we describe biproducts\nand distributivity in (symmetric monoi
dal) category\, and the concomitant structures induced on scalars in\na sy
mmetric monoidal category (Primary reference: [1\, §5]\, secondary refere
nces: [2\,§2.2.3]). We introduce\ncategorical definitions of traces and p
artial traces\, the latter familiar in quantum information theory as\na pr
ocedure for obtaining information about a subsystem (Primary reference: [2
\, §4.6\, §5.1]\, secondary\nreference: [1\, §2.1\, §2.2]\, [3]).\n\nR
eferences:\n\n1. Abramsky\, Samson\, and Bob Coecke. Categorical quantum m
echanics. Handbook of quantum logic\nand quantum structures 2 (2009): 261-
325.\n\n2. Heunen\, Chris\, and Jamie Vicary. Categories for Quantum Theor
y: an introduction. Oxford University\nPress\, 2019.\n\n3. Andre Joyal\, R
oss Street\, and Dominic Verity. Traced Monoidal Categories. (doi:10.1017/
S0305004100074338).\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/32/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20240322T110000Z
DTEND:20240322T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/33
DESCRIPTION:Title: Categorical Quantum Mechanics\nby Selman Ipek (Bilkent Univer
sity) as part of Bilkent Quantum Computing Seminar\n\nLecture held in SA 1
41.\n\nAbstract\nHaving built up the machinery of dagger SMCs\, we revisit
the motivating discussion and restate the\naxioms of quantum mechanics in
a categorical language [1\, §6]. The Born rule for computing probabiliti
es\ncan be derived from this point of view [1\, §6.1]. A number of quantu
m protocols can also be described within\nthis formalism (e.g.\, logic gat
e teleportation and entanglement swapping) with the aid of the diagramatic
\ncalculus.\n\nReferences:\n\n1. Abramsky\, Samson\, and Bob Coecke. Categ
orical quantum mechanics. Handbook of quantum logic\nand quantum structure
s 2 (2009): 261-325. Section 6.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/33/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Redi Haderi (Bilkent University)
DTSTART:20240329T110000Z
DTEND:20240329T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/34
DESCRIPTION:Title: No-cloning theorem in categorical quantum mechanics\nby Redi
Haderi (Bilkent University) as part of Bilkent Quantum Computing Seminar\n
\nLecture held in SA 141.\n\nAbstract\nAs with many algebraic structures\,
the conditions and data which define a monoid structure on a set can\nbe
reframed diagrammatically\, leading to the notion of a monoid object in a
monoidal category. Dualizing this\ndefinition provides the notion of a com
onoid. In this talk\, we introduce and discuss monoids and comonoids\nin S
MCs. These structures can be used to prove that any category with a notion
of uniform deleting or\nuniform copying (or cloning) cannot describe quan
tum theory.\n\nReferences:\n\n1. Heunen\, Chris\, and Jamie Vicary. Catego
ries for Quantum Theory: an introduction. Oxford University\nPress\, 2019.
Chapter 4.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/34/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Victor Torres Castillo (Bilkent University)
DTSTART:20240405T110000Z
DTEND:20240405T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/35
DESCRIPTION:Title: Frobenius algebras and complementarity\nby Victor Torres Cast
illo (Bilkent University) as part of Bilkent Quantum Computing Seminar\n\n
Lecture held in SA 141.\n\nAbstract\nIn quantum theory observables that do
not commute are considered incompatible. Maximally incompatible\, or comp
lementary\, observables are such that measurement of one destroys all info
rmation about the\nother. This property is modeled in CQM using the notion
of Frobenius algebras. These Frobenius algebras\nmay be seen as an enhanc
ement of the monoids discussed in the previous talk using the theory of du
ality in\nsymmetric monoidal categories. We will additionally discuss extr
a properties and structures on Frobenius\nalgebras\, in particular\, dagge
r Frobenius algebras. Frobenius algebras are also of substantial importanc
e in\nthe study of topological quantum field theory (TQFT).\n\nReferences:
\n\n1. Heunen\, Chris\, and Jamie Vicary. Categories for Quantum Theory: a
n introduction. Oxford University\nPress\, 2019. Chapter 5\, Chapter 6.\n\
n2. Joachim Kock. Frobenius algebras and 2D topological quantum field theo
ries. Cambridge\, 2010.\nSection 3.6.\n\n3. Bob Coecke\, Dusko Pavlovic an
d Jamie Vicary. A new description of orthogonal bases. Mathematical\nStruc
tures in Computer Science (2012).\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/35/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20240503T110000Z
DTEND:20240503T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/37
DESCRIPTION:Title: Complete positivity\nby Selman Ipek (Bilkent University) as p
art of Bilkent Quantum Computing Seminar\n\nLecture held in SA 141.\n\nAbs
tract\nTo handle a theory of mixed states — essential to the study of qu
antum mechanics — it is necessary to\nconsider completely positive maps
in a compact closed dagger monoidal category $\\mathcal{C}$. We will defin
e mixed\nstates and completely positive maps\, and show how this leads to
the construction of a category $\\text{CP}(\\mathcal{C})$\, whose\nobjects
are certain Frobenius algebras in $\\mathcal{C}$\, and whose morphisms ar
e completely positive morphisms. We\nwill then discuss how both classical
statistical mechanics and quantum mechanics can be expressed in the\ncateg
ory $\\text{CP}(\\mathcal{C})$.\n\nReferences:\n\n1. Heunen\, Chris\, and
Jamie Vicary. Categories for Quantum Theory: an introduction. Oxford Unive
rsity\nPress\, 2019. Chapter 7\n\n2. Selinger\, Peter. Dagger Compact Clos
ed Categories and Completely Positive Maps. Electronic Notes\nin Theoretic
al Computer Science 170 (2007) 139–163\n\n3. Coecke\, Bob and Heunen\, C
hris. Pictures of complete positivity in arbitrary dimension. Information\
nand Computation 250 (2016) 50–58\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/37/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Redi Haderi (Bilkent University)
DTSTART:20240510T110000Z
DTEND:20240510T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/38
DESCRIPTION:Title: Bicategories and monoidal bicategories\nby Redi Haderi (Bilke
nt University) as part of Bilkent Quantum Computing Seminar\n\nLecture hel
d in SA 141.\n\nAbstract\nTo study categorifications of Hilbert spaces\, i
t is necessary to consider higher categories. In this talk we will\ndevelo
p the idea of bicategories and monoidal bicategories\, and explain the gra
phical calculus which will\nuse them. We will then discuss duality and ful
ly dualizability in monoidal categories\, and finish the talk by\ndiscussi
ng oriented structures and oriented duals.\n\nReferences:\n\n1. Heunen\, C
hris\, and Jamie Vicary. Categories for Quantum Theory: an introduction. O
xford University\nPress\, 2019. Chapter 8\n\n2. Leinster\, Tom. Higher Ope
rads\, Higher Categories. Cambridge University Press\, 2010. Section 1.5\n
\n3. Baez\, John and Neuchl\, Martin. Higher-Dimensional Algebra I: Braide
d Monoidal 2-Categories.\narXiv:q-alg/9511013\n\n4. Schommer-Pries\, Chris
topher. The Classification of Two-Dimensional Extended Topological Field\n
Theories. arXiv:1112.1000. Chapter 2.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/38/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Walker H. Stern (Bilkent University)
DTSTART:20240517T110000Z
DTEND:20240517T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/39
DESCRIPTION:Title: Higher quantum theory and 2-Hilbert spaces\nby Walker H. Ster
n (Bilkent University) as part of Bilkent Quantum Computing Seminar\n\nLec
ture held in SA 141.\n\nAbstract\nIn this talk\, we will discuss categorif
ications of Hilbert spaces\, called $\\textit{2-Hilbert spaces}$. In much
the same\nway as Hilbert spaces are sets with linear structures and inner
products satisfying a completeness condition\,\n2-Hilbert spaces are categ
ories with linear structures and inner products on their hom-sets\, satisf
ying a\ncategorical completeness condition. We will develop the monoidal b
icategory of 2-Hilbert spaces\, and discuss\nhow teleportation and quantum
dense coding manifest in this framework.\n\nReferences:\n\n1. Heunen\, Ch
ris\, and Jamie Vicary. Categories for Quantum Theory: an introduction. Ox
ford University\nPress\, 2019. Chapter 8\n\n2. Baez\, John. Higher-dimensi
onal algebra II: 2-Hilbert spaces. Advances in Mathematics\, 127(2):125–
189\,\n1997. Chapters 1-4\n\n3. Bartlett\, Bruce. On unitary 2-representat
ions of finite groups and topological quantum field theory.\narXiv:0901.39
75. Sections 3.1\, 3.2\, & 3.3.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/39/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20240419T110000Z
DTEND:20240419T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/40
DESCRIPTION:Title: Categorical treatment of the Deutsch-Jozsa algorithm\nby Selm
an Ipek (Bilkent University) as part of Bilkent Quantum Computing Seminar\
n\nLecture held in SA 141.\n\nAbstract\nThe Deutsch-Jozsa problem is a can
onical example of a problem that can be solved by a quantum computer expon
entially faster than a classical deterministic computer. Here we begin by
describing the Deutsch-Jozsa problem and its solution according to standar
d quantum theory [1\, §I.B]. We then describe how the solution works in c
ategorical terms by building off of the notion of complementary structures
and Frobenius algebras built up in the previous talks.\n\nReferences:\n\n
1. Vicary\, Jamie. Topological structure of quantum algorithms. arXiv prep
rint arXiv:1209.3917 (2013).\n\n2. Heunen\, Chris\, and Jamie Vicary. Cate
gories for Quantum Theory: an introduction. Oxford University\nPress\, 201
9. Chapter 6\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/40/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20240426T110000Z
DTEND:20240426T123000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/41
DESCRIPTION:Title: Applications of Categorical Quantum Mechanics to quantum computat
ion: ZX calculus\nby Selman Ipek (Bilkent University) as part of Bilke
nt Quantum Computing Seminar\n\nLecture held in SA 141.\n\nAbstract\nSever
al quintessentially quantum notions\, such as no-cloning\, no-deleting\, a
s well as classical and complementary structures can be made precise in th
e categorical approach to quantum mechanics. The so-called ZX calculus con
sists of two complementary classical structures on an underlying object in
a compact dagger category. Many quantum gates used in quantum computation
have natural representations in the ZX-calculus. In this talk we will giv
e the main definition of the ZX-calculus and highlight interesting aspects
of the formalism\; e.g.\, ZX-calculus is sound and (approximately) univer
sal for quantum computation. Time permitting\, we will make connections to
the measurement-based model of quantum computation. \n\nReferences:\n\n1.
Heunen\, Chris\, and Jamie Vicary. Categories for Quantum Theory: an intr
oduction. Oxford University\nPress\, 2019. Chapter 6\n\n2. Coecke\, Bob\,
and Ross Duncan. Interacting quantum observables: categorical algebra and
diagrammatics. New J. Phys (13)\, 2011. arXiv: 0906.4725\n\n3. Duncan\, Ro
ss. A graphical approach to measurement-based quantum computing. arXiv pre
print arXiv:1203.6242\, 2012.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/41/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART:20250401T143000Z
DTEND:20250401T153000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/42
DESCRIPTION:Title: Universal blind measurement-based quantum computations\nby Se
lman Ipek (Bilkent University) as part of Bilkent Quantum Computing Semina
r\n\nLecture held in SA 141.\n\nAbstract\nWe consider a scenario in which
a client (Alice) with limited computational power\nwishes to perform unive
rsal quantum computations via a server (Bob) without revealing their\nunde
rlying computation. In this talk we discuss an interactive client-server p
rotocol due to\nBroadbent\, et al. [1]. This protocol requires no computat
ional assumptions and has perfect\nprivacy\, i.e.\, the server learns noth
ing about the client'\;s inputs\, outputs\, or desired\ncomputation. Fu
rthermore\, the protocol is formulated using measurement-based quantum\nco
mputing (MBQC)\, which is an alternative universal model of quantum comput
ation driven\nby single-qubit measurements on an entangled resource state.
For the purposes of private\nquantum computations\, a new universal resou
rce for MBQC\, called the brickwork state\, is\nidentified and universalit
y is established. Time permitting\, we also discuss variations of the\nori
ginal protocol with quantum inputs and quantum outputs\, as well as a prot
ocol for the\nclient to authenticate the results they receive from the ser
ver.\n[1] A. Broadbent\, J. Fitzsimons\, E. Kashefi. Universal Blind Quant
um Computation. 2009\n50th Annual IEEE Symp. on Found. of Comp. Sci. DOI:
10.1109/FOCS.2009.36.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/42/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Moises Bermejo Moran
DTSTART:20250408T143000Z
DTEND:20250408T153000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/43
DESCRIPTION:Title: Graph-theoretical contextuality II\nby Moises Bermejo Moran a
s part of Bilkent Quantum Computing Seminar\n\nLecture held in SA 141.\n\n
Abstract\nWe continue our review of “A combinatorial approach to nonloca
lity and contextuality”\, by Acín\, Fritz\, Leverrier and Sainz (2012).
Classical and non-signalling correlations in contextuality scenarios are
described with two graph invariants of the graph capturing the compatibili
ty between the outcomes. While quantum correlations can be approximated wi
th graph invariants\, a full characterisation requires the contextuality h
ypergraph. Remarkably\, such characterisation can be achieved with a compl
ete hierarchy of outer approximations corresponding with semidefinite prog
rams.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/43/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Moises Bermejo Moran (Bilkent University)
DTSTART:20250422T143000Z
DTEND:20250422T153000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/44
DESCRIPTION:Title: Graph-theoretical contextuality III\nby Moises Bermejo Moran
(Bilkent University) as part of Bilkent Quantum Computing Seminar\n\nLectu
re held in SA 141.\n\nAbstract\nWe will conclude our review of the combina
torial approach to contextuality proposed in Acín-Fritz-Leverrier-Sainz (
2012) with the complete hierarchy of semidefinite programming approximatio
ns to the set of quantum correlations. The first level of this hierarchy c
oincides with the Lovász approximation capturing almost quantum models th
at we discussed during the last session.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/44/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Giacomo Nannicini (University of Southern California)
DTSTART:20250506T153000Z
DTEND:20250506T163000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/45
DESCRIPTION:Title: Quantum optimization: challenges and opportunities\nby Giacom
o Nannicini (University of Southern California) as part of Bilkent Quantum
Computing Seminar\n\nLecture held in SA 141.\n\nAbstract\nThis talk gives
an optimizer's perspective on what is known\nabout the expected or potent
ial utility of quantum computers for\nmathematical optimization. We will s
ee that even if some of the\nexisting research trends require empirical va
lidation and have escaped\nrigorous theoretical characterization of potent
ial advantage\, other\nareas of quantum optimization are supported by well
-established\nquantum subroutines\, which open up many interesting possibi
lities in\nthe era of fault-tolerant quantum computation\, and possibly ev
en\nbefore.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/45/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Stefano Pironio (Université libre de Bruxelles)
DTSTART:20250527T143000Z
DTEND:20250527T153000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/48
DESCRIPTION:Title: Certification of quantum correlations at arbitrary distances thro
ugh routed Bell tests\nby Stefano Pironio (Université libre de Bruxel
les) as part of Bilkent Quantum Computing Seminar\n\nLecture held in SA 14
1.\n\nAbstract\nTransmission loss represents a major obstacle to the devic
e-independent certification of quantum correlations over long distances\,
limiting applications such as device-independent quantum key distribution
(DIQKD). In this talk\, I'll introduce the concept of routed Bell experime
nts\, in which a particle sent to one side can be measured either near or
far from the source. I'll show how routed Bell tests involving only entang
led qubits can be used to certify quantum correlations even in the presenc
e of arbitrary loss on the channel to the distant device. This is achieved
by adapting concepts from self-testing and quantum steering to the routed
Bell test framework. Finally\, as a natural extension of our approach\, I
'll outline a DIQKD protocol that\, in principle\, is secure over arbitrar
y distances.\nReference: arXiv:2502.12241\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/48/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Sahil Imtiyaz (Basque Center for Applied Mathematics)
DTSTART:20251017T123000Z
DTEND:20251017T133000Z
DTSTAMP:20260422T212554Z
UID:BilkentMathGrad/49
DESCRIPTION:Title: Computation and Quantum Contextuality\nby Sahil Imtiyaz (Basq
ue Center for Applied Mathematics) as part of Bilkent Quantum Computing Se
minar\n\nLecture held in SA 141.\n\nAbstract\nAbramsky and Brandenburger s
how that nonlocality and contextuality arise when locally compatible data
cannot be glued into a single global assignment. In a global topological d
ata space\, interactions among locally defined maps can produce patterns t
hat are consistent within each context yet incompatible globally—the emp
irical hallmark of quantum contextuality. We make this concrete with an ev
olving simplicial-bundle perspective and apply this framework to several s
tandard empirical models in quantum foundations. Finally\, we outline a mo
del of computation built on these structures that captures contextual beha
vior not natively handled by classical Turing-style interactive models.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/49/
END:VEVENT
END:VCALENDAR