BEGIN:VCALENDAR
CALSCALE:GREGORIAN
METHOD:PUBLISH
PRODID:-//github.com/rianjs/ical.net//NONSGML ical.net 4.0//EN
VERSION:2.0
X-FROM-URL:https://eom.sdu.dk/events/ical/2db9be21-50e9-475b-83a6-8bc8d14e
 9263
X-WR-CALNAME:QC Research Seminar: An Exponential Separation Between Quantu
 m and Quantum-Inspired Classical Algorithms for Linear Systems
BEGIN:VTIMEZONE
TZID:Europe/Copenhagen
X-LIC-LOCATION:Europe/Copenhagen
BEGIN:DAYLIGHT
DTSTAMP:20260720T031629Z
DTSTART:20261028T030000
SEQUENCE:0
TZNAME:CEST
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
UID:90c01c05-d1bf-4c64-ba0a-2d7d54036d8c
END:DAYLIGHT
BEGIN:STANDARD
DTSTAMP:20260720T031629Z
DTSTART:20260325T020000
SEQUENCE:0
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
UID:a5dfaaf5-003a-43c9-817b-c863058697a3
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DESCRIPTION:[b]Speaker: ​Kasper Green Larse[/b]n[b] [/b](Aarhus University
 ).\n\n[b]Abstract: [/b]\nAchieving a provable exponential quantum speedup
  for an important machine learning task has been a central research goal 
 since the seminal HHL quantum algorithm for solving linear systems and th
 e subsequent quantum recommender systems algorithm by Kerenidis and Praka
 sh. These algorithms were initially believed to be strong candidates for 
 exponential speedups\, but a lower bound ruling out similar classical imp
 rovements remained absent. In breakthrough work by Tang\, it was demonstr
 ated that this lack of progress in classical lower bounds was for good re
 asons. Concretely\, she gave a classical counterpart of the quantum recom
 mender systems algorithm\, reducing the quantum advantage to a mere polyn
 omial. Her approach is quite general and was named [i]quantum-inspired cl
 assical[/i] algorithms. Since then\, almost all the initially exponential
  quantum machine learning speedups have been reduced to polynomial via ne
 w quantum-inspired classical algorithms. From the current state-of-affair
 s\, it is unclear whether we can hope for exponential quantum speedups fo
 r any natural machine learning task. \n\nIn this work\, we present the fi
 rst such provable exponential separation between quantum and quantum-insp
 ired classical algorithms. We prove the separation for the basic problem 
 of solving a linear system when the input matrix is well-conditioned and 
 has sparse rows and columns[i].[/i]
DTEND:20260624T140000Z
DTSTAMP:20260720T031629Z
DTSTART:20260624T130000Z
LOCATION:Syddansk Universitet\, Campusvej 55\, 5230\, Odense M
SEQUENCE:0
SUMMARY:QC Research Seminar: An Exponential Separation Between Quantum and
  Quantum-Inspired Classical Algorithms for Linear Systems
UID:600068b3-b784-475e-9cf0-af6d7dbc548d
END:VEVENT
END:VCALENDAR