3 research outputs found
Ramsey numbers and adiabatic quantum computing
The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In
fact, for the two-color Ramsey numbers with , only nine are
currently known. We present a quantum algorithm for the computation of the
Ramsey numbers . We show how the computation of can be mapped
to a combinatorial optimization problem whose solution can be found using
adiabatic quantum evolution. We numerically simulate this adiabatic quantum
algorithm and show that it correctly determines the Ramsey numbers R(3,3) and
R(2,s) for . We then discuss the algorithm's experimental
implementation, and close by showing that Ramsey number computation belongs to
the quantum complexity class QMA.Comment: 4 pages, 1 table, no figures, published versio
Rare Siblings Speed-Up Deterministic Detection and Counting of Small Pattern Graphs
We consider a class of pattern graphs on (formula presented) vertices that have q-2 distinguished vertices with equal neighborhood in the remaining two vertices. Two pattern graphs in this class are siblings if they differ by some edges connecting the distinguished vertices. In particular, we show that if induced copies of siblings to a pattern graph in such a class are rare in the host graph then one can detect the pattern graph relatively efficiently. For example, we infer that if there are (formula presented) induced copies of a diamond (i.e., a graph on four vertices missing a single edge to be complete) in the host graph, then an induced copy of the complete graph on four vertices, K:4 as well as an induced copy of the cycle on four vertices, C:4 can be deterministically detected in (formula presented) time. Note that the fastest known algorithm for K:4 and the fastest known deterministic algorithm for C:4 run in (formula presented) time. We also show that if there is a family of siblings whose induced copies in the host graph are rare then there are good chances to determine the numbers of occurrences of induced copies for all pattern graphs on q vertices relatively efficiently