Skip to main content

CSoI Organizes Quantum Computing Workshop May 24th

quantum-workshop-22.jpg

The Center's Mohsen Heidari and Wojciech Szpankowski have organized a day-long workshop focused on Quantum Algorithms, Information, and Learning. The workshop will take place online May 24th, starting with opening remarks at 9:30 and ending at 4pm (ET, Invited Speakers and schedule below). 

The workshop aims to present the current solutions and key questions in quantum information and computation. The workshop touches on both computer science and quantum physics foundations to formalize a common framework for the challenges and solutions in quantum computing. Moreover, it discusses relevant ideas from learning theory, quantum mechanics, and information theory and covers recent progress on quantum algorithms, information, and machine learning. The workshop's critical questions regarding the potentials of quantum computers are about (i) models for quantum machine learning, (ii) approaches for quantum algorithms on noisy devices, and (iii) frameworks for leveraging quantum information and learning from quantum data.

No registration is needed. For further details and the link for joining the talks, please visit the workshop page.

Schedule at a Glance (Eastern time zone, USA):

9:30-10:00
Wojciech Szpankowski (CSoI and Purdue)
Opening remarks

 

10:00 - 11:00
Sandeep Pradhan (U of MI)
Talk title TBD

 

11:00-12:00
Mohsen Heidari (CSoI, Purdue, and IU)
“Toward Physically Realizable Quantum Algorithms”

 

12:00-13:00 lunch break

 

13:00-14:00
Anurag Anshu (Harvard)
"Improved Approximation Algorithms for Bounded-degree Local Hamiltonians"

 

14:00-15:00
Eric Chitambar (UIUC)
"Nonclassicality in Quantum Networks and its Verification"

 

15:00-16:00
Graeme Smith (CU-Boulder)
“Nonadditivity in Quantum Shannon Theory”

Copyright © Purdue University, all rights reserved. Purdue University is an equal access/equal opportunity university.

Contact the College of Science at sciencehelp@purdue.edu for trouble accessing this page. Made possible by grant NSF CCF-0939370