Quantum computers promise dramatic advantages in processing speed over currently
available computer systems. Quantum computing offers great promise in a wide variety of …

Quantum programs exhibit inherent non-deterministic behavior, which poses more
significant challenges for error discovery compared to classical programs. While several …

Quantum circuit compilation comprises many computationally hard reasoning tasks that lie
inside# P and its decision counterpart in PP. The classical simulation of universal quantum …

Universal and fault-tolerant quantum computation is a promising new paradigm that may
efficiently conquer difficult computation tasks beyond the reach of classical computation. It …

Equivalence checking of quantum circuits is an essential element in quantum program
compilation, in which a quantum program can be synthesized into different quantum circuits …

We study how parallelism can speed up quantum simulation. A parallel quantum algorithm
is proposed for simulating the dynamics of a large class of Hamiltonians with good sparse …

The existence of universal quantum computers has been theoretically well established.
However, building up a real quantum computer system not only relies on the theory of …

In this survey paper, we describe a framework for assertion-based verification of quantum
circuits by applying model checking techniques for quantum systems developed in our …

In this paper, we introduce VeriQBench--an open source benchmark for quantum circuits. It
offers high-level quantum circuit abstractions of various circuit types, including 1) …

In this position paper, we posit that a major Department of Energy (DOE)-funded open-
source quantum compilation platform is needed to facilitate:(a) resource optimization at the …