Related papers: An improved lower bound on the counterfeit coins p…
We present an analysis of Wiesner's quantum money scheme, as well as some natural generalizations of it, based on semidefinite programming. For Wiesner's original scheme, it is determined that the optimal probability for a counterfeiter to…
The Change-Making Problem is to represent a given value with the fewest coins under a given coin system. As a variation of the knapsack problem, it is known to be NP-hard. Nevertheless, in most real money systems, the greedy algorithm…
A bound on the error introduced by truncating a quantum addition is given. This bound shows that only a few controlled rotation gates will be necessary to get a reliable computation.
Quantum cryptographic definitions are often sensitive to the number of copies of the cryptographic states revealed to an adversary. Making definitional changes to the number of copies accessible to an adversary can drastically affect…
A new error bound for the linear complementarity problem when the matrix involved is a B-matrix is presented, which improves the corresponding result in [C.Q. Li et al., A new error bound for linear complementarity problems for B-matrices.…
By some new recursive algorithms, in this paper, we will give some improvements on Waring's problem.
We provide a simple method to obtain an upper bound on the secret key rate that is particularly suited to analyze practical realizations of quantum key distribution protocols with imperfect devices. We consider the so-called trusted device…
In this paper, we study estimates for eigenvalues of the clamped plate problem. A sharp upper bound for eigenvalues is given and the lower bound for eigenvalues in [10] is improved.
A finite horizon variant of the quickest change detection problem is studied, in which the goal is to minimize a delay threshold (latency), under constraints on the probability of false alarm and the probability that the latency is…
This paper proposes a new method for the K-armed dueling bandit problem, a variation on the regular K-armed bandit problem that offers only relative feedback about pairs of arms. Our approach extends the Upper Confidence Bound algorithm to…
We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…
We give an improved lower bound for the $L_2$-discrepancy of finite point sets in the unit square.
In this paper, we will continue the investigation of Waring's problem, and give further improvements.
Identity disclosure of an individual from a released data is a matter of concern especially if it belongs to a category with low frequency in the data-set. Nayak et al. (2016) discussed this problem vividly in a census report and suggested…
In this paper, we establish sufficient conditions for the existence of error bounds at infinity for lower semicontinuous inequality systems. We also show that the existence of an error bound at infinity of constraint systems plays an…
In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…
The collision problem is to decide whether a function X:{1,..,n}->{1,..,n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of Theta(n^{1/5}) on the number of queries needed by a quantum computer to…
We consider the problem of \textit{best arm identification} with a \textit{fixed budget $T$}, in the $K$-armed stochastic bandit setting, with arms distribution defined on $[0,1]$. We prove that any bandit strategy, for at least one bandit…
In any attempt at designing an efficient algorithm for the minimum vertex cover problem, obtaining good upper and lower bounds for the vertex cover number could be crucial. In this article we present a modified greedy algorithm of…
Given a set of coins arranged in a line, we remove heads-up coins one at a time and flip any adjacent coins after each removal. The coin-removal problem is to determine for which arrangements of coins it is possible to remove all of the…