Entanglement is not an intrinsic property of a quantum state: it depends on how the total system is factorized into subsystems via a tensor product structure. Just as a coherent quantum state can be made to appear classical by representing it in its eigenbasis, an entangled state can always be made to appear separable in a suitably chosen factorization. However, the same is not true for a set of states. It is not always possible to make a set of states simultaneously separable in a common factorization. Following recent work that defined a basis-independent notion of classicality for sets of states, we propose an extension of this idea to sets of bipartite states. This leads us to a factorization-independent notion of separability we call simulation separability. This notion is weaker than previously studied forms of separability for sets of states. It can be physically understood via an operational interpretation based on unitary gates and state-preparation devices that emit separable states. By showing that the set of all simulation-separable sets is convex, we are able to derive necessary and sufficient conditions for simulation separability. We also propose an experimentally implementable method for detecting sets that are not simulation separable. Finally, finite sets of two-qubit states are investigated numerically with respect to simulation separability.
Entanglement is not an intrinsic property of a quantum state: it depends on how the total system is factorized into subsystems via a tensor product structure. Just as a coherent quantum state can be made to appear classical by representing it in its eigenbasis, an entangled state can always be made to appear separable in a suitably chosen factorization. However, the same is not true for a set of states. It is not always possible to make a set of states simultaneously separable in a common factorization. Following recent work that defined a basis-independent notion of classicality for sets of states, we propose an extension of this idea to sets of bipartite states. This leads us to a factorization-independent notion of separability we call simulation separability. This notion is weaker than previously studied forms of separability for sets of states. It can be physically understood via an operational interpretation based on unitary gates and state-preparation devices that emit separable states. By showing that the set of all simulation-separable sets is convex, we are able to derive necessary and sufficient conditions for simulation separability. We also propose an experimentally implementable method for detecting sets that are not simulation separable. Finally, finite sets of two-qubit states are investigated numerically with respect to simulation separability.
Abstract The investigation of separable states in quantum theory has been driven by the notion that they are highly classical, in that they do not demonstrate nonlocality, and are in some contexts unable to support non-classical computation. The converse question, the extent to which entangled states do or do not support non-classical information processing, is less well understood. Motivated by this question we extend the notion of quantum separability into the entangled quantum states, by constructing separable decompositions that describe them with the ‘smallest’ possible sets of non-physical local operators. We consider a few ways to define the word ‘smallest’ and present techniques for obtaining them. The methods involve calculating certain forms of cross norm. The results generalise significantly the results obtained in our previous work on this topic (2015 New J. Phys. 17 093047), and can be be used to construct classical simulation methods and local hidden variable models for subsets of local measurements on entangled quantum states.
The notion of entanglement of quantum states is usually defined with respect to a fixed bipartition. Indeed, a global basis change can always map an entangled state to a separable one. The situation is, however, different when considering a set of states. In this work we define the notion of an ``absolutely entangled set'' of quantum states: for any possible choice of global basis, at least one of the states in the set is entangled. Hence, for all bipartitions, i.e., any possible definition of the subsystems, the set features entanglement. We present examples of such sets, including sets with minimal size. Moreover, we propose a quantitative measure for absolute set entanglement. To lower bound this quantity, we develop a method based on polynomial optimization to perform convex optimization over unitaries, which is of independent interest.
A bipartite state is called classical (with regard to correlations) if it is left undisturbed by a certain local von Neumann measurement, and is called separable if it can be represented as a convex combination of product states. Due to the perfect distinguishability of orthogonal vectors, a classical state can essentially be identified with a convenient bivariate probability distribution, and moreover, it is separable, but not vice versa. The notion of separability plays a key role in quantum information theory because entanglement is defined via separability. However, the definition of separability is ad hoc and formal. In this paper, we present an intrinsic characterization of separable states via classical states from the measurement perspective: Separable states are precisely those states that are reductions of classical states in higher dimensions with the natural partitions. Consequently, entangled states are precisely those states that cannot be represented as such reductions of classical states. This observation highlights the hidden mutually exclusive and complementary relations between classicality and entanglement.
Quantum computing operates in three stages: (i) preparation of the initial states of the n qubits of a register, (ii) step by step transformation of the state of this register by unitary operators which compose the quantum program, and (iii), measurement of all or some of the qubits of the register. The existence of quantum algorithms which are exponentially less complex than their classical counterparts for some classes of problems, stems from entangled states established by multi-qubit unitary operators within the quantum program. A register of n qubits is a quantum system composed of n quantum subsystems. The state |/spl psi/> of a quantum system composed of two quantum subsystems A and B is said to be entangled when |/spl psi/> is not reducible to a pair composed of a state |/spl psi/> of A and a state |/spl psi//sub B/> of B: such situations have no counterpart in the classical world. In quantum theory, such a pair of states is denoted by a tensor product: |/spl psi/> is entangled if it cannot be factorized into the tensor product |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/>. This paper establishes conditions according to which it is possible to tell whether or not the state of a register of n qubits is entangled. The state of a single qubit is a vector /spl alpha/|0>+/spl beta/|1> of unit norm in a 2-dimensional vector space, where |0> and |1> are the two basis states and where a and are complex amplitudes. Then, if both A and B are qubits, the most general form of the state of a register composed of the 2 qubits A and B is also a vector of unit norm, but now in a 4-dimensional space: |/spl psi/>=/spl alpha/|00>+/spl beta/|01+/spl gamma/|10>+/spl sigma/|11>. It is straightforward to prove that |/spl psi/> can be factorized into |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/> if and only if /spl alpha//spl delta/=/spl beta//spl gamma/. In such a case, |/spl psi/> is said to be separable, i.e. not entangled. This paper generalizes this form of condition to registers of n qubits. If |/spl psi/> is the state of a register of n qubits, two different questions about the separability of |/spl psi/> are answered: (i) is |/spl psi/> separable into a product |/spl psi//sub 1/>/spl ominus/|/spl psi//sub 2/>/spl ominus/L/spl ominus/|/spl psi//sub n/> of n single qubit states? and (ii), is |/spl psi/> separable into a product |/spl psi//sub A/>/spl ominus/|/spl psi//sub B/> of the states of two subregisters A and B, respectively containing p and q adjacent qubits with p+q=n? For both questions, necessary and sufficient conditions are given.
In this paper, we study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be distinguishable by separable operations. An analytical version of this condition is derived for the case of(D-1) pure states, whereDis the total dimension of the state space under consideration. A number of interesting consequences of this result are then carefully investigated. Remarkably, we show there exists a large class of 2 otimes 2 separable operations not being realizable by local operations and classical communication. Before our work, only a class of 3 otimes 3 nonlocal separable operations was known [Bennett , Phys. Rev. A 59, 1070 (1999)]. We also show that any basis of the orthogonal complement of a multipartite pure state is indistinguishable by separable operations if and only if this state cannot be a superposition of one or two orthogonal product states, i.e., has an orthogonal Schmidt number not less than three, thus generalize the recent work about indistinguishable bipartite subspaces [Watrous, Phys. Rev. Lett. 95, 080505 (2005)]. Notably, we obtain an explicit construction of indistinguishable subspaces of dimension 7 (or 6) by considering a composite quantum system consisting of two qutrits (resp., three qubits), which is slightly better than the previously known indistinguishable bipartite subspace with dimension 8.
Measurement compatibility asks whether a family of quantum measurements can be simulated by one parent measurement followed by classical post-processing. We extend this measurement compatibility to the notion of \emph{d-compatibility} for measurements, channels, and instruments whose parent passes a d-dimensional quantum system and unlimited classical information to the post-processing. We formulate d-compatibility as a common linear factorization of operator spaces and operator systems and show that d-compatible families form a closed set, even with infinitely many settings and a separable infinite-dimensional input. To certify d-incompatibility, we define the compatibility functional as the smallest product of completely bounded norms over common factorizations through a d-dimensional register. Using factorization theory of operator spaces, we show that measure-and-prepare channels defined in terms of mutually unbiased bases and pinching channels defined in terms of Heisenberg-Weyl operators are d-incompatible in certain regimes of d. We also link d-compatibility of multi-instruments to the preparability of Choi assemblages using channel-state duality, and use this connection to show that for bipartite states the (in)compatibility of instruments can be used to certify Schmidt numbers and the implementability of the instrument using one-way LOCC protocols. Finally, our compatibility functional also bounds the generalized robustness of compatibility, which we interpret through a memory-bounded nontransient preparation game.