Completing bases in four dimensions

Criteria for the completion of an incomplete basis of, or context in, a four-dimensional Hilbert space by (in)decomposable vectors are given. This, in particular, has consequences for the task of ``completing'' one or more bases or contexts of a (hyper)graph: find a complete faithful orthogonal representation (aka coordinatization) of a hypergraph when only a coordinatization of the intertwining observables is known. In general indecomposability and thus physical entanglement and the encoding of relational properties by quantum states ``prevails'' and occurs more often than separability associated with well defined individual, separable states.

Coherence Trapping in Open Two-Qubit Dynamics

In this manuscript, we examine the dynamical behavior of the coherence in open quantum systems using the l1 norm. We consider a two-qubit system that evolves in the framework of Kossakowski-type quantum dynamical semigroups (KTQDSs) of completely positive maps (CPMs). We find that the quantum coherence can be asymptotically maintained with respect to the values of the system parameters. Moreover, we show that the quantum coherence can resist the effect of the environment and preserve even in the regime of long times. The obtained results also show that the initially separable states can provide a finite value of the coherence during the time evolution. Because of such properties, several states in this type of environments are good candidates for incorporating quantum information and optics (QIO) schemes. Finally, we compare the dynamical behavior of the coherence with the entire quantum correlation.

Optimal Unambiguous Discrimination And Quantum Nonlocality Without Entanglement: Locking And Unlocking By Post-Measurement Information

The phenomenon of nonlocality without entanglement(NLWE) arises in discriminating multi-party quantum separable states. Recently, it has been found that the post-measurement information about the prepared subensemble can lock or unlock NLWE in minimum-error discrimination of non-orthogonal separable states. Thus it is natrual to ask whether the availability of the post-measurement information can influence on the occurrence of NLWE even in other state-discrimination stratigies. Here, we show that the post-measurement information can be used to lock as well as unlock the occurence of NLWE in terms of optimal nambiguous discrimination. Our results can provide a useful application for hiding or sharing information based on non-orthogonal separable states.

Quantum nonlocality without entanglement depending on nonzero prior probabilities in optimal unambiguous discrimination

Nonlocality without entanglement(NLWE) is a nonlocal phenomenon that occurs in quantum state discrimination of multipartite separable states. In the discrimination of orthogonal separable states, the term NLWE is used when the quantum states cannot be discriminated perfectly by local operations and classical communication. In this case, the occurrence of NLWE is independent of nonzero prior probabilities of quantum states being prepared. Recently, it has been found that the occurrence of NLWE can depend on nonzero prior probabilities in minimum-error discrimination of nonorthogonal separable states. Here, we show that even in optimal unambiguous discrimination, the occurrence of NLWE can depend on nonzero prior probabilities. We further show that NLWE can occur regardless of nonzero prior probabilities, even if only one state can be locally discriminated without error. Our results provide new insights into classifying sets of multipartite quantum states in terms of quantum state discrimination.

The Set of Separable States has no Finite Semidefinite Representation Except in Dimension $$3\times 2$$

Given integers $$n \ge m$$ n ≥ m , let $$\text {Sep}(n,m)$$ Sep ( n , m ) be the set of separable states on the Hilbert space $$\mathbb {C}^n \otimes \mathbb {C}^m$$ C n ⊗ C m . It is well-known that for $$(n,m)=(3,2)$$ ( n , m ) = ( 3 , 2 ) the set of separable states has a simple description using semidefinite programming: it is given by the set of states that have a positive partial transpose. In this paper we show that for larger values of n and m the set $$\text {Sep}(n,m)$$ Sep ( n , m ) has no semidefinite programming description of finite size. As $$\text {Sep}(n,m)$$ Sep ( n , m ) is a semialgebraic set this provides a new counterexample to the Helton–Nie conjecture, which was recently disproved by Scheiderer in a breakthrough result. Compared to Scheiderer’s approach, our proof is elementary and relies only on basic results about semialgebraic sets and functions.

Distributing entanglement with separable states: assessment of encoding and decoding imperfections

Entanglement can be distributed using a carrier which is always separable from the rest of the systems involved. Up to now, this effect has predominantly been analyzed in the case where the carrier-system interactions take the form of ideal unitary operations, thus leaving untested its robustness against either non-unitary or unitary errors. We address this issue by considering the effect of incoherent dynamics acting alongside imperfect unitary interactions. In particular, we determine the restrictions that need to be placed on the interaction time, as well as the strength of the incoherent dynamics. We find that with non-unitary errors, we can still successfully distribute entanglement, provided we measure the carrier in a suitable basis. Introducing imperfections in the unitary dynamics, we show that entanglement gain is possible even with substantial unitary errors. Moreover, certain variations in the strength of the unitary dynamics can allow for greater robustness against non-unitary errors. Therefore, even in experimental settings where unitary operations cannot be carried out without imperfections, it is still possible to generate entanglement between two systems using a separable carrier.