BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20231105T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:661b38c59342a
DTSTART;VALUE=DATE:20240501
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;VALUE=DATE:20240503
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/quantum-con
nections-2024-quantum-perspectives
SUMMARY:Quantum Connections 2024: Quantum Perspectives
CLASS:PUBLIC
DESCRIPTION:Summary \n\nJoin us for Quantum Connections May 1-2\, 2024. Thi
s year we’re\nhighlighting Quantum Perspectives: the impacts and outlook
s driving\nour future.\n
X-MICROSOFT-CDO-ALLDAYEVENT:TRUE
DTSTAMP:20240414T020037Z
END:VEVENT
BEGIN:VEVENT
UID:661b38c59ebb9
DTSTART;TZID=America/Toronto:20240416T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240416T160000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/recent-prog
ress-hamiltonian-learning
SUMMARY:Recent progress in Hamiltonian learning
CLASS:PUBLIC
DESCRIPTION:Summary \n\nCS/MATH SEMINAR - YU TONG\, CALTECH\n\nQuantum-Nano
Centre\, 200 University Ave West\, Room QNC 1201 + ZOOM\nWaterloo\, ON CA
N2L 3G1\n\nIn the last few years a number of works have proposed and impr
oved\nprovably efficient algorithms for learning the Hamiltonian from\nrea
l-time dynamics. In this talk\, I will first provide an overview of\nthese
developments\, and then discuss how the Heisenberg limit\, the\nfundament
al precision limit imposed by quantum mechanics\, can be\nreached for this
task. I will demonstrate how the Heisenberg limit\nrequires techniques th
at are fundamentally different from previous\nones\, and the important rol
es played by quantum control and\nthermalization. I will also discuss open
problems that are crucial to\nmaking these algorithms implementable on cu
rrent devices.\n
DTSTAMP:20240414T020037Z
END:VEVENT
BEGIN:VEVENT
UID:661b38c59f7bd
DTSTART;TZID=America/Toronto:20240417T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240417T130000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/iqc-student
-seminar-featuring-benjamin-maclellan
SUMMARY:IQC Student Seminar Featuring Benjamin MacLellan
CLASS:PUBLIC
DESCRIPTION:Summary \n\nVARIATIONAL METHODS FOR QUANTUM SENSING\n\nQuantum-
Nano Centre\, 200 University Ave West\, Room QNC 1201 Waterloo\,\nON CA N2
L 3G1\n\nThe precise estimation of unknown physical quantities is foundati
onal\nacross science and technology. Excitingly\, by harnessing\ncarefully
-prepared quantum correlations\, we can design and implement\nsensing prot
ocols that surpass the intrinsic precision limits imposed\non classical ap
proaches. Applications of quantum sensing are myriad\,\nincluding gravitat
ional wave detection\, imaging and microscopy\,\ngeoscience\, and atomic c
locks\, among others.\n\nHowever\, current and near-term quantum devices h
ave limitations that\nmake it challenging to capture this quantum advantag
e for sensing\ntechnologies\, including noise processes\, hardware constra
ints\, and\nfinite sampling rates. Further\, these non-idealities can prop
agate and\naccumulate through a sensing protocol\, degrading the overall\n
performance and requiring one to study protocols in their entirety.\n\nIn
recent work [1]\, we develop an end-to-end variational framework for\nquan
tum sensing protocols. Using parameterized quantum circuits and\nneural ne
tworks as adaptive ansätze of the sensing dynamics and\nclassical estimat
ion\, respectively\, we study and design variational\nsensing protocols un
der realistic and hardware-relevant constraints.\nThis seminar will review
the fundamentals of quantum metrology\, cover\ncommon sensing application
s and protocols\, introduce and benchmark our\nend-to-end variational appr
oach\, and conclude with perspectives on\nfuture research.\n\n[1] https:/
/arxiv.org/abs/2403.02394\n
DTSTAMP:20240414T020037Z
END:VEVENT
BEGIN:VEVENT
UID:661b38c5a02a5
DTSTART;TZID=America/Toronto:20240419T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240419T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/matt-piatt-
msc-thesis-defense
SUMMARY:Matt Piatt MSc Thesis Defense
CLASS:PUBLIC
DESCRIPTION:Summary \n\nRANDOM STATE GENERATION FOR QUANTUM KEY DISTRIBUTIO
N USING WEAK\nCOHERENT PULSE SOURCE\n\nQuantum-Nano Centre\, 200 Universi
ty Ave West\, Room QNC 2101\nWaterloo\, ON CA N2L 3G1\n\nSupervisor: Thoma
s Jennewein\n
DTSTAMP:20240414T020037Z
END:VEVENT
BEGIN:VEVENT
UID:661b38c5a0bb4
DTSTART;TZID=America/Toronto:20240409T113000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240409T123000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/new-techniq
ues-fast-and-high-fidelity-trapped-ion-0
SUMMARY:New Techniques for Fast and High-Fidelity Trapped Ion Interconnects
CLASS:PUBLIC
DESCRIPTION:Summary \n\nIQC SEMINAR - JAMESON O'REILLY\, DUKE UNIVERSITY\n\
nQuantum-Nano Centre\, 200 University Ave West\, Room QNC 0101 \nWaterloo
\, ON CA N2L 3G1\n\nTrapped atomic ions are a leading candidate platform f
or quantum\nsimulation and computing but system sizes are limited by motio
nal mode\ncrowding and transport overhead. Multiple reasonably-sized\,\nwe
ll-controlled modules can be connected into one universal system\nusing ph
otonic interconnects\, in which photons entangled with ions in\neach trap
are collected into and detected in a Bell-state analyzer.\nThe speed of th
ese interconnects has heretofore been limited by the\nuse of 0.6 NA object
ives and the need to periodically pause\nentanglement attempts for recooli
ng. In this work\, we use a system\nwith two in-_vacuo_ 0.8 NA lenses on
either side of an ion trap to\ncollect 493 nm photons from barium ions and
demonstrate the most\nefficient free-space ion trap photonic interconnect
to date. In\naddition\, we introduce an ytterbium ion as a sympathetic co
olant\nduring the entangling attempts cycle to remove the need for recooli
ng\,\nenabling a record photon-mediated entanglement rate between two\ntra
pped ions. The major remaining error source is imperfections in the\nphoto
n polarization encoding\, so we also develop a new protocol for\nremotely
entangling two ions using time-bin encoded photons and\npresent preliminar
y results of an experimental implementation.\nFinally\, we prepare the fir
st remote entangled state involving two\nbarium ions in separate vacuum ch
ambers.\n
DTSTAMP:20240414T020037Z
END:VEVENT
BEGIN:VEVENT
UID:661b38c5a156b
DTSTART;TZID=America/Toronto:20240410T120000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240410T130000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/iqc-student
-seminar-featuring-matthew-duschenes
SUMMARY:IQC Student Seminar Featuring Matthew Duschenes
CLASS:PUBLIC
DESCRIPTION:Summary \n\nOVERPARAMETERIZATION AND EXPRESSIVITY OF REALISTIC
QUANTUM SYSTEMS\n\nQuantum-Nano Centre\, 200 University Ave West\, Room QN
C 1201 Waterloo\,\nON CA N2L 3G1\n\nQuantum computing devices require exce
ptional control of their\nexperimental parameters to prepare quantum state
s and simulate other\nquantum systems\, in particular while subject to noi
se. Of interest\nhere are notions of trainability\, how difficult is it to
classically\noptimize parameterized\, realistic quantum systems to repres
ent target\nstates or operators of interest\, and expressivity\, how much
of a\ndesired set of these targets is our parameterized ansatze even capab
le\nof representing? We observe that overparameterization phenomena\, wher
e\nsystems are adequately parameterized\, are resilient in noisy settings\
nat short times and optimization can converge exponentially with\ncircuit
depth. However fidelities decay to zero past a critical depth\ndue to accu
mulation of either quantum or classical noise. To help\nexplain these nois
e-induced phenomena\, we introduce the notion of\nexpressivity of non-unit
ary\, trace preserving operations\, and\nhighlight differences in average
behaviours of unitary versus\nnon-unitary ensembles. We rigorously prove t
hat highly-expressive\nnoisy quantum circuits will suffer from barren plat
eaus\, thus\ngeneralizing reasons behind noise-induced phenomena. Our resu
lts\ndemonstrate that appropriately parameterized ansatze can mitigate\nen
tropic effects from their environment\, and care must be taken when\nselec
ting ansatze of channels.\n
DTSTAMP:20240414T020037Z
END:VEVENT
BEGIN:VEVENT
UID:661b38c5a1f39
DTSTART;TZID=America/Toronto:20240409T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240409T143000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/photonic-li
nks-rydberg-atom-arrays
SUMMARY:Photonic Links for Rydberg Atom Arrays
CLASS:PUBLIC
DESCRIPTION:Summary \n\nIQC SPECIAL COLLOQUIUM - IVANA DIMITROVA\, HARVARD
UNIVERSITY\n\nQuantum-Nano Centre\, 200 University Ave West\, Room QNC 010
1 Waterloo\,\nON CA N2L 3G1\n\nScaling up the number of qubits available i
n experimental systems is\none of the most significant challenges in quant
um computation. A\npromising path forward is to modularize the quantum pro
cessors and\nthen connect many processors using quantum channels\, realize
d using\nphotons and optical fibers. For Rydberg atom arrays\, one of the
\nleading platforms for quantum information processing\, this could be\ndo
ne by developing an interface for photons\, such as an optical\ncavity. In
addition\, an optical cavity can be used for fast\nmid-circuit readout fo
r error detection. In this talk\, I will discuss\nrecent progress with two
types of cavities and their feasibility as a\nphotonic link. First\, we s
how coherent control of Rydberg qubits and\ntwo-atom entanglement as close
as 130um away from a nanophotonic\ncavity. Second\, we show fast high-fid
elity qubit state readout at a\nfiber Fabry Perot cavity. In addition\, a
fiber cavity also allows for\ncavity-mediated atom-atom gates\, which coul
d enable novel quantum\nnetworking capabilities. \n
DTSTAMP:20240414T020037Z
END:VEVENT
BEGIN:VEVENT
UID:661b38c5a28d5
DTSTART;TZID=America/Toronto:20240409T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240409T110000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/embezzlemen
t-entanglement-quantum-fields-and-classification
SUMMARY:Embezzlement of entanglement\, quantum fields and the classificatio
n of\nvon Neumann algebras
CLASS:PUBLIC
DESCRIPTION:Summary \n\nCS/MATH SEMINAR - LAURITZ VAN LUIJK\, LEIBNIZ UNIVE
RSITÄT HANNOVER\n\nQuantum-Nano Centre\, 200 University Ave West\, Room Q
NC 1201 + ZOOM\nWaterloo\, ON CA N2L 3G1\n\nEmbezzlement refers to the cou
nterintuitive possibility of extracting\nentangled quantum states from a r
eference state of an auxiliary system\n(the \"embezzler\") via local quant
um operations while hardly perturbing\nthe reference. I will explain a dee
p connection between this\noperational task and the mathematical classifi
cation of von Neumann\nalgebras.\n\nThis result implies that relativistic
quantum fields are universal\nembezzlers: Any entangled state of any dimen
sion can be embezzled from\nthem with arbitrary precision. In particular\,
this provides an\noperational characterization of the infinite amount of
entanglement\npresent in the vacuum state of relativistic quantum field th
eories and\nexplains the classic result that the vacuum maximally violates
Bell's\ninequalities: Alice and Bob can simply embezzle a maximally entan
gled\nqubit pair and perform a Bell measurement.\n\nThe talk is based on j
oined work with A Stottmeister\, RF Werner\, and H\nWilming (see arXiv:24
01.07292\n[https://arxiv.org/abs/2401.07292]\, arXiv:2401.07299\n[https:/
/arxiv.org/abs/2401.07299]).\n
DTSTAMP:20240414T020037Z
END:VEVENT
BEGIN:VEVENT
UID:661b38c5a33a3
DTSTART;TZID=America/Toronto:20240412T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240412T160000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/how-quantum
-compute-non-abelian-gauge-theories-theoretical
SUMMARY:How to quantum compute non-Abelian gauge theories: theoretical and\
nalgorithmic considerations
CLASS:PUBLIC
DESCRIPTION:Summary \n\nIQC SEMINAR - ZOHREH DAVOUDI\, UNIVERSITY OF MARYLA
ND\n\nQuantum-Nano Centre\, 200 University Ave West\, Room QNC 1201 Waterl
oo\,\nON CA N2L 3G1\n\nQuantum computing gauge theories of relevance to Na
ture requires a\nrange of theoretical and algorithmic developments to make
simulations\namenable in the near and far terms. With a focus on the SU(2
) lattice\ngauge theory with matter\, I will motivate the need for efficie
nt\ntheoretical formulations\, introduce general quantum algorithms that\n
can simulate them efficiently\, and discuss strategies for analyzing\nthe
required quantum resources accurately. These considerations will\nbe of re
levance to simulating other gauge theories of increasing\ncomplexity\, inc
luding quantum chromodynamics.\n
DTSTAMP:20240414T020037Z
END:VEVENT
BEGIN:VEVENT
UID:661b38c5a3ccd
DTSTART;TZID=America/Toronto:20240402T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20240402T153000
URL:https://uwaterloo.ca/institute-for-quantum-computing/events/quantum-com
putational-advantages-energy-minimization
SUMMARY:Quantum Computational Advantages in Energy Minimization
CLASS:PUBLIC
DESCRIPTION:Summary \n\nIQC SPECIAL COLLOQUIUM LEO ZHOU\, CALIFORNIA INSTIT
UTE OF TECHNOLOGY\n\nQuantum-Nano Centre\, 200 University Ave West\, Room
QNC 1201 Waterloo\,\nON CA N2L 3G1\n\nFinding the minimum of the energy of
a many-body system is a\nfundamental problem in many fields. Although we
hope a quantum\ncomputer can help us solve this problem faster than classi
cal\ncomputers\, we have a very limited understanding of where a quantum\n
advantage may be found. In this talk\, I will present some recent\ntheoret
ical advances that shed light on quantum advantages in this\ndomain. First
\, I describe rigorous analyses of the Quantum Approximate\nOptimization A
lgorithm applied to minimizing energies of classical\nspin glasses. For ce
rtain families of spin glasses\, we find the QAOA\nhas a quantum advantage
over the best known classical algorithms.\nSecond\, we study the problem
of finding a local minimum of the energy\nof quantum systems. While local
minima are much easier to find than\nground states\, we show that finding
a local minimum under thermal\nperturbations is computationally hard for c
lassical computers\, but\neasy for quantum computers. These results highli
ght exciting new\ndirections in leveraging physics-inspired algorithms to
achieve\nquantum advantages in broadly useful problems.\n
DTSTAMP:20240414T020037Z
END:VEVENT
END:VCALENDAR