BEGIN:VCALENDAR
VERSION:2.0
PRODID:-// - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://quantum-bc.ca
X-WR-CALDESC:Events for 
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Vancouver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
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
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Vancouver:20240312T140000
DTEND;TZID=America/Vancouver:20240312T150000
DTSTAMP:20260420T123918
CREATED:20240126T201127Z
LAST-MODIFIED:20240229T191805Z
UID:7167-1710252000-1710255600@quantum-bc.ca
SUMMARY:Quantum BC Seminar Series - Dr. Daochen Wang
DESCRIPTION:Join us on Tuesday\, March 12 at 2pm for a seminar by Dr. Daochen Wang from the University of British Columbia. The title of his seminar is Quantum Divide and Conquer. \nJoin on Zoom: \nhttps://ubc.zoom.us/j/69443327772?pwd=TGhhTXFIQ3ZiUmNrN0pUa3FObTNydz09 \nMeeting ID: 694 4332 7772 Passcode: 996727 \nTitle: Quantum Divide and Conquer \nAbstract: \nThe divide-and-conquer framework\, used extensively in classical algorithm design\, recursively breaks a problem into smaller subproblems\, along with some auxiliary work\, to give a recurrence relation for the classical complexity. We describe a quantum divide-and-conquer framework that\, in certain cases\, yields quantum speedup through an analogous recurrence relation for the quantum query complexity. We apply this framework to obtain near-optimal quantum query complexities for various string problems\, such as (i) recognizing regular languages; (ii) decision versions of String Rotation and String Suffix; and natural parameterized versions of (iii) Longest Increasing Subsequence and (iv) Longest Common Subsequence. Based on joint work with Andrew M. Childs\, Robin Kothari\, Matt Kovacs-Deak\, and Aarthi Sundaram (arXiv:2210.06419). \nBio: \nDr. Daochen Wang obtained his PhD in Applied Mathematics from the University of Maryland under advisors Andrew Childs and Carl Miller. Before that\, he obtained his Bachelors and Masters from the University of Cambridge. \nDr. Wang since moved to Vancouver to start as an Assistant Professor with the Department of Computer Science at the University of British Columbia this past October. He will research quantum computation and information. \nHe is interested in the structures beneath quantum speed-ups\, algorithm design\, and real-world applications. Recently Daochen has also become interested in quantum cryptography. \n 
URL:https://quantum-bc.ca/event/quantum-bc-seminar-series-dr-daochen-wang/
END:VEVENT
END:VCALENDAR