Quantum Algorithms for X

Add to your list(s) Download to your calendar using vCal

• Subhayan Roy Moulik, UC Berkeley, Dept of Mathematics
• Thursday 21 April 2022, 15:00-16:00
• https://berkeley.zoom.us/j/92221787018.

If you have a question about this talk, please contact Challenger Mishra.

Dr Subhayan Roy Moulik will be giving a set of 8 lectures on Quantum Algorithms. This pedagogical series is aimed at researchers at any level who are looking to utilise the quantum machinery in their own research. These lectures will cover algorithmic frameworks for quantum computing as well as examples of quantum algorithms for computational mathematics and theoretical physics. Although no specific background is a pre-requisite, mathematical maturity, and familiarity with linear algebra, theory of computation, or quantum physics would be useful.

Speaker Bio: Dr Subhayan Roy Moulik (DPhil Oxon) is a postdoctoral scholar at UC Berkeley (Mathematics) and associated with the NSF -Challenge Institute for Quantum Computation, working on quantum computation for computational mathematics and theoretical physics. He received his doctorate from the University of Oxford (Computer Science) as a Clarendon Scholar, and wrote a thesis titled ‘Quantum Cryptanalysis, Proof Systems, and Causal Structures’.

http://math.berkeley.edu/~srm/

Time: Thursdays at 3-4 PM UK time (speaker to stay on for informal discussions after) Start date: March 31 End date: May 19 Weblink: below

https://berkeley.zoom.us/j/92221787018

Lecture 4 will focus on a framework for numerically solving linear system of equations, i.e., Ax=b.

This talk is part of the ML@CL Ad-hoc Seminar Series series.

This talk is included in these lists:

• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Guy Emerson's list
• Interested Talks
• Interested Talks
• Trust & Technology Initiative - interesting events
• bld31
• https://berkeley.zoom.us/j/92221787018
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.