TOP
Events & Outreach
R-CCS Cafe
The 239th R-CCS Cafe - part 1
The 239th R-CCS Cafe - part 1
JapaneseTitle
Classical supremacy: How to solve quantum many-body problems on classical computers using tensor networks
Date | Fri, Nov 18, 2022 |
---|---|
Time | 4:00 pm - 4:20 pm (5 pm - 5:20 pm Discussion, 5:20 pm - Free discussion (optional)) |
City | Online |
Place | Online seminar on Zoom
|
Language | Presentation Language: English Presentation Material: English |
Speakers |
Rongyang SUN Computational Materials Science Research Team ![]() |
Abstract
Recently, the "possible" advantages of the quantum computer compared to its classical counterpart have attracted lots of research interest in quantum computing. A quantum computing process can be considered as a controllable evolution of a synthetic quantum many-body system, and quantum supremacy is equivalent to saying that the corresponding quantum many-body problem is exponentially hard for the classical computer. However, it isn't the whole story! We still have advantages from the classical side. In this talk, I will discuss (i) the essential features of quantum many-body problems, (ii) the suitable classical simulation tools, i.e., tensor network methods, developed based on these features, and (iii) achievements, challenges, and opportunities of combining modern supercomputers and tensor network methods on solving quantum many-body problems.
Important Notes
- Please turn off your video and microphone when you join the meeting.
- The broadcasting may be interrupted or terminated depending on the network condition or any other unexpected event.
- The program schedule and contents may be modified without prior notice.
- Depending on the utilized device and network environment, it may not be able to watch the session.
- All rights concerning the broadcasted material will belong to the organizer and the presenters, and it is prohibited to copy, modify, or redistribute the total or a part of the broadcasted material without the previous permission of RIKEN.
(Nov 11, 2022)