Zoom: https://illinois.zoom.us/j/86197768129?pwd=TFpNYTk1SXROdVNuZVVueVBLU0drQT09
Abstract:
After three decades of research in quantum computing theory and experiments, the world has seen the emergence of noisy quantum devices capable of solving special sampling problems using 50-60 qubits or approximately 100 photons in a way that is believed to achieve quantum computational supremacy, i.e., the quantum devices outperform any existing classical computer for these tasks. Despite these achievements, whether they lead to practical applications have remained unclear.
In this talk, I will discuss the latest developments in quantum supremacy proposals and related constructions. Specifically, I will focus on my research on new cryptographic applications that build upon these proposals, including certified randomness from untrusted quantum devices, classical verification of devices with limited quantum depth, and verification of full-power quantum computers. These novel applications challenge us to further explore the limitations of quantum devices, and repurpose various supremacy proposals for practical uses.
Bio:
Shih-Han Hung is a postdoctoral researcher at the University of Texas at Austin, specializing in the intersection of quantum information science and branches of computer science including computational complexity theory, cryptography, and programming languages. He actively researches how quantum devices can demonstrate computational advantage, and how they lead to practical applications. Shih-Han received his Ph.D. in Computer Science from the University of Maryland.
Faculty Host: Chandra Chekuri & Madhu Parthasarathy
Meeting ID:861 9776 8129 ; Password: csillinois
