BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//UW QuantumX - ECPv6.17.3.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:UW QuantumX
X-ORIGINAL-URL:https://www.quantumx.washington.edu
X-WR-CALDESC:Events for UW QuantumX
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20250309T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20251102T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20260308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20261101T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20270314T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20271107T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260206T133000
DTEND;TZID=America/Los_Angeles:20260206T143000
DTSTAMP:20260407T182334Z
CREATED:20251230T224730Z
LAST-MODIFIED:20260407T182334Z
UID:8271-1770384600-1770388200@www.quantumx.washington.edu
SUMMARY:William Kretschmer (University of Texas at Austin)\, QISE Seminar: Demonstrating an unconditional separation between quantum and classical information resources
DESCRIPTION:Abstract: \n\n\n\nA longstanding question in the foundations of quantum mechanics is whether the exponential state space of a quantum system is a physically accessible resource\, or whether the observed behavior of quantum devices admits a succinct classical explanation. In this talk I will discuss an experimental work in which\, leveraging quantum-classical separations in communication complexity\, we performed a task using 12 trapped-ion qubits that would provably require at least 62 bits of storage to replicate using classical information resources. Consequently\, no classical ontological model of fewer than 62 bits can explain the observed behavior of the 12-qubit system. Our separation does not rely on any unproven conjectures\, and demonstrates how today’s quantum processors can generate and manipulate entangled states of sufficient complexity to access the exponentiality of Hilbert space. Based on arXiv:2509.07255. \n\n\n\nSpeaker Bio: \n\n\n\nWilliam Kretschmer is an Assistant Professor in the Department of Computer Science at UT Austin. Previously\, was a Quantum Postdoctoral Fellow at the Simons Institute for the Theory of Computing. His research lies broadly in quantum information and computation\, with connections to complexity theory\, cryptography\, and learning. Kretschmer is especially interested in understanding computational problems that involve operation on quantum inputs.
URL:https://www.quantumx.washington.edu/calendar/william-kretschmer-university-of-texas-at-austin/
LOCATION:Electrical and Computer Engineering (ECE)\, Room 037\, 185 W Stevens Wy NE\, Seattke\, Washington\, 98185
CATEGORIES:Computer Science & Engineering
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20260108T153000
DTEND;TZID=America/Los_Angeles:20260108T163000
DTSTAMP:20260108T210025Z
CREATED:20251117T193150Z
LAST-MODIFIED:20260108T210025Z
UID:7235-1767886200-1767889800@www.quantumx.washington.edu
SUMMARY:CSE Distinguished Lecture Series: Scott Aaronson
DESCRIPTION:Event interval: Single day eventCampus room: Gates Center (CSE2)\, G20 | Amazon AuditoriumAccessibility Contact: dso@uw.eduEvent Types: Lectures/SeminarsEvent sponsors: Paul G. Allen School of Computer Science & Engineeringwww.cs.washington.eduLink: https://www.cs.washington.edu/events/colloquia/details?id=3379 \nAbstractAbstract is forthcoming. \nBio \nI’m the Schlumberger Centennial Chair of Computer Science at The University of Texas at Austin\, and director of its Quantum Information Center. My research interests center around the capabilities and limits of quantum computers\, and computational complexity theory more generally. For the 2022-2023 and 2023-2024 academic years\, I was on leave to work at OpenAI on the theoretical foundations of AI safety. \nThis lecture will be streamed live and recorded.
URL:https://www.quantumx.washington.edu/calendar/distinguished-lecture-series-scott-aaronson-forthcoming/
LOCATION:Gates Center (CSE2)\, G20 | Amazon Auditorium
CATEGORIES:Computer Science & Engineering
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20251202T133000
DTEND;TZID=America/Los_Angeles:20251202T150000
DTSTAMP:20251209T195015Z
CREATED:20251202T182819Z
LAST-MODIFIED:20251209T195015Z
UID:7661-1764682200-1764687600@www.quantumx.washington.edu
SUMMARY:Separating QMA and QCMA with a classical oracle\, Chinmay Nirkhe
DESCRIPTION:Abstract:  \n\n\n\nWe construct a classical oracle proving that\, in a relativized setting\, the set of languages decidable by an efficient quantum verifier with a quantum witness (QMA) is strictly bigger than those decidable with access only to a classical witness (QCMA). The separating classical oracle we construct is for a decision problem we coin spectral Forrelation — the oracle describes two subsets of the boolean hypercube\, and the computational task is to decide if there exists a quantum state whose standard basis measurement distribution is well supported on one subset while its Fourier basis measurement distribution is well supported on the other subset. This is equivalent to estimating the spectral norm of a “Forrelation” matrix between two sets that are accessible through membership queries. \n\n\n\nOur lower bound derives from a simple observation that a query algorithm with a classical witness can be run multiple times to generate many samples from a distribution\, while a quantum witness is a “use once” object. This observation allows us to reduce proving a QCMA lower bound to proving a sampling hardness result\, which does not simultaneously prove a QMA lower bound. To prove said sampling hardness result for QCMA\, we observe that quantum access to the oracle can be compressed by expressing the problem in terms of bosons — a novel “second quantization” perspective on compressed oracle techniques\, which may be of independent interest. Using this compressed perspective on the sampling problem\, we prove the sampling hardness result\, completing the proof. \n\n\n\nJoint work with John Bostanci\, Jonas Haferkamp\, and Mark Zhandry: https://arxiv.org/abs/2511.09551 
URL:https://www.quantumx.washington.edu/calendar/separating-qma-and-qcma-with-a-classical-oracle/
CATEGORIES:Computer Science & Engineering
END:VEVENT
END:VCALENDAR