Related papers: Measurable lower bounds on concurrence

We show tight lower bounds for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation, which captures all hashing-based approaches. In…

We construct an entanglement measure that coincides with the generalized concurrence for a general pure bipartite state based on wedge product. Moreover, we construct an entanglement measure for pure multi-qubit states, which are…

We derive a general framework to identify genuinely multipartite entangled mixed quantum states in arbitrary-dimensional systems and show in exemplary cases that the constructed criteria are stronger than those previously known. Our…

Computing localizable entanglement for noisy many-particle quantum states is difficult due to the optimization over all possible sets of local projection measurements. Therefore, it is crucial to develop lower bounds, which can provide…

Numerous work had been done to quantify the entanglement of a two-qubit quantum state, but it can be seen that previous works were based on joint measurements on two copies or more than two copies of a quantum state under consideration. In…

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,…

We obtain a simplified and obvious expression of "concurrence" in Wootters' measure of entanglement of a pair of qubits having no more than two non-zero eigenvalues in terms of concurrences of eigenstates and their simple combinations. It…

For a given pure state of a composite quantum system we analyze the product of its projections onto a set of locally orthogonal separable pure states. We derive a bound for this product analogous to the entropic uncertainty relations. For…

Construction of genuinely entangled multipartite subspaces with certain characteristics has become a relevant task in various branches of quantum information. Here we show that such subspaces can be obtained from an arbitrary collection of…

We investigate upper and lower bounds on the entropy of entanglement of a superposition of bipartite states as a function of the individual states in the superposition. In particular, we extend the results in [G. Gour, arxiv.org:0704.1521…

We investigate the lower bound obtained from experimental data of a quantum state $\rho$, as proposed independently by G\"uhne et al. and Eisert et al. for mixed states of three qubits. The measure we consider is the convex-roof extended…

We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input, we use a quantum adversary that runs the algorithm with a…

We examine two conditions that can be used to detect bipartite entanglement, and show that they can be used to provide lower bounds on the negativity of states. We begin with two-qubit states, and then show how what was done there can be…

We explore procedures to detect entanglement of unknown mixed states, which can be experimentally viable. The heart of the method is a hierarchy of simple feasibility problems, which provides sufficient conditions to entanglement. Our…

We study the fully entangled fraction (FEF) of arbitrary mixed states. New upper bounds of FEF are derived. These upper bounds make complements on the estimation of the value of FEF. For weakly mixed quantum states, an upper bound is shown…

We introduce a new concept called as the mutual uncertainty between two observables in a given quantum state which enjoys similar features like the mutual information for two random variables. Further, we define the conditional uncertainty…

The geometric measure of entanglement of a pure state, defined by its distance to the set of pure separable states, is extended to multipartite mixed states. We characterize the nearest disentangled mixed state to a given mixed state with…

We present the conditions under which probabilistic error-free discrimination of mixed states is possible, and provide upper and lower bounds on the maximum probability of success for the case of two mixed states. We solve certain special…

We describe an efficient way for measuring the concurrence of the hyperentanglement. In this protocol, the hyperentangled state is encoded in both polarization and momentum degrees of freedom. We show that the concurrences of both…

With the aid of a quantum memory, the uncertainty about the measurement outcomes of two incompatible observables of a quantum system can be reduced. We investigate this measurement uncertainty bound by considering an additional quantum…