In this article we extend results from our previous work [Bendersky et al., Phys. Rev. Lett. 116, 230402 (2016)] by providing a protocol to distinguish in finite time and with arbitrarily high success probability any algorithmic mixture of pure states from the maximally mixed state. Moreover, we include an experimental realization, using a modified quantum key distribution setup, where two different random sequences of pure states are prepared; these sequences are indistinguishable according to quantum mechanics, but they become distinguishable when randomness is replaced with pseudorandomness within the experimental preparation process.
In this article we extend results from our previous work [Bendersky et al., Phys. Rev. Lett. 116, 230402 (2016)] by providing a protocol to distinguish in finite time and with arbitrarily high success probability any algorithmic mixture of pure states from the maximally mixed state. Moreover, we include an experimental realization, using a modified quantum key distribution setup, where two different random sequences of pure states are prepared; these sequences are indistinguishable according to quantum mechanics, but they become distinguishable when randomness is replaced with pseudorandomness within the experimental preparation process.
We show that several classes of mixed quantum states in finite-dimensional Hilbert spaces which can be characterized as being, in some respect, ``most classical'' can be described and analyzed in a unified way. Among the states we consider are separable states of distinguishable particles, uncorrelated states of indistinguishable fermions and bosons, as well as mixed spin states decomposable into probabilistic mixtures of pure coherent states. The latter was the subject of the recent paper by Giraud et al. [Phys. Rev. A 78, 042112 (2008)], who showed that in the lowest-dimensional nontrivial case of spin 1, each such state can be decomposed into a mixture of eight pure states. Using our method, we prove that in fact four pure states always suffice.
Recently, sequential state discrimination, as a quantum-key distribution protocol, has been proposed for multiple receivers. A previous study [J. A. Bergou et al., Phys. Rev. Lett. 111, 100501 (2013)] showed that every receiver could successfully perform a sequential state discrimination of two pure states with identical prior probabilities. In this study, we extend the sequential state discrimination to mixed states with arbitrary prior probability. First, we analytically obtain the condition of the receiver's optimal measurement. In addition, we show that the optimal probability for every receiver to share the mixed state prepared by the sender is not zero. Furthermore, we compare the sequential state discrimination to the strategies of quantum reproducing and quantum broadcasting. We find that there are cases in which, unlike that of the pure state, the sequential state discrimination of mixed states shows a better performance than the other strategies.
So far, certifying quantum devices from their input-output statistics, under minimal assumptions, required the preparation of specific pure quantum states. Recently, Xu et al. [Phys. Rev. Lett. 132, 140201 (2024)] have demonstrated that certain sets of quantum observables can be certified using any state of full rank. However, their method is restricted to ideal conditions. Here, we address this problem and present an experimentally robust method that eliminates the need of preparing states with high fidelity with respect to specific pure states. We demonstrate the feasibility of the method by experimentally certifying photonic devices implementing Peres' set of 24 ququart observables [J. Phys. A 24, L175 (1991)] and Yu and Oh's set of 13 qutrit observables [Phys. Rev. Lett. 108, 030402 (2012)], using maximally mixed states as input. This approach offers a crucial advantage for certifying high-dimensional quantum systems, since it works with maximally mixed and thermal states.
Many experimental setups in quantum physics use pseudorandomness in places where the theory requires randomness. In this Letter we show that the use of pseudorandomness instead of proper randomness in quantum setups has potentially observable consequences. First, we present a new loophole for Bell-like experiments: if some of the parties choose their measurements pseudorandomly, then the computational resources of the local model have to be limited in order to have a proper observation of nonlocality. Second, we show that no amount of pseudorandomness is enough to produce a mixed state by computably choosing pure states from some basis.
Classical mixtures of quantum states often give rise to decoherence and are generally considered detrimental to quantum processing. However, in the framework of sequential measurement, such mixtures can be beneficial for state discrimination. We investigate the sequential discrimination of mixed states and compare the results with those of pure states under the condition of equal fidelity. It is found that the successful probability of the mixed-state protocol is superior to the pure one under the equal-fidelity condition. It is shown that the difference between the sequential discrimination of pure and mixed states is more reliable under the equal-fidelity condition than under single-shot discrimination, and this difference increases with the mixability of the initial mixed states. For scenarios in which classical communication is allowed, the optimal successful probability of pure-state discriminations is larger than that for mixed states on the contrary. We also show that the classical mixture of basic vectors from quantum decoherence has a subtle impact on the communication channel induced by the coincidence of the maximal mutual information and optimal successful probability of sequential discrimination for pure states.
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.