Related papers: Lower bound on concurrence for arbitrary-dimension…
We present general methods for proving lower bounds on the query complexity of nonadaptive quantum algorithms. Our results are based on the adversary method of Ambainis.
We extend the definition of concurrence into a family of entanglement monotones, which we call concurrence monotones. We discuss their properties and advantages as computational manageable measures of entanglement, and show that for pure…
In this paper, an intuitive mathematical formulation is provided to generalize the residual entanglement for tripartite systems of qubits (Phys. Rev. A \textbf{61}, 052306 (2000)) to the tripartite systems in higher dimension. The spirit…
The (negative-weighted) quantum adversary bound is a tight characterisation of the quantum query complexity for any partial function. We analyse the extent to which this bound can be generalised. Ambainis et al. [arXiv:1012.2112] and Lee et…
We improve the upper bound on the minimal resources required for measurement-based quantum computation. Minimizing the resources required for this model is a key issue for experimental realization of a quantum computer based on projective…
We study intrinsic coherence in the tripartite process to unambiguously discriminate two nonorthogonal states of a qubit, entangled with another one, and assisted by an auxiliary system. The optimal success probability is found to be…
Via a multidimensional complementarity relation we derive a novel operational entanglement measure for any discrete quantum system, i.e. for any multidimensional and multipartite system. This new measure admits a separation into different…
By means of a generalization of the Fefferman-de la Llave decomposition we derive a general lower bound on the interaction energy of one-dimensional quantum systems. We apply this result to a specific class of lowest Landau band wave…
We review some current ideas about tripartite entanglement, the case representing the next level of complexity beyond the simplest one (though far from trivial), namely the bipartite. This kind of entanglement has an essential role in the…
Entanglement is one of important resources for quantum communication tasks. Most of results are focused on qubit entanglement. Our goal in this work is to characterize the multipartite high-dimensional entanglement. We firstly derive an…
Quantum discord characterizes "non-classicality" of correlations in quantum mechanics. It has been proposed as the key resource present in certain quantum communication tasks and quantum computational models without containing much…
It is an interesting problem to construct genuine tripartite entangled states based on the collective use of two bipartite entangled states. We consider the case that the states are two-qubit Werner states, we construct the interval of…
We extend the definition of quantum discord as a quantifier of nonClassical correlations in a quantum state to the case where weak measurements are performed on subsystem $A$ of a bipartite system $AB$. The properties of weak discord are…
We review concepts and methods associated with quantum discord and related topics. We also describe their possible connections with other aspects of quantum information and beyond, including quantum communication, quantum computation,…
In this work, we study the numerical optimization of nearest-neighbor concurrence of bipartite one and two dimensional lattices, as well as non bipartite two dimensional lattices. These systems are described in the framework of a…
Entanglement concurrence has been widely used for featuring entanglement in quantum experiments. As an entanglement monotone it is related to specific quantum Tsallis entropy. Our goal in this paper is to propose a new parameterized…
Quantum query complexity is known to be characterized by the so-called quantum adversary bound. While this result has been proved in the standard discrete-time model of quantum computation, it also holds for continuous-time (or…
We investigate \emph{bi-valued} auctions in the digital good setting and construct an explicit polynomial time deterministic auction. We prove an unconditional tight lower bound which holds even for random superpolynomial auctions. The…
Establishing quantum correlations between two remote parties by sending an information carrier is an essential step of many protocols in quantum information processing. We obtain trade-off relations between discords and coherence within a…
The difference of quantum mutual information for bipartite system of qubits and minimum taken with respect to local unitary transformation group is introduced as a characteristic of quantum correlations.The two qubits example (and…