Learn · CERN

Talk9 min

Speeding-up simulations of quantum algorithms for material science

Gehad Ahmed · CERN

Watch At CERN

About

Due to its intrinsic quantum mechanical nature, applications in chemistry and materials science are among the strongest candidates for algorithmic quantum advantage. However, to understand the problem size at the break-equal point between quantum and classical solutions, one requires large-scale simulations of quantum circuits. Here, we propose to develop and investigate an emulation approach to reduce the cost of simulating trotterized Hamiltonian evolution (a very common subroutine of many chemistry applications) by efficiently emulating multi-qubit rotations. To assess the practical impact and efficiency of our emulation strategy, we are conducting comprehensive benchmarks. These benchmarks compare the performance and resource utilization of multi-qubit rotation implementations against the single and double-qubit rotations. Following the evaluation, we aim to explore ways to integrate the emulation strategy into the Intel Quantum SDK or other quantum computing frameworks to enhance their efficacy and accessibility for quantum chemistry computations..

0:00:00 Slide 1

0:00:19 Slide 2

0:00:36 Slide 3

0:00:53 Slide 4

0:01:11 Slide 5

0:01:28 Slide 6

0:01:45 Slide 7

0:02:03 Slide 8

0:02:20 Slide 9

0:02:37 Slide 10

0:02:55 Slide 11

The talk

  1. Speeding-up simulations of quantum algorithms for material science 2024-08-12 · 9 min · CERN's player

Credits and licence

Institution
CERN
Department
CERN openlab Summer Student Programme 2024
Speaker
Gehad Ahmed
Year
2024
Language
English
Subjects
Physics, Computer science
Source
CERN
Licence
CERN, as CERN states it. CERN's terms
Attribution
© CERN. CERN provides its audiovisual media free of charge for educational and informational use, credited to CERN; this lecture is shown in CERN's own player.
Who can watch
CERN gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed