Loading [Contrib]/a11y/accessibility-menu.js
Caltech Home > PMA Home > Calendar > IQIM Postdoctoral and Graduate Student Seminar
open search form
Friday, May 16, 2025
12:00 PM - 1:00 PM
East Bridge 114

IQIM Postdoctoral and Graduate Student Seminar

Certified randomness using a trapped-ion quantum processor
Ruslan Shaydulin, JPMorganChase,
Speaker's Bio:
Ruslan Shaydulin is Head of Quantum Engineering Research at the Global Technology Applied Research center at JPMorgan Chase, where he and his team focus on practical aspects of evaluating quantum algorithmic speedups and realizing them on hardware. Areas of responsibility of Ruslan’s team include numerical benchmarking of quantum algorithms, compilation and execution on quantum hardware, compilation to fault-tolerant architectures and error correction. Prior to joining JPMorgan Chase, Ruslan was a Maria Goeppert Mayer fellow at Argonne National Laboratory. You can follow him on LinkedIn at https://www.linkedin.com/in/rshaydu

Abstract: Although quantum computers can perform a wide range of practically important tasks beyond the abilities of classical computers, realizing this potential remains a challenge. An example is to use an untrusted remote device to generate random bits that can be certified to contain a certain amount of entropy. Certified randomness has many applications but is impossible to achieve solely by classical computation. Here we demonstrate the generation of certifiably random bits using the 56-qubit Quantinuum H2-1 trapped-ion quantum computer accessed over the Internet. Our protocol leverages the classical hardness of recent random circuit sampling demonstrations: a client generates quantum ‘challenge' circuits using a small randomness seed, sends them to an untrusted quantum server to execute and verifies the results of the server. We analyze the security of our protocol against a restricted class of realistic near-term adversaries. Using classical verification with measured combined sustained performance of 1.1 × 1018 floating-point operations per second across multiple supercomputers, we certify 71,313 bits of entropy under this restricted adversary and additional assumptions. Our results demonstrate a step towards the practical applicability of present-day quantum computers. See paper for more details: https://www.nature.com/articles/s41586-025-08737-1

Lunch will be provided following the talk.

For more information, please contact Marcia Brown by phone at 626-395-4013 or by email at marcia.brown@caltech.edu.