BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Mark Webster (University of Sydney)
DTSTART;VALUE=DATE-TIME:20220606T090000Z
DTEND;VALUE=DATE-TIME:20220606T100000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
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 University Quantum Computing Seminar\n\n\nAbstrac
t\nMark Webster works in the field of quantum error correction\nand he wil
l be discussing a generalisation of the Pauli stabiliser\nformalism. The n
ew XP stabiliser formalism allows us to represent a much\nwider set of sta
tes and XP codes have a much richer logical operator\nstructure compared t
o the Pauli stabiliser formalism. In addition\, XP\ncodes cannot be classi
cally simulated 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;VALUE=DATE-TIME:20220620T130000Z
DTEND;VALUE=DATE-TIME:20220620T140000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
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 University Quantum Computing Seminar\n\n\nAbstract\nPolyto
pes come up in several areas of quantum information science. They appear i
n the foundations of quantum theory\, for example through Bell inequalitie
s and noncontextuality inequalities. They are also useful tools in the stu
dy of quantum information processing tasks like quantum computation and qu
antum communication. Here they can describe separations between the capabi
lities of classical theories\, quantum theory\, and beyond-quantum theorie
s like the no-signalling polytope. In this talk I will give an overview of
some examples of where polytopes are used in quantum computation. In part
icular\, I will focus on a few families of polytopes that provide useful d
escriptions for a universal model of quantum computation and I will descri
be how these families of polytopes can be used to characterize the quantum
computational 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;VALUE=DATE-TIME:20220704T130000Z
DTEND;VALUE=DATE-TIME:20220704T140000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/3
DESCRIPTION:Title: Contextuality as a resource for quantum circuits\nby Sivert Aa
snæss (University of Oxford) as part of Bilkent University Quantum Comput
ing Seminar\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Martti Karvonen (University of Ottawa)
DTSTART;VALUE=DATE-TIME:20220801T130000Z
DTEND;VALUE=DATE-TIME:20220801T140000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/4
DESCRIPTION:Title: Neither Contextuality nor Nonlocality Admits Catalysts\nby Mar
tti Karvonen (University of Ottawa) as part of Bilkent University Quantum
Computing Seminar\n\n\nAbstract\nIn this talk\, I will give an overview of
https://arxiv.org/abs/2102.07637 \, showing that the resource theory of c
ontextuality does not admit catalysts\, i.e.\, there are no correlations t
hat can enable an otherwise impossible resource conversion and still be re
covered afterward. As a corollary\, we observe that the same holds for non
locality. As entanglement allows for catalysts\, this adds a further examp
le to the list of "anomalies of entanglement\," showing that nonlocality a
nd entanglement behave differently as resources. On the way\, I will expla
in the construction of the resource theories of contextuality and nonlocal
ity\, and discuss some categorical aspects of these. Time permitting\, we
will also show that catalysis remains impossible even if\, instead of clas
sical randomness\, we allow some more powerful behaviors to be used freely
in the free transformations of the resource theory.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/4/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Nicola Pinzani (University of Oxford)
DTSTART;VALUE=DATE-TIME:20220808T130000Z
DTEND;VALUE=DATE-TIME:20220808T140000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/5
DESCRIPTION:Title: The Topology and Geometry of Causality\nby Nicola Pinzani (Uni
versity of Oxford) as part of Bilkent University Quantum Computing Seminar
\n\n\nAbstract\nIn my talk I am going to present a unified operational\nfr
amework for the study of causality\, non-locality and contextuality\, in\n
a fully device-independent and theory-independent setting. Our\ninvestigat
ion proceeds from two complementary fronts: a topological one\,\nusing too
ls from sheaf theory\, and a geometric one\, based on polytopes\nand linea
r programming. From the topological perspective\, we understand\nexperimen
tal outcome probabilities as bundles of compatible contextual\ndata over c
ertain topological spaces\, encoding causality constraints.\n From the geo
metric perspective\, we understand the same experimental\noutcome probabil
ities as points in high-dimensional causal polytopes\,\nwhich we explicitl
y construct and fully characterise.\nOur work is a significant extension o
f both the established\nAbramsky-Brandenburger framework for contextuality
and the current body\nof work on indefinite causality. We provide definit
ions of causal\nfraction and causal separability for empirical models rela
tive to a\nbroad class of causal constraints: this allows us to construct
and\ncharacterise novel examples which explicitly connect causal\ninsepara
bility to non-locality and contextuality. In particular\, we\nclearly demo
nstrate the existence of "causal contextuality"\, a\nphenomenon where caus
al structure is explicitly correlated to the\nclassical inputs and outputs
of local instruments\, so that contextuality\nof the associated empirical
model directly implies causal\ninseparability.\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/5/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Amy Searle (University of Oxford)
DTSTART;VALUE=DATE-TIME:20220919T130000Z
DTEND;VALUE=DATE-TIME:20220919T140000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
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 Univers
ity Quantum Computing Seminar\n\n\nAbstract\nThe sheaf theoretic approach
to contextuality\, as has been emphasised before\, is favourable because t
he generality of the sheaf approach allows for the uncovering of connectio
ns to other fields\, and also because theoretical developments in the acti
ve field of sheaf theory can be directly applied to the context of quantum
information. One such theoretical development\, the application to contex
tuality of which was first discussed in [1]\, is Vorob'ev's theorem. In th
e context of quantum information\, it allows us to identify which setups c
an never exhibit contextuality. In this sense\, and by negation\, we know
that for observation of non-classical behaviour attention must be focused
on the measurement setups which do not fall into this category. Besides ex
plaining this theorem\, I will discuss some of the other results contained
within [1]\, such as using such principles to derive monogamy of entangle
ment. I will moreover explain why and how we might hope to extend such res
ults to more general setups\, such as setups where some measurements occur
before others so that there is a temporal ordering on the measurement set
.\n\n[1] Soares Barbosa\, Rui 2015\, 'Contextuality in Quantum Mechanics a
nd 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;VALUE=DATE-TIME:20220912T130000Z
DTEND;VALUE=DATE-TIME:20220912T140000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/7
DESCRIPTION:Title: Wigner’s theorem of stabilizer states\nby Arne Heimendahl (U
niversity of Cologne) as part of Bilkent University Quantum Computing Semi
nar\n\n\nAbstract\nStabilizer states are one of the main components for qu
antum computation with magic states and the basis for the design of quantu
m error correcting codes.\n\nIn this talk\, I will describe the symmetry g
roup of the set of stabilizer states for any number of qubits or qudits wi
th d being an odd prime.\nPreviously\, the group was understood only in th
e qubit case\, 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\nFurthermo
re\, I will relate our result to various notions of symmetries that appear
in the context of quantum systems (such as Wigner and Kadison symmetries)
and discuss some (potential) applications of our result.\n\nBased on join
t 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;VALUE=DATE-TIME:20221104T113000Z
DTEND;VALUE=DATE-TIME:20221104T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/8
DESCRIPTION:Title: Introduction to Measurement-Based Quantum Computing\nby Selman
Ipek (Bilkent University) as part of Bilkent University Quantum Computing
Seminar\n\nLecture held in SA 141.\n\nAbstract\nQuantum teleportation is
a basic protocol in quantum information science that harnesses many quinte
ssential features of quantum theory. Here we introduce MBQC by making conn
ections to quantum teleportation. We will show how basic quantum gates fam
iliar from the so-called circuit model of quantum computation are performe
d in the measurement-based framework. \nReferences: arXiv:quant-ph/0508124
\nAdditional sources: arXiv:quant-ph/0504097\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/8/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART;VALUE=DATE-TIME:20221111T113000Z
DTEND;VALUE=DATE-TIME:20221111T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/9
DESCRIPTION:Title: Nonlocal correlations as an information-theoretic resource (2005)<
/a>\nby Selman Ipek (Bilkent University) as part of Bilkent University Qua
ntum Computing Seminar\n\nLecture held in SA 141.\n\nAbstract\nThe statist
ics of measurement outcomes coming from quantum theory satisfy a principle
known as no-signaling which prevents faster than light information transf
er. It is possible to study statistical models that satisfy this principle
independently of quantum theory. Here we introduce the notion of nonsigna
ling distributions and the implications of such models for information pro
cessing. \nReferences: arXiv:quant-ph/0404097\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/9/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Aziz Kharoof (Bilkent University)
DTSTART;VALUE=DATE-TIME:20221202T113000Z
DTEND;VALUE=DATE-TIME:20221202T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/11
DESCRIPTION:Title: The Sheaf-Theoretic Structure of Definite Causality\nby Aziz
Kharoof (Bilkent University) as part of Bilkent University Quantum Computi
ng Seminar\n\nLecture held in SA 141.\n\nAbstract\nIn its full generality
MBQC is adaptive: the outcomes of a prior measurement determine the measur
ement bases of a subsequent measurement. One possible way to incorporate t
his adaptivity is by introducing the notion of a causal order. This can be
done by introducing the notion of partially ordered sets (posets) as a bo
okkeeping device which takes this causal ordering into account. Here the n
otion of causal sheaves is introduced\, which in one sense generalizes the
sheaf-theoretic approach to include causal order\, but at the same time c
onsiders 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;VALUE=DATE-TIME:20221209T113000Z
DTEND;VALUE=DATE-TIME:20221209T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/12
DESCRIPTION:Title: Simplicial quantum contextuality\nby Mehmet Kırtışoğlu (B
ilkent University) as part of Bilkent University Quantum Computing Seminar
\n\nLecture held in SA 141.\n\nAbstract\nSimplicial sets are well-known in
the mathematics community as combinatorial models of topological spaces.
Here they are utilized for modeling measurement scenarios. The resulting s
implicial approach to contextuality generalizes the sheaf-theoretic approa
ch of Abramsky and Brandenberger. Many standard results like the theorems
of Fine\, Kochen and Specker\, and Gleason can be established from this pe
rspective. Owing to its generality\, the simplicial approach is a good can
didate for modeling adaptive MBQC.\nReferences: arXiv:2204.06648\nAddition
al Sources: arXiv:0809.4221\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/12/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART;VALUE=DATE-TIME:20221216T113000Z
DTEND;VALUE=DATE-TIME:20221216T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/13
DESCRIPTION:Title: Nonclassical correlations as a resource for computation\nby S
elman Ipek (Bilkent University) as part of Bilkent University Quantum Comp
uting Seminar\n\nLecture held in SA 141.\n\nAbstract\nComputational power
in MBQC resides in the correlations between measurement outcomes. Here we
consider an MBQC scheme that is fully adaptive (feedforward of measurement
outcomes is allowed)\, but where the classical side processing only perfo
rms linear operations (mod 2 arithmetic). Although such a model is not eve
n universal for classical computation\, once supplied with a nonclassical
resource (e.g.\, quantum state\, PR box\, etc.)\, it is possible to comput
e nonlinear functions within this computational model\, thus promoting the
model to classical universality.\nReferences: Anders/Browne (2008): arXiv
:0907.5449\nReferences: Raussendorf (2013): arXiv:0805.1002\nBackground ma
terial: arXiv:0712.0921\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/13/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART;VALUE=DATE-TIME:20221223T113000Z
DTEND;VALUE=DATE-TIME:20221223T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/14
DESCRIPTION:Title: Generalized Bell Inequality Experiments and Computation\nby S
elman Ipek (Bilkent University) as part of Bilkent University Quantum Comp
uting Seminar\n\nLecture held in SA 141.\n\nAbstract\nIn the simplified se
tting of non-adaptive MBQC the choice of measurement basis for one local s
ystem (e.g.\, qubit) does not depend on the outcomes of any previous measu
rements. Thus non-adaptive MBQC is similar in spirit to Bell-type experime
nts consisting of distant parties that do not communicate. Following Hoban
\, et al. we consider such Bell-type experiments and study the convex geom
etry of the corresponding local and nonlocal regions. Experimental setups
with classical statistics that are explained by local hidden variable mode
ls (LVH) are found to have limited computational power\, which is related
to Bell-type 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;VALUE=DATE-TIME:20221230T113000Z
DTEND;VALUE=DATE-TIME:20221230T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
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 University Quantum Computing Seminar\n\nLecture held in SA 141.\n\nA
bstract\nWhen dealing with an MBQC with binary outcome measurements the fo
llowing is true: a nonlinear function is computed if and only if the resou
rce is strongly contextual. However\, this tidy result does not remain tru
e when the set of outcomes is 𝑑>2. Frembs\, et al. consider the more ge
neral case of 𝑑-outcome measurements and establish that strong contextu
ality is needed to compute functions (i.e.\, polynomials) of a certain deg
ree not possible for the classical side-processor.\n\nReferences: arXiv:18
04.07364\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/15/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Igor Sikora (Bilkent University)
DTSTART;VALUE=DATE-TIME:20230210T113000Z
DTEND;VALUE=DATE-TIME:20230210T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/16
DESCRIPTION:Title: Cohomological framework for contextual quantum computation\nb
y Igor Sikora (Bilkent University) as part of Bilkent University Quantum C
omputing Seminar\n\nLecture held in SA 141.\n\nAbstract\nCohomological fra
mework for contextual quantum computation (2019) (Igor)\nIn a previous tal
k the topological approach to contextuality was introduced based on chain
complexes and cohomology theory. Here many aspects of this framework are c
arried 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 probabilistic case. An essential takeaway is that the outputs of a co
mputation within this formalism are directly related to these topological
invariants\, thus the “hardness” of the computation is characterized b
y equivalence 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;VALUE=DATE-TIME:20230217T113000Z
DTEND;VALUE=DATE-TIME:20230217T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
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 University Quantum Computing Seminar\n\nLecture held in SA 141.\n\nAbst
ract\nThe topological approach to MBQC based on arXiv:1701.01888 and arXiv
:1602.04155 deals with the temporally flat case. One possible avenue to ac
commodating 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;VALUE=DATE-TIME:20230203T113000Z
DTEND;VALUE=DATE-TIME:20230203T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
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 University Quantum Computing Seminar\n\nLecture held in SA 141.\n\nA
bstract\nWhen dealing with an MBQC with binary outcome measurements the fo
llowing is true: a nonlinear function is computed if and only if the resou
rce is strongly contextual. However\, this tidy result does not remain tru
e when the set of outcomes is $d>2$. Frembs\, et al. consider the more gen
eral case of $d$-outcome measurements and establish that strong contextual
ity is needed to compute functions (i.e.\, polynomials) of a certain degre
e not possible 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;VALUE=DATE-TIME:20230303T113000Z
DTEND;VALUE=DATE-TIME:20230303T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/19
DESCRIPTION:Title: Introduction to the Stabilizer Formalism\nby Selman Ipek (Bil
kent University) as part of Bilkent University Quantum Computing Seminar\n
\nLecture held in SA 141.\n\nAbstract\nIn the finite-dimensional regime ce
rtain pure quantum states can be completely characterized by maximal abeli
an (i.e.\, commuting) subgroups of the Pauli group. These are called stabi
lizer states and well-known examples include Bell as well as Greenberger\,
Horne\, Zeilinger states. The stabilizer formalism is a subtheory of fini
te-dimensional quantum mechanics consisting of stabilizer states\, Cliffor
d unitaries (i.e.\, unitaries that map one Pauli operator to another)\, an
d measurement of Pauli observables. The ability to fully describe such qua
ntum states in group theoretic terms makes their analysis extremely conven
ient and they play an important role in quantum information processing and
also quantum error correction. A key result for our purposes in this semi
nar is the celebrated Gottesman-Knill theorem which establishes that any q
uantum circuit built out of stabilizer states\, Clifford unitaries\, and P
auli measurements (called stabilizer circuits) can be efficiently simulate
d on a classical computer.\n\nReferences: arXiv:quant-ph/9807006\n\nRefere
nces: Nielsen/Chuang: QCQI (Ch. 10)\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/19/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART;VALUE=DATE-TIME:20230317T113000Z
DTEND;VALUE=DATE-TIME:20230317T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/20
DESCRIPTION:Title: Improved Simulation of Stabilizer Circuits\nby Selman Ipek (B
ilkent University) as part of Bilkent University Quantum Computing Seminar
\n\nLecture held in SA 141.\n\nAbstract\nThe Gottesman-Knill theorem estab
lishes that stabilizer circuits (defined previously) can be simulated effi
ciently on a classical computer. In arXiv:quant-ph/0406196 Aaronson and Go
ttesman improve the efficiency of the classical simulation and demonstrate
that stabilizer circuits are (most likely) not universal for classical co
mputation. Circuits that are otherwise stabilizer with the exception of a
small number of non-Clifford gates are also considered and the complexity
of such circuits scales exponentially with the number of non-Clifford gate
s.\n\nReferences: arXiv:quant-ph/0406196\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/20/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART;VALUE=DATE-TIME:20230324T113000Z
DTEND;VALUE=DATE-TIME:20230324T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/21
DESCRIPTION:Title: Universal Quantum Computation with ideal Clifford gates and noisy
ancillas\nby Selman Ipek (Bilkent University) as part of Bilkent Univ
ersity Quantum Computing Seminar\n\nLecture held in SA 141.\n\nAbstract\nI
n studying the resources necessary to achieve a quantum speedup it is usef
ul to distinguish between operations that are (a) free\, or (b) costly. Th
e fact that stabilizer circuits can be efficiently classically simulated s
uggests that stabilizer operations be designated as free. This begs the qu
estion of whether it is possible to augment the free stabilizer operations
with an additional costly resource (to be consumed) which promotes stabil
izer circuits to quantum universality. Bravyi and Kitaev (arXiv:quant-ph/0
403025) demonstrate that there are certain quantum states (deemed “magic
”) which achieve precisely this. They also detail a protocol for distill
ing such magic states from a collection of noisy ancilla states.\n\nRefere
nces: arXiv:quant-ph/0403025\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/21/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART;VALUE=DATE-TIME:20230331T113000Z
DTEND;VALUE=DATE-TIME:20230331T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/22
DESCRIPTION:Title: Quantum universality and magic state distillation\nby Selman
Ipek (Bilkent University) as part of Bilkent University Quantum Computing
Seminar\n\nInteractive livestream: https://zoom.us/j/97145850864?pwd=djhqT
09CU3hiRlU1Wk1DL01mdFdSQT09\nLecture held in SA 141.\n\nAbstract\nStabiliz
er circuits can be promoted to quantum universality via the injection of m
agic states. An open question is the determination of precisely which non-
stabilizer quantum states can be considered “magic”. Following Reichar
dt\, we discuss magic state distillation protocols that tighten the bounda
ry between the classically efficiently simulatable regime and that of full
universal quantum computation.\n\nReferences: arXiv:0608085\n\nReferences
: https://core.ac.uk/download/pdf/44132852.pdf\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/22/
URL:https://zoom.us/j/97145850864?pwd=djhqT09CU3hiRlU1Wk1DL01mdFdSQT09
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART;VALUE=DATE-TIME:20230414T113000Z
DTEND;VALUE=DATE-TIME:20230414T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/23
DESCRIPTION:Title: Trading classical and quantum resources\nby Selman Ipek (Bilk
ent University) as part of Bilkent University Quantum Computing Seminar\n\
nInteractive livestream: https://zoom.us/j/97145850864?pwd=djhqT09CU3hiRlU
1Wk1DL01mdFdSQT09\nLecture held in SA 141.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/23/
URL:https://zoom.us/j/97145850864?pwd=djhqT09CU3hiRlU1Wk1DL01mdFdSQT09
END:VEVENT
BEGIN:VEVENT
SUMMARY:Selman Ipek (Bilkent University)
DTSTART;VALUE=DATE-TIME:20230505T113000Z
DTEND;VALUE=DATE-TIME:20230505T130000Z
DTSTAMP;VALUE=DATE-TIME:20230330T202810Z
UID:BilkentMathGrad/24
DESCRIPTION:Title: Quasiprobability methods in classical simulation (I)\nby Selm
an Ipek (Bilkent University) as part of Bilkent University Quantum Computi
ng Seminar\n\nInteractive livestream: https://zoom.us/j/97145850864?pwd=dj
hqT09CU3hiRlU1Wk1DL01mdFdSQT09\nLecture held in SA 141.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/BilkentMathGrad/24/
URL:https://zoom.us/j/97145850864?pwd=djhqT09CU3hiRlU1Wk1DL01mdFdSQT09
END:VEVENT
END:VCALENDAR