Architectures and algorithms for early FTQC
e-mail: hanyan@issp.u-tokyo.ac.jpLanguage in Speech : English
Date: Theory session: Mar. 14 (Fir), 2025, 13:00~14:00
Hands-on workshop: Mar. 17 (Mon), 2025, 10 :00~13 :00
Place: Theory session: A614, 6th Floor, ISSP and on Zoom
Hands-on workshop: A615, 6th Floor, ISSP (in-person only)
Speaker: Dr. Andreas Thomasen
Affiliation: QunaSys Inc.
Title: Architectures and algorithms for early FTQC
Abstract:
Theory session: The Noisy Intermediate-Scale Quantum (NISQ) era of quantum computing is characterized by quantum devices that have low error rates, but no error correction and typically on the order of 100 qubits, whereas the era of fault-tolerant quantum computing (FTQC) requires devices with full error correction facilitated by hundreds of thousands to millions of qubits for every logical qubit. Due to the distinct requirements and operating characteristics of these devices, algorithms and applications supported by NISQ and FTQC respectively are highly distinct as well. However, this leaves a large gap, both in terms of devices, algorithms and applications which exist in the intermediate regime where partial error correction is possible and the devices support on the order of tens of thousands of qubits. In this seminar we will give a brief introduction to quantum computing for a non-specialist audience. We will then describe device architectures and algorithms that are specifically designed to fill this gap during the so-called early FTQC era. We will present the space-time efficient analogue rotation (STAR) architecture together with some algorithms that are well supported by it, namely quantum selected configuration interaction (QSCI) and statistical phase estimation (SPE). This seminar serves as theoretical background for our hands-on session on QURI SDK. The algorithms introduced are directly available as OSS as described in https://quri-sdk.qunasys.com/
Hands-on workshop: This workshop will be a hands-on session on QURI SDK, following the seminar by on March 14th. Even if you did not attend the previous seminar, please join us if you would like to learn how to use QURI SDK. The workshop outline is as follows:
1) General introduction to QURI SDK and its intended workflow
2) Introduction to QURI VM with various virtual devices introduced
3) Experimenting with surface code parameters in QURI VM
4) Introduction to QURI Algo and algorithm components
5) Introduction to various algorithms for early FTQC
The learning objectives for this workshop is for the participants to be able to write quantum algorithms for their own research problems and simulate their performance on quantum hardware.
About the speaker: Dr. Andreas M. D. Thomasen is a research and development engineer at QunaSys with wide experience in NISQ algorithm development, software development and theoretical physics. His current research work focuses on benchmarking algorithms and developing industry applications using real quantum computing systems. Dr. Thomasen received his Ph.D. in Physics from the Okinawa Institute of Science and Technology focused in Topology in Condensed Matter. He holds a Master of Engineering in Optics and Electronics from Aarhus University in Denmark focused on Quantum cryptography.
About the company: QunaSys is advancing the industrial application of quantum computing through collaborations with numerous companies and research institutions. Through joint research with these partners, they are developing new technologies to help businesses build a competitive edge, exemplified by the creation of our quantum chemistry calculation method, “QSCI” (Quantum-Selected Configuration Interaction). Looking ahead to the era of fault-tolerant quantum computers (FTQC), we are also working to expand applications in new fields like Computer-Aided Engineering (CAE) and offering tools like QURI SDK to maximize quantum computing capabilities and improve algorithm development efficiency.
Please register here for the Zoom link for the theory session:
https://forms.gle/HKzfBaHgb8vrqiibA
Hands-on session is in-person only.