In the effort to develop useful quantum computers simulating quantum machines with
conventional computing resources is a key capability. Such simulations will always face …

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 …

Tensor networks are a popular and computationally efficient approach to simulate general
quantum systems on classical computers and, in a broader sense, a framework for dealing …

With quantum computers promising advantages even in the near-term NISQ era, there is a
lively community that develops software and toolkits for the design of corresponding …

Automated reasoning techniques have been proven of immense importance in classical
applications like formal verification, circuit design and probabilistic inference. The domain of …

We define QSE, a symbolic execution framework for quantum programs by integrating
symbolic variables into quantum states and the outcomes of quantum measurements. The …

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 …

Efficient methods for the representation and simulation of quantum states and quantum
operations are crucial for the optimization of quantum circuits. Decision diagrams (DDs), a …

We study the fundamental design automation problem of equivalence checking in the NISQ
(Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present …

Classical simulations of quantum computations are vital for the future development of this
emerging technology. To this end, decision diagrams have been proposed as a …