The promise of quantum computers is that certain computational tasks might be executed
exponentially faster on a quantum processor than on a classical processor 1. A fundamental …

This paper presents an overview of the topology of D-Wave's next-generation quantum
processors. It provides examples of minor embeddings and discusses performance of …

Here we present qFlex, a flexible tensor network-based quantum circuit simulator. qFlex can
compute both the exact amplitudes, essential for the verification of the quantum hardware …

There are many graph problems that can be solved in linear or polynomial time with a
dynamic programming algorithm when the input graph has bounded treewidth. For …

For more and more applications, it is important to be able to compute the treewidth of a given
graph and to find tree decompositions of small width reasonably fast. This paper gives an …

In this work, we present a new large-scale quantum circuit simulator. It is based on the
tensor network contraction technique to represent quantum circuits. We propose a novel …

This paper discusses techniques for solving discrete optimization problems using quantum
annealing. Practical issues likely to affect the computation include precision limitations, finite …

LNCS 4474 - Treewidth: Structure and Algorithms Page 1 Treewidth: Structure and Algorithms
Hans L. Bodlaender Institute of Information and Computing Sciences, Utrecht University, PO …

Treewidth is a graph parameter with several interesting theoretical and practical
applications. This survey reviews algorithmic results on determining the treewidth of a given …

Consider a dynamic programming scheme for a decision problem in which all subproblems
involved are also decision problems. An implementation of such a scheme is positive …