A Verified Optimizer for Quantum Circuits

被引：2

作者：

Hietala, Kesha ^{[1
,2
]}

Rand, Robert ^{[3
]}

Li, Liyi ^{[1
]}

Hung, Shih-Han ^{[4
]}

Wu, Xiaodi ^{[1
]}

Hicks, Michael ^{[1
,2
]}

机构：

[1] Univ Maryland, Baltimore, MD USA

[2] Univ Amazon, Seattle, WA USA

[3] Univ Chicago, Chicago, IL USA

[4] Univ Texas Austin, Austin, TX USA

来源：

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS | 2023年 / 45卷 / 03期

关键词：

Formal verification; quantum computing; circuit optimization; certified compilation;

D O I：

10.1145/3604630

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We present voqc, the first verified optimizer for quantum circuits, written using the Coq proof assistant. Quantum circuits are expressed as programs in a simple, low-level language called sqir, a small quantum intermediate representation, which is deeply embedded in Coq. Optimizations and other transformations are expressed as Coq functions, which are proved correct with respect to a semantics of sqir programs. sqir programs denote complex-valued matrices, as is standard in quantum computation, but we treat matrices symbolically to reason about programs that use an arbitrary number of quantum bits. sqir's careful design and our provided automation make it possible to write and verify a broad range of optimizations in voqc, including full-circuit transformations from cutting-edge optimizers.

引用

页数：35

共 55 条

[1]

Aleksandrowicz Gadi, 2019, Zenodo, DOI 10.5281/ZENODO.2562110

[2]

Amy M., 2018, arXiv

[3] staq-A full-stack quantum processing toolkit [J].