74,232 research outputs found
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
In this paper we show a new way of constructing deterministic polynomial-time
approximation algorithms for computing complex-valued evaluations of a large
class of graph polynomials on bounded degree graphs. In particular, our
approach works for the Tutte polynomial and independence polynomial, as well as
partition functions of complex-valued spin and edge-coloring models.
More specifically, we define a large class of graph polynomials
and show that if and there is a disk centered at zero in the
complex plane such that does not vanish on for all bounded degree
graphs , then for each in the interior of there exists a
deterministic polynomial-time approximation algorithm for evaluating at
. This gives an explicit connection between absence of zeros of graph
polynomials and the existence of efficient approximation algorithms, allowing
us to show new relationships between well-known conjectures.
Our work builds on a recent line of work initiated by. Barvinok, which
provides a new algorithmic approach besides the existing Markov chain Monte
Carlo method and the correlation decay method for these types of problems.Comment: 27 pages; some changes have been made based on referee comments. In
particular a tiny error in Proposition 4.4 has been fixed. The introduction
and concluding remarks have also been rewritten to incorporate the most
recent developments. Accepted for publication in SIAM Journal on Computatio
On the relationship between continuous- and discrete-time quantum walk
Quantum walk is one of the main tools for quantum algorithms. Defined by
analogy to classical random walk, a quantum walk is a time-homogeneous quantum
process on a graph. Both random and quantum walks can be defined either in
continuous or discrete time. But whereas a continuous-time random walk can be
obtained as the limit of a sequence of discrete-time random walks, the two
types of quantum walk appear fundamentally different, owing to the need for
extra degrees of freedom in the discrete-time case.
In this article, I describe a precise correspondence between continuous- and
discrete-time quantum walks on arbitrary graphs. Using this correspondence, I
show that continuous-time quantum walk can be obtained as an appropriate limit
of discrete-time quantum walks. The correspondence also leads to a new
technique for simulating Hamiltonian dynamics, giving efficient simulations
even in cases where the Hamiltonian is not sparse. The complexity of the
simulation is linear in the total evolution time, an improvement over
simulations based on high-order approximations of the Lie product formula. As
applications, I describe a continuous-time quantum walk algorithm for element
distinctness and show how to optimally simulate continuous-time query
algorithms of a certain form in the conventional quantum query model. Finally,
I discuss limitations of the method for simulating Hamiltonians with negative
matrix elements, and present two problems that motivate attempting to
circumvent these limitations.Comment: 22 pages. v2: improved presentation, new section on Hamiltonian
oracles; v3: published version, with improved analysis of phase estimatio
Algorithms for the Problems of Length-Constrained Heaviest Segments
We present algorithms for length-constrained maximum sum segment and maximum
density segment problems, in particular, and the problem of finding
length-constrained heaviest segments, in general, for a sequence of real
numbers. Given a sequence of n real numbers and two real parameters L and U (L
<= U), the maximum sum segment problem is to find a consecutive subsequence,
called a segment, of length at least L and at most U such that the sum of the
numbers in the subsequence is maximum. The maximum density segment problem is
to find a segment of length at least L and at most U such that the density of
the numbers in the subsequence is the maximum. For the first problem with
non-uniform width there is an algorithm with time and space complexities in
O(n). We present an algorithm with time complexity in O(n) and space complexity
in O(U). For the second problem with non-uniform width there is a combinatorial
solution with time complexity in O(n) and space complexity in O(U). We present
a simple geometric algorithm with the same time and space complexities.
We extend our algorithms to respectively solve the length-constrained k
maximum sum segments problem in O(n+k) time and O(max{U, k}) space, and the
length-constrained maximum density segments problem in O(n min{k, U-L})
time and O(U+k) space. We present extensions of our algorithms to find all the
length-constrained segments having user specified sum and density in O(n+m) and
O(nlog (U-L)+m) times respectively, where m is the number of output.
Previously, there was no known algorithm with non-trivial result for these
problems. We indicate the extensions of our algorithms to higher dimensions.
All the algorithms can be extended in a straight forward way to solve the
problems with non-uniform width and non-uniform weight.Comment: 21 pages, 12 figure
- …