Are there computational tasks in which quantum computers can achieve beyond what any classical algorithm can do, even those yet undiscovered? The experimental race for these tasks, know as quantum supremacy, in near-term quantum devices continues to this day. These theoretical proofs of quantum supremacy all rule out classical simulations of certain quantum system by arguing that if such simulations are possible, then there will be a devastating consequence, “collapse of polynomial hierarchy”, which is deemed unlikely by computer scientists.

In this QTFT webinar, we will give a friendly introduction to the concept of quantum computing, quantum supremacy in near-term quantum devices, and the basic of computational complexity that underlie quantum supremacy arguments.

Date: 7 September 2019, Saturday

Time: 8:00pm – 10:00pm (BKK)Time

Venue: Online event


Programme Details:

8:00pm – 8:20pm: Networking

8:20pm – 8:30pm: Introduction to QTFT

8:30pm – 9:30pm: Talk

9:30pm – 10:00pm: Q&A

About the speakers:

1. Supanat Thanasilp obtained his B.Sc. and M.Sc. in theoretical Physics from Imperial college London UK and is currently doing his Ph.D. his Ph.D. in Quantum Computing under the supervision of Dimitris Angelakis at Centre for Quantum Technologies, National University of Singapore (NUS).

2. Dr.Ninnat Dangniam obtained his Ph.D. in Physics from Centre for Quantum Information and Control, University of New Mexico and is currently a postdoctoral researcher at Fudan University, Shanghai.