Challenging Quantum Advantage with Classical Simulation

Actions Panel

Challenging Quantum Advantage with Classical Simulation

By Washington DC Quantum Computing MeetupFollow

When and where

Date and time

Saturday, August 12 · 10am – 12pm PDT

Location

Online

About this event

  • 2 hours
  • Mobile eTicket

Summary: Demonstrating quantum advantage is a critical proof-of-principle step in building quantum computers, where a quantum experiment generates computational results that are hard to obtain with classical computers. The most well-known example is Google’s quantum supremacy experiment that samples random outputs from a superconducting processor. Subsequent demonstrations using photonic quantum computers, specifically Gaussian boson sampling, are performed by USTC and Xanadu, and they claim that classical simulations would take millions of times longer. However, experimental noise and imperfections give potential angles of attack that may allow classical simulations to exploit. We challenge the photonic quantum supremacy experiments using classical simulation, using a novel algorithm that extracts the true quantum resource in the experiment, benefiting from the noise of the experiments. We simulate the largest Gaussian boson sampling experiments in an hour, producing computational results that have better quality measured by all metrics that we can test so far.

Biography: Minzhao Liu is a Physics PhD candidate at the University of Chicago, supervised by Dr. Yuri Alexeev at Argonne National Laboratory. He is currently a research associate intern at JPMorgan Chase. His research focuses on utilizing classical simulation techniques such as tensor networks to study quantum systems, including variational quantum algorithms, quantum machine learning, quantum communication, etc.

Moderator: Il Young Chung, co-organizer of Quantum Computing & Data Science

Report this event
https://www.eventbrite.com/e/challenging-quantum-advantage-with-classical-simulation-tickets-655987465167

Other events you may like

1 65 66 67 68 69 151