BEGIN:VCALENDAR VERSION:2.0 PRODID:-//linuxsoftware.nz//NONSGML Joyous v1.4//EN BEGIN:VEVENT SUMMARY:Hybrid Quantum-Classical High-Performance Computation DTSTART:20221219T140000Z DTEND:20221219T160000Z DTSTAMP:20260624T053022Z UID:c475df98-c8c8-4cab-898b-ddf50e38f9a3 SEQUENCE:3 CREATED:20221216T111826Z DESCRIPTION:Abstract:Quantum computing enjoys some proven computational ad vantage over classical computers\, with alluring applications: e.g.\, quan tum system simulation\, quantum chemistry\, cryptography\, machine learnin g. However\, current implementations of quantum computers are still far fr om resilient to effects such as dephasing and decoherence\, putting them i n stark contrast to the classical computing technology developed over the last century. We would like to make use of both these aspects (quantum com putational power and classical computing technology)\, thus motivating the seek for hybrid algorithms: those that combine the two types of computati on. But\, this raises the question: when limiting\, for example\, the maxi mum coherent depth to the quantum circuits used\, is any quantum advantage preserved? If so\, how much\, and in to what relation to the limits impos ed? We analyze this question from a more tractable perspective\, namely\, by modelling such a limitation as a limitation on the number of calls made coherently to an oracle of the problem. We establish an interpolation reg ime for a particular problem (that of Eigenvalue Estimation) as a generali zation of existing results in the literature\,and by applying a recently d eveloped technique\, named Quantum Singular Value Transformation. We then look at prospective following results\, by inspecting the classes of probl ems for which the maximum quantum speedup is known (but an interpolating r egime is not). LAST-MODIFIED:20221219T114010Z LOCATION:Online URL:http://df.vps.tecnico.ulisboa.pt/pt/eventos/hybrid-quantum-classical-h igh-performance-computation/ X-ALT-DESC;FMTTYPE=text/html:

Abstract:
Quantum computing enjoys some proven computational advantage over classi cal computers\, with alluring applications: e.g.\, quantum system simulati on\, quantum chemistry\, cryptography\, machine learning.

Howeve r\, current implementations of quantum computers are still far from resili ent to effects such as dephasing and decoherence\, putting them in stark c ontrast to the classical computing technology developed over the last cent ury. We would like to make use of both these aspects (quantum computationa l power and classical computing technology)\, thus motivating the seek for hybrid algorithms: those that combine the two types of computation.
< br/> But\, this raises the question: when limiting\, for example\, the max imum coherent depth to the quantum circuits used\, is any quantum advantag e preserved? If so\, how much\, and in to what relation to the limits impo sed? We analyze this question from a more tractable perspective\, namely\, by modelling such a limitation as a limitation on the number of calls mad e coherently to an oracle of the problem.

We establish an interp olation regime for a particular problem (that of Eigenvalue Estimation) as a generalization of existing results in the literature\,and by applying a recently developed technique\, named Quantum Singular Value Transformatio n. We then look at prospective following results\, by inspecting the class es of problems for which the maximum quantum speedup is known (but an inte rpolating regime is not).

END:VEVENT END:VCALENDAR