Related papers: Projection based lower bounds of concurrence for m…
Quantification of coherence lies at the heart of quantum information processing and fundamental physics. Exact evaluation of coherence measures generally needs a full reconstruction of the density matrix, which becomes intractable for…
We study the fully entangled fraction of a quantum state. An upper bound is obtained for arbitrary bipartite system. This upper bound only depends on the Frobenius norm of the state.
It is shown that generic N-party pure quantum states (with equidimensional subsystems) are uniquely determined by their reduced states of just over half the parties; in other words, all the information in almost all N-party pure states is…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
Local distinguishability of orthogonal product states is an area of active research in quantum information theory. However, most of the relevant results about local distinguishability found in bipartite quantum systems and very few are…
We prove a tight and close-to-optimal lower bound on the effectiveness of local quantum measurements (without classical communication) at discriminating any two bipartite quantum states. Our result implies, for example, that any two…
We provide analytical lower and upper bounds for entanglement of formation for bipartite systems, which give a direct relation between the bounds of entanglement of formation and concurrence, and improve the previous results. Detailed…
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…
Detection of entanglement in bipartite states is a fundamental task in quantum information. The first method to verify entanglement in mixed states was the partial-transpose criterion. Subsequently, numerous quantifiers for bipartite…
We present an extension of the Wootters concurrence for the case of two qutrits in mixed states. The reduction of our extension to the case of two levels shows complete agreement with Wootters concurrence for two qubits. As an explicit…
Interaction with environment may lead to the transition of quantum system from pure state to the mixed one. In this case, the problem of definition of entanglement may arise. In particular, quantitative measure of entanglement concurrence…
By quantifying the difference between quantum mutual information through weak measurement performed on a subsystem one is led to the notion of super quantum discord. The super version is also known to be difficult to compute as the quantum…
We propose an entanglement tensor to compute the entanglement of a general pure multipartite quantum state. We compare the ensuing tensor with the concurrence for bipartite state and apply the tensor measure to some interesting examples of…
Multipartite quantum states that cannot be uniquely determined by their reduced states of all proper subsets of the parties exhibit some inherit `high-order' correlation. This paper elaborates this issue by giving necessary and sufficient…
Combinatorial optimization is considered a promising class of problems in which quantum computers can show significant advantages. However, problems of practical relevance typically have more variables than current or foreseeable quantum…
Finding ways to test the behaviour of quantum devices is a timely enterprise, especially in the light of the rapid development of quantum technologies. Device-independent self-testing is one desirable approach, as it makes minimal…
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…
We consider random bipartite quantum states obtained by tracing out one subsystem from a random, uniformly distributed, tripartite pure quantum state. We compute thresholds for the dimension of the system being traced out, so that the…
We refine the notion of concurrence in this paper by a redefinition of the concept. The new definition is simpler, computationally straight forward, and allows the concurrence to be directly read off from the state. It has all the positive…
In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or simplify learning parameters in machine learning…