相关论文: Tighter bounds for generalized monogamy and polyga…
We analyze Kumar's recent quadratic algebraic branching program size lower bound proof method (CCC 2017) for the power sum polynomial. We present a refinement of this method that gives better bounds in some cases. The lower bound relies on…
Based on the realignment moments of density matrix, we study parameterized entanglement criteria for bipartite and multipartite states. By adjusting the different parameter values, our criterion can detect not only bound entangled states,…
We show that the perfect commutation graph is the sufficient tight condition for admitting the noncontextual description of each observable set satisfying it in the yes-no question scenario. With this condition, we propose a method for…
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…
We study the concurrence of arbitrary-dimensional multipartite quantum states. Analytical lower bounds of concurrence for tripartite quantum states are derived by projecting high-dimensional states to $2\otimes 2\otimes 2$ substates. The…
We provide a class of lower bounds for concurrence based on symmetric measurements. We show that our lower bounds estimate the quantum entanglement better than some existing lower bounds by detailed examples. Moreover, our lower bounds can…
Entanglement concurrence is an important bipartite entanglement measure that has found wide applications in quantum technologies. In this work, inspired by unified entropy, we introduce a two-parameter family of entanglement measures,…
This paper presents a particle-based optimization method designed for addressing minimization problems with equality constraints, particularly in cases where the loss function exhibits non-differentiability or non-convexity. The proposed…
We propose a new scheme to express the uncertainty principle in form of inequality of the bipartite correlation functions for a given multipartite state, which provides an experimentally feasible and model-independent way to verify various…
In this paper, we consider a supervised learning setting where side knowledge is provided about the labels of unlabeled examples. The side knowledge has the effect of reducing the hypothesis space, leading to tighter generalization bounds,…
We introduce a technique for applying quantum expanders in a distributed fashion, and use it to solve two basic questions: testing whether a bipartite quantum state shared by two parties is the maximally entangled state and disproving a…
The quantitative assessment of the entanglement in multipartite quantum states is, apart from its fundamental importance, a practical problem. Recently there has been significant progress in developing new methods to determine certain…
In this paper, we study the $\alpha$th power monogamy properties related to the entanglement measure in bipartite states. The monogamy relations related to the $\alpha$th power of negativity and the Convex- Roof Extended Negativity are…
We derive a simple lower bound on the geometric measure of entanglement for mixed quantum states in the case of a general multipartite system. The main ingredient of the presented derivation is the triangle inequality applied to the root…
A novel measure, quantumness of correlations is introduced here for bipartite states, by incorporating the required measurement scheme crucial in defining any such quantity. Quantumness coincides with the previously proposed measures in…
We derive monogamy relations (tradeoffs) between strengths of violations of Bell's inequalities from the non-signaling condition. Our result applies to general Bell inequalities with an arbitrary large number of partners, outcomes and…
A simple formalism for exploring quantum scattering and possible bound states in an arbitrary symmetric and localized potential in a unified way is presented. The symmetric square barrier and well potentials are used for illustrating the…
We describe new lower bounds for randomized communication complexity and query complexity which we call the partition bounds. They are expressed as the optimum value of linear programs. For communication complexity we show that the…
Entropy is a fundamental concept in quantum information theory that allows to quantify entanglement and investigate its properties, for example its monogamy over multipartite systems. Here, we derive variational formulas for relative…
Entanglement negativity is a measure of mixed-state entanglement increasingly used to investigate and characterize emerging quantum many-body phenomena, including quantum criticality and topological order. We present two results for the…