No abstract

We consider online algorithms for the k-server problem on trees. Chrobak and Larmore proposed a k-competitive algorithm for this problem that has the optimal competitive ratio. However, a naive implementation of their algorithm has O(n) time complexity for processing each query, where n is the number of nodes in the tree. We propose a new time-efficient implementation of this algorithm that has O(n log n) time complexity for preprocessing and O k 2 + k • log n time for processing a query. We also propose a quantum algorithm for the case where the nodes of the tree are presented using string paths. In this case, no preprocessing is needed, and the time complexity for each query is O(k 2 √ n log n). When the number of queries is o√ n k 2 log n , we obtain a quantum speedup on the total runtime compared to our classical algorithm. Our algorithm builds on a result of independent interest: we give a quantum algorithm to find the first marked element in a collection of m objects, that works even in the presence of two-sided bounded errors on the input oracle. It has worst-case complexity O( √ m). In the particular case of one-sided errors on the input, it has expected time complexity O( √ x)where x is the position of the first marked element.

We study the applicability of quantum algorithms in computational game theory and generalize some results related to Subtraction games, which are sometimes referred to as one-heap Nim games. In quantum game theory, a subset of Subtraction games became the first explicitly defined class of zero-sum combinatorial games with provable separation between quantum and classical complexity of solving them. For a narrower subset of Subtraction games, an exact quantum sublinear algorithm is known that surpasses all deterministic algorithms for finding solutions with probability 1. Typically, both Nim and Subtraction games are defined for only two players. We extend some known results to games for three or more players, while maintaining the same classical and quantum complexities: Θ n 2 and Õ n 1.5 respectively.

We present the quantum algorithm for the Longest Trail Problem. The problem is to search the longest edge-simple path for a graph with n vertexes and m edges. Here edge-simple means no edge occurs in the path twice, but vertexes can occur several times. The running time of our algorithm is O * (1.728 m ).