Related papers: Optimal quantum adversary lower bounds for ordered…
We introduce and study the problem of dueling optimization with a monotone adversary, which is a generalization of (noiseless) dueling convex optimization. The goal is to design an online algorithm to find a minimizer $\mathbf{x}^{*}$ for a…
Though competitive analysis is often a very good tool for the analysis of online algorithms, sometimes it does not give any insight and sometimes it gives counter-intuitive results. Much work has gone into exploring other performance…
Consider the following classical search problem: given a target point $p\in \Re$, starting at the origin, find $p$ with minimum cost, where cost is defined as the distance travelled. Let $D$ be the distance of $p$ from the origin. When no…
An algorithm for structured database searching is presented and used to solve the set partition problem. O(n) oracle calls are required in order to obtain a solution, but the probability that this solution is optimal decreases exponentially…
The textbook adversary bound for function evaluation states that to evaluate a function $f\colon D\to C$ with success probability $\frac{1}{2}+\delta$ in the quantum query model, one needs at least $\left( 2\delta -\sqrt{1-4\delta^2}…
In the SEARCH WITH ADVICE problem, a single entry of interest within a database of N entries is to be found assuming that an ordering of the entries, from that with the highest probability of being the entry of interest (as determined by a…
For the unsorted database quantum search with the unknown fraction $\lambda$ of target items, there are mainly two kinds of methods, i.e., fixed-point or trail-and-error. (i) In terms of the fixed-point method, Yoder et al. [Phys. Rev.…
In this paper, we study the concurrence of arbitrary dimensional tripartite quantum systems. An explicit operational lower bound of concurrence is obtained in terms of the concurrence of sub-states. A given example show that our lower bound…
Consider the following generalization of the classic binary search problem: A searcher is required to find a hidden target vertex $x$ in a graph $G$. To do so, they iteratively perform queries to an oracle, each about a chosen vertex $v$.…
We present an oracle-efficient relaxation for the adversarial contextual bandits problem, where the contexts are sequentially drawn i.i.d from a known distribution and the cost sequence is chosen by an online adversary. Our algorithm has a…
In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…
We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state…
In the online bin packing problem, items of sizes in (0,1] arrive online to be packed into bins of size 1. The goal is to minimize the number of used bins. In this paper, we present an online bin packing algorithm with asymptotic…
In this paper we present a novel strategy to solve optimization problems within a hybrid quantum-classical scheme based on quantum annealing, with a particular focus on QUBO problems. The proposed algorithm is based on an iterative…
This paper aims to solve machine learning optimization problem by using quantum circuit. Two approaches, namely the average approach and the Partial Swap Test Cut-off method (PSTC) was proposed to search for the global minimum/maximum of…
Quantum Search Algorithm made a big impact by being able to solve the search problem for a set with $N$ elements using only $O(\sqrt{N})$ steps. Unfortunately, it is impossible to reduce the order of the complexity of this problem, however,…
In the online (time-series) search problem, a player is presented with a sequence of prices which are revealed in an online manner. In the standard definition of the problem, for each revealed price, the player must decide irrevocably…
Quantum channel discrimination is a fundamental problem in quantum information science. In this study, we consider general quantum channel discrimination problems, and derive the lower bounds of the error probability. Our lower bounds are…
We study a variant of the searching problem where the environment consists of a known terrain and the goal is to obtain visibility of an unknown target point on the surface of the terrain. The searcher starts on the surface of the terrain…
Given an item and a list of values of size $N$. It is required to decide if such item exists in the list. Classical computer can search for the item in O(N). The best known quantum algorithm can do the job in $O(\sqrt{N})$. In this paper, a…