On the Noise Resilience of Quantum Algorithms

ORAL

Abstract

Quantum systems are particularly sensitive to noise, which typically negates all potential quantum advantages in computing or sensing. Thus, noise resilience is crucial to potential demonstrations of useful quantum advantages.

Current quantum computers have advanced enough that they can implement operations in many different ways. This raises the problem of identifying the best implementation of a quantum operation. The most common and intuitive approach is to consider the ones with the shortest runtime or minimum circuit complexity. I will present an alternative approach that aims for noise-resilient algorithm implementations. To do so, I introduce a general and simple framework to characterize a quantum system’s resilience to noise. Perhaps counter to intuition, the protocols with the shortest runtimes are not always the most resilient.

*This work was supported by the U.S. Department of Energy, Office of Advanced Scientific Computing Research, Accelerated Research for Quantum Computing program, Fundamental Algorithmic Research for Quantum Computing (FAR-QC) project, the Laboratory Directed Research and Development program of Los Alamos National Laboratory, and Beyond Moore's Law project of the Advanced Simulation and Computing Program.

–

Publication: https://arxiv.org/abs/2408.02764

Presenters

  • Luis Pedro P Garcia-Pintos

    • Los Alamos National Laboratory (LANL)

Authors

  • Luis Pedro P Garcia-Pintos

    • Los Alamos National Laboratory (LANL)

  • Tanmoy Biswas

    • Los Alamos National Laboratory

  • Tom O'Leary

    • Oxford University

  • Jacob A Bringewatt

    • NIST / University of Maryland, College Park / Harvard University
    • Harvard University
    • University of Maryland College Park

  • Lucas Tyler Brady

    • NASA Ames Research Center

  • Lukasz Cincio

    • Los Alamos National Laboratory (LANL)

  • Yi-Kai Liu

    • National Institute of Standards and Technology (NIST)