Related papers: Lower Bound of Concurrence Based on Generalized Po…
In recent years much effort has been concentrated towards achieving polynomial time lower bounds on algorithms for solving various well-known problems. A useful technique for showing such lower bounds is to prove them conditionally based on…
We develop an original approach for the quantitative characterisation of the entanglement properties of, possibly mixed, bi- and multipartite quantum states of arbitrary finite dimension. Particular emphasis is given to the derivation of…
We give a new version of the adversary method for proving lower bounds on quantum query algorithms. The new method is based on analyzing the eigenspace structure of the problem at hand. We use it to prove a new and optimal strong direct…
We show that, for any composite system with an arbitrary number of finite-dimensional subsystems, it is possible to directly measure the multipartite concurrence of pure states by detecting only one single factorizable observable, provided…
Bipartite matching problem is to study two disjoint groups of agents who need to be matched pairwise. It can be applied to many real-world scenarios and explain many social phenomena. In this article, we study the effect of competition on…
A common form of competition is one where judges grade contestants' performances which are then compiled to determine the final ranking of the contestants. Unlike in another common form of competition where two contestants play a…
We consider bipartite quantum state discrimination using positive-partial-transpose measurements and show that minimum-error discrimination by positive-partial-transpose measurements is closely related to entanglement witness. By using the…
We investigate how the genuine multipartite entanglement is distributed among the components of superposed states. Analytical lower and upper bounds for the usual multipartite negativity and the genuine multipartite entanglement negativity…
A quantum state's entanglement across a bipartite cut can be quantified with entanglement entropy or, more generally, Schmidt norms. Using only Schmidt decompositions, we present a simple iterative algorithm to maximize Schmidt norms.…
Squashed entanglement is a promising entanglement measure that can be generalized to multipartite case, and it has all of the desirable properties for a good entanglement measure. In this paper we present computable lower bounds to evaluate…
We investigate query-to-communication lifting theorems for models related to the quantum adversary bounds. Our results are as follows: 1. We show that the classical adversary bound lifts to a lower bound on randomized communication…
In recent years considerable progress has been made towards developing a general theory of quantum entanglement. In particular, criteria to decide whether a given quantum state is entangled are of high theoretical and practical interest.…
The detection of entanglement in a bipartite state is a crucial issue in quantum information science. Based on realignment of density matrices and the vectorization of the reduced density matrices, we introduce a new set of separability…
We derive a general framework that connects every positive map with a corresponding witness for partial separability in multipartite quantum systems. We show that many previous approaches were intimately connected to the witnesses derived…
The polynomial method and the adversary method are the two main techniques to prove lower bounds on quantum query complexity, and they have so far been considered as unrelated approaches. Here, we show an explicit reduction from the…
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many equivalent formulations, and has natural connections to…
Quantum correlations in a physical system are usually studied with respect to a unique (fixed) decomposition of the system into subsystems, without fully exploiting the rich structure of the state-space. Here, we show several examples in…
We consider the optimal discrimination of bipartite quantum states and provide an upper bound for the maximum success probability of optimal local discrimination. We also provide a necessary and sufficient condition for a measurement to…
Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper we utilize a concept of entangled graphs with weighted edges in…
In finite problems comprising objects, situations, and an object- and situation-contingent payoff function, we study the comparative statics of the set of undominated objects, meaning those for which there exists no mixture over objects…