To implement quantum algorithms on quantum computers it is crucial to decompose their
operators into the limited gate set supported by those computers. Unfortunately, existing …

While quantum computing holds great potential in combinatorial optimization, electronic
structure calculation, and number theory, the current era of quantum computing is limited by …

In this article, we present a novel method for synthesizing quantum circuits from user-
supplied components. Given input-output state vectors and component quantum gates, our …

Quantum state preparation initializes the quantum registers and is essential for running
quantum algorithms. Designing state preparation circuits that entangle qubits efficiently with …

Resource efficient and high precision compilation of programs into quantum circuits
expressed in Fault-Tolerant gate sets, such as the Clifford+ T gate set, is vital for the success …

Optimizing quantum circuits is critical: the number of quantum operations needs to be
minimized for a successful evaluation of a circuit on a quantum processor. In this paper we …

Quantum gate synthesis based on numerical optimization produces efficient circuits for NISQ
(Noisy Intermediate-Scale Quantum) computing by minimizing the number of two-qubit …

We study a variant of the subgraph isomorphism problem that is of high interest to the
quantum computing community. Our results give an algorithm to perform pattern matching in …

The parallel map operation is an important parallelization primitive which can be used as a”
parallel for” to accelerate serial code, or to build models of parallel code such as” Map …

A Complete Bibliography of ACM Transactions on Quantum Computing (TQC) Page 1 A
Complete Bibliography of ACM Transactions on Quantum Computing (TQC) Nelson HF …