activity
20182022
most citedGleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version)

3 citations · 4 across the 4 of their papers we have counts for

collaborators

7 papers

cs.LG2022

A Convergence Theory for Federated Average: Beyond Smoothness

Xiaoxiao Li, Zhao Song, Runzhou Tao +1

Federated learning enables a large amount of edge computing devices to learn a model without data sharing jointly. As a leading algorithm in this setting, Federated Average FedAvg,…

cs.PL2022

Giallar: Push-Button Verification for the Qiskit Quantum Compiler

Runzhou Tao, Yunong Shi, Jianan Yao +5

This paper presents Giallar, a fully-automated verification toolkit for quantum compilers. Giallar requires no manual specifications, invariants, or proofs, and can automatically v…

cs.PL20221 cited

A Formally Certified End-to-End Implementation of Shor's Factorization Algorithm

Yuxiang Peng, Kesha Hietala, Runzhou Tao +4

Quantum computing technology may soon deliver revolutionary improvements in algorithmic performance, but these are only useful if computed answers are correct. While hardware-level…

cs.PL20213 cited

Gleipnir: Toward Practical Error Analysis for Quantum Programs (Extended Version)

Runzhou Tao, Yunong Shi, Jianan Yao +3

Practical error analysis is essential for the design, optimization, and evaluation of Noisy Intermediate-Scale Quantum(NISQ) computing. However, bounding errors in quantum programs…

quant-ph2019

CertiQ: A Mostly-automated Verification of a Realistic Quantum Compiler

Yunong Shi, Runzhou Tao, Xupeng Li +4

We present CertiQ, a verification framework for writing and verifying compiler passes of Qiskit, the most widely-used quantum compiler. To our knowledge, CertiQ is the first effort…

cs.CC2018

Streaming Hardness of Unique Games

Venkatesan Guruswami, Runzhou Tao

We study the problem of approximating the value of a Unique Game instance in the streaming model. A simple count of the number of constraints divided by , the alphabet size of t…