15,549 research outputs found
On Brambles, Grid-Like Minors, and Parameterized Intractability of Monadic Second-Order Logic
Brambles were introduced as the dual notion to treewidth, one of the most
central concepts of the graph minor theory of Robertson and Seymour. Recently,
Grohe and Marx showed that there are graphs G, in which every bramble of order
larger than the square root of the treewidth is of exponential size in |G|. On
the positive side, they show the existence of polynomial-sized brambles of the
order of the square root of the treewidth, up to log factors. We provide the
first polynomial time algorithm to construct a bramble in general graphs and
achieve this bound, up to log-factors. We use this algorithm to construct
grid-like minors, a replacement structure for grid-minors recently introduced
by Reed and Wood, in polynomial time. Using the grid-like minors, we introduce
the notion of a perfect bramble and an algorithm to find one in polynomial
time. Perfect brambles are brambles with a particularly simple structure and
they also provide us with a subgraph that has bounded degree and still large
treewidth; we use them to obtain a meta-theorem on deciding certain
parameterized subgraph-closed problems on general graphs in time singly
exponential in the parameter.
The second part of our work deals with providing a lower bound to Courcelle's
famous theorem, stating that every graph property that can be expressed by a
sentence in monadic second-order logic (MSO), can be decided by a linear time
algorithm on classes of graphs of bounded treewidth. Using our results from the
first part of our work we establish a strong lower bound for tractability of
MSO on classes of colored graphs
Quantum query complexity of minor-closed graph properties
We study the quantum query complexity of minor-closed graph properties, which
include such problems as determining whether an -vertex graph is planar, is
a forest, or does not contain a path of a given length. We show that most
minor-closed properties---those that cannot be characterized by a finite set of
forbidden subgraphs---have quantum query complexity \Theta(n^{3/2}). To
establish this, we prove an adversary lower bound using a detailed analysis of
the structure of minor-closed properties with respect to forbidden topological
minors and forbidden subgraphs. On the other hand, we show that minor-closed
properties (and more generally, sparse graph properties) that can be
characterized by finitely many forbidden subgraphs can be solved strictly
faster, in o(n^{3/2}) queries. Our algorithms are a novel application of the
quantum walk search framework and give improved upper bounds for several
subgraph-finding problems.Comment: v1: 25 pages, 2 figures. v2: 26 page
Approximating local observables on projected entangled pair states
Tensor network states are for good reasons believed to capture ground states
of gapped local Hamiltonians arising in the condensed matter context, states
which are in turn expected to satisfy an entanglement area law. However, the
computational hardness of contracting projected entangled pair states in two
and higher dimensional systems is often seen as a significant obstacle when
devising higher-dimensional variants of the density-matrix renormalisation
group method. In this work, we show that for those projected entangled pair
states that are expected to provide good approximations of such ground states
of local Hamiltonians, one can compute local expectation values in
quasi-polynomial time. We therefore provide a complexity-theoretic
justification of why state-of-the-art numerical tools work so well in practice.
We comment on how the transfer operators of such projected entangled pair
states have a gap and discuss notions of local topological quantum order. We
finally turn to the computation of local expectation values on quantum
computers, providing a meaningful application for a small-scale quantum
computer.Comment: 7 pages, 1 figure, minor changes in v
An Algorithmic Theory of Integer Programming
We study the general integer programming problem where the number of
variables is a variable part of the input. We consider two natural
parameters of the constraint matrix : its numeric measure and its
sparsity measure . We show that integer programming can be solved in time
, where is some computable function of the
parameters and , and is the binary encoding length of the input. In
particular, integer programming is fixed-parameter tractable parameterized by
and , and is solvable in polynomial time for every fixed and .
Our results also extend to nonlinear separable convex objective functions.
Moreover, for linear objectives, we derive a strongly-polynomial algorithm,
that is, with running time , independent of the rest of
the input data.
We obtain these results by developing an algorithmic framework based on the
idea of iterative augmentation: starting from an initial feasible solution, we
show how to quickly find augmenting steps which rapidly converge to an optimum.
A central notion in this framework is the Graver basis of the matrix , which
constitutes a set of fundamental augmenting steps. The iterative augmentation
idea is then enhanced via the use of other techniques such as new and improved
bounds on the Graver basis, rapid solution of integer programs with bounded
variables, proximity theorems and a new proximity-scaling algorithm, the notion
of a reduced objective function, and others.
As a consequence of our work, we advance the state of the art of solving
block-structured integer programs. In particular, we develop near-linear time
algorithms for -fold, tree-fold, and -stage stochastic integer programs.
We also discuss some of the many applications of these classes.Comment: Revision 2: - strengthened dual treedepth lower bound - simplified
proximity-scaling algorith
Efficient Quantum Pseudorandomness
Randomness is both a useful way to model natural systems and a useful tool
for engineered systems, e.g. in computation, communication and control. Fully
random transformations require exponential time for either classical or quantum
systems, but in many case pseudorandom operations can emulate certain
properties of truly random ones. Indeed in the classical realm there is by now
a well-developed theory of such pseudorandom operations. However the
construction of such objects turns out to be much harder in the quantum case.
Here we show that random quantum circuits are a powerful source of quantum
pseudorandomness. This gives the for the first time a polynomialtime
construction of quantum unitary designs, which can replace fully random
operations in most applications, and shows that generic quantum dynamics cannot
be distinguished from truly random processes. We discuss applications of our
result to quantum information science, cryptography and to understanding
self-equilibration of closed quantum dynamics.Comment: 6 pages, 1 figure. Short version of http://arxiv.org/abs/1208.069
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
In this paper we consider kernelization for problems on d-degenerate graphs,
i.e. graphs such that any subgraph contains a vertex of degree at most .
This graph class generalizes many classes of graphs for which effective
kernelization is known to exist, e.g. planar graphs, H-minor free graphs, and
H-topological-minor free graphs. We show that for several natural problems on
d-degenerate graphs the best known kernelization upper bounds are essentially
tight.Comment: Full version of ESA 201
- …