4,136 research outputs found
Approximating Turaev-Viro 3-manifold invariants is universal for quantum computation
The Turaev-Viro invariants are scalar topological invariants of compact,
orientable 3-manifolds. We give a quantum algorithm for additively
approximating Turaev-Viro invariants of a manifold presented by a Heegaard
splitting. The algorithm is motivated by the relationship between topological
quantum computers and (2+1)-D topological quantum field theories. Its accuracy
is shown to be nontrivial, as the same algorithm, after efficient classical
preprocessing, can solve any problem efficiently decidable by a quantum
computer. Thus approximating certain Turaev-Viro invariants of manifolds
presented by Heegaard splittings is a universal problem for quantum
computation. This establishes a novel relation between the task of
distinguishing non-homeomorphic 3-manifolds and the power of a general quantum
computer.Comment: 4 pages, 3 figure
Rank-width and Tree-width of H-minor-free Graphs
We prove that for any fixed r>=2, the tree-width of graphs not containing K_r
as a topological minor (resp. as a subgraph) is bounded by a linear (resp.
polynomial) function of their rank-width. We also present refinements of our
bounds for other graph classes such as K_r-minor free graphs and graphs of
bounded genus.Comment: 17 page
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
We present a near-optimal polynomial-time approximation algorithm for the
asymmetric traveling salesman problem for graphs of bounded orientable or
non-orientable genus. Our algorithm achieves an approximation factor of O(f(g))
on graphs with genus g, where f(n) is the best approximation factor achievable
in polynomial time on arbitrary n-vertex graphs. In particular, the
O(log(n)/loglog(n))-approximation algorithm for general graphs by Asadpour et
al. [SODA 2010] immediately implies an O(log(g)/loglog(g))-approximation
algorithm for genus-g graphs. Our result improves the
O(sqrt(g)*log(g))-approximation algorithm of Oveis Gharan and Saberi [SODA
2011], which applies only to graphs with orientable genus g; ours is the first
approximation algorithm for graphs with bounded non-orientable genus.
Moreover, using recent progress on approximating the genus of a graph, our
O(log(g) / loglog(g))-approximation can be implemented even without an
embedding when the input graph has bounded degree. In contrast, the
O(sqrt(g)*log(g))-approximation algorithm of Oveis Gharan and Saberi requires a
genus-g embedding as part of the input.
Finally, our techniques lead to a O(1)-approximation algorithm for ATSP on
graphs of genus g, with running time 2^O(g)*n^O(1)
Small eigenvalues of random 3-manifolds
We show that for every there exists a number such that the
smallest positive eigenvalue of a random closed 3-manifold of Heegaard
genus is at most .Comment: 52 pages. Major revisio
- …