Timing Analysis of Quantum Computing Systems

Abstract

Despite the potential of quantum computing for drastically accelerating suitable real-time applications, response time analysis is still required to guarantee that quantum programs running on quantum computers satisfy application-specific timing requirements. This lecture describes our initial effort to determine whether a quantum program running on a quantum computer satisfies the timing constraints of a real-time application, that is, is quantum computing punctual and reliable in this time-sensitive application domain? Can this timing guarantee be formally verified? We leverage the existing work on the functional reactive programming (FRP) model to predict the worst-case response time (WCRT) of fault-tolerant classical computing systems since the timing analysis of re-executions for fault recovery plus transient-faults-induced wasted execution time is similar to determining the response time of FRP tasks. Ongoing work shows that accounting for wasted execution time due to errors in quantum computers resulting from quantum decoherence and state fidelity can be treated similarly and develops a mapping from quantum programs to FRP programs for efficient timing analysis.

About this Lecture

Request this Lecture

To request this particular lecture, please complete this online form.

Request a Tour

To request a tour with this speaker, please complete this online form.

All requests will be sent to ACM headquarters for review.