Skip to main content

Quantum Algorithms, Information, and Learning Workshop

quantum-workshop-22.jpg

May 24, 2022
9:30am - 4pm (Eastern Time Zone, U.S.A.)

Recorded talks are available as a Center for Science of Information YouTube playlist or individually by presentation title (see below).

The past few decades have witnessed significant advances in quantum technologies with a few hundred qubit capacities. Quantum computers are at the cusp of surpassing contemporary and even future supercomputers in achieving scientific breakthroughs. In addition, recent achievements in quantum algorithms and information processing to collect, store, and process qubits endow us with a more powerful ability, learning from quantum information. The leading applications of the so-called "Noisy Intermediate Scale Quantum" (NISQ) computers are expected to be the simulation of physical systems, quantum machine learning, and, more generally, optimization. However, employing noisy quantum computers for such applications raises major challenges at experimental and theoretical fronts. Algorithms realizable on near-term quantum computers need to comply with quantum mechanical postulates, address the device imperfections (e.g., gate infidelity and qubit decoherence), and be scalable in terms of circuit utilization.

This 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.

Workshop Organizers: 

  • Mohsen Heidari, Center for Science of Information, Purdue University, and Indiana University
  • Wojciech Szpankowski, Center for Science of Information, Purdue University

 

 Useful Links:

Center for Science of Information, NSF Science & Technology Center

Book Series: World Scientific Series on Quantum Algorithms, Information, and Learning

Conference at UIUC: 17th Annual Theory of Quantum Computation, Communication and Cryptography (TQC)


Schedule at a Glance (Eastern time zone, USA): Presentation recordings available for viewing at each link.

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

10:00 - 11:00
Sandeep Pradhan (U of MI)
"Computation using structured measurements in Quantum Systems"

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
Eric Chitambar (UIUC)
"Nonclassicality in Quantum Networks and its Verification"

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

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

 

Workshop Speakers (listed in presentation order for the workshop)

pradhan-web.jpg

Sandeep Pradhan
EECS, University of Michigan
Title: "Computation using structured measurements in Quantum Systems"
Time: 10am - 11am

 

Heidari-web.jpg

 Mohsen Heidari
CS, Purdue University
Title: Toward Physically Realizable Quantum Algorithms
Time: 11am-Noon

 

 

Eric-Chitamber-web.png

Eric Chitambar
ECE, University of Illinois Urbana-Champaign
Title: "Nonclassicality in Quantum Networks and its Verification"
Time: 1pm - 2pm

 

 

anshu-web.png

Anurag Anshu
CS, Harvard University
Title: "Improved Approximation Algorithms for Bounded-degree Local Hamiltonians"
Time: 2pm - 3pm

 

Graeme_Smith_2016_web.jpeg

Graeme Smith
Physics, University of Colorado Boulder
Title: Nonadditivity in Quantum Shannon Theory
Time: 3pm - 4pm