Quantum state discrimination refers to the task of identifying a physical system’s quantum state through an appropriate choice of quantum measurement, one of the most elementary problems of quantum information theory. Even after being subject to decades of active theoretical investigation, there still remain many open problems and unexplored areas within the field. My thesis looks into a recently identified problem structure called local simultaneous state discrimination (LSSD). I closely examine the behavior of LSSD within the fundamental scenario of two parties discriminating between two pure qubit states. Under these restrictions, I show that LSSD represents a new type of nonlocality without entanglement. When each party receives the same state, I identify the condition under which nonlocality begins, and I demonstrate a viable quantum circuit designed to perform the optimal quantum measurement. When each party receives different states, I provide an example to demonstrate some properties of the nonlocal regime.
Quantum state discrimination refers to the task of identifying a physical system’s quantum state through an appropriate choice of quantum measurement, one of the most elementary problems of quantum information theory. Even after being subject to decades of active theoretical investigation, there still remain many open problems and unexplored areas within the field. My thesis looks into a recently identified problem structure called local simultaneous state discrimination (LSSD). I closely examine the behavior of LSSD within the fundamental scenario of two parties discriminating between two pure qubit states. Under these restrictions, I show that LSSD represents a new type of nonlocality without entanglement. When each party receives the same state, I identify the condition under which nonlocality begins, and I demonstrate a viable quantum circuit designed to perform the optimal quantum measurement. When each party receives different states, I provide an example to demonstrate some properties of the nonlocal regime.
Quantum state discrimination is one of the most fundamental problems in quantum information theory, with applications ranging from channel coding to metrology and cryptography. In this work, we introduce a variant of this task: local simultaneous state discrimination (LSSD). While previously studied distributed variants of state discrimination allowed some communication between the parties to come up with a joint answer, in LSSD they cannot communicate and have to simultaneously answer correctly. We illustrate by multiple examples that this problem significantly differs from single-party state discrimination, even when the states are completely classical. We show that an additional entangled resource can increase the optimal success probability in LSSD, and stronger-than-quantum no-signaling resources can allow for an even higher success probability. We also show that finding the optimal strategy in (classical) three-party LSSD is NP-hard. Furthermore, we provide an example of symmetric LSSD for which the optimal strategy is not symmetric, and prove a sufficient condition for the existence of an optimal symmetric strategy. While interesting in its own right, the LSSD problem also arises in quantum cryptography. In particular, we explore the connections between the problem of unclonable encryption and LSSD. We give an explicit cloning-indistinguishable attack that succeeds with probability $1/2+\ensuremath{\mu}/16$ where $\ensuremath{\mu}$ is related to the largest eigenvalue of the resulting quantum ciphertext states.
Quantum state discrimination is a fundamental information processing task that serves as a key component in many applications while also carrying foundational significance. In this work, we consider minimum error discrimination of multi-copy states, where instead of preparing a single system we assume that multiple instances of the same state are prepared. Now the discrimination allows for measurements from multiple parties with different measurement strategies varying from global measurement strategy to ones restricted to different forms of local operations and classical communication strategies. By comparing the average success probabilities in quantum and classical cases, we find a qubit strategy that outperforms all the bit strategies. On the other hand, we show that the classical measurement strategy does not give benefit in qubit over bit. However, we find that there are other (qu)bit-like operational theories which can outperform the best qubit strategies even with a classical measurement strategy and we are able to identify instances of different theories where different measurement strategies are optimal. In this way, we are able to find instances of nonlocality without entanglement as well as provide general bounds for bit-like operational theories.
Local simultaneous state discrimination (LSSD) is a recently introduced problem in quantum information processing. Its classical version is a non-local game played by non-communicating players against a referee. Based on a known probability distribution, the referee generates one input for each of the players and keeps one secret value. The players have to guess the referee's value and win if they all do so. For this game, we investigate the advantage of no-signalling strategies over classical ones. We show numerically that for three players and binary values, no-signalling strategies cannot provide any improvement over classical ones. For a certain LSSD game based on a binary symmetric channel, we show that no-signalling strategies are strictly better when multiple simultaneous instances of the game are played. Good classical strategies for this game can be defined by codes, and good no-signalling strategies by list-decoding schemes. We expand this example game to a class of games defined by an arbitrary channel, and extend the idea of using codes and list decoding to define strategies for multiple simultaneous instances of these games. Finally, we give an expression for the limit of the exponent of the classical winning probability, and show that no-signalling strategies based on list-decoding schemes achieve this limit.
Quantum state discrimination involves identifying a given state out of a set of possible states. When the states are mutually orthogonal, perfect state discrimination is always possible using a global measurement. In the case of multipartite systems when the parties are constrained to use multiple rounds of local operations and classical communication (LOCC), perfect state discrimination is often impossible even with the use of asymptotic LOCC, wherein an error is allowed but must vanish in the limit of an infinite number of rounds. Utilizing our recent results on asymptotic LOCC, we derive a lower bound on the error probability for LOCC discrimination of any given set of mutually orthogonal pure states. Informed by the insights gained from this lower bound, we are able to prove necessary conditions for perfect state discrimination by asymptotic LOCC. We then illustrate by example the power of these necessary conditions in significantly simplifying the determination of whether perfect discrimination of a given set of states can be accomplished arbitrarily closely using LOCC. The latter examples include a proof that perfect discrimination by asymptotic LOCC is impossible for any minimal unextendible product basis (UPB), where minimal means that for the given multipartite system no UPB with a smaller number of states can exist. We also give a simple proof that what has been called strong nonlocality without entanglement is considerably stronger than had previously been demonstrated.
Abstract Quantum nonlocality without entanglement is a fantastic phenomenon in quantum theory. This kind of quantum nonlocality is based on the task of local discrimination of quantum states. Recently, Bandyopadhyay and Halder (2021 Phys. Rev. A 104 L050201) studied the problem: is there any set of orthogonal states which can be locally distinguishable, but under some orthogonality preserving local measurement, each outcome will lead to a locally indistinguishable set. The set with such property is called to have hidden nonlocality. Moreover, if such phenomenon can not arise from discarding subsystems which is termed as local irredundancy, we call it genuine hidden nonlocality. There, they presented several sets of entangled states with genuine hidden nonlocality. However, they doubted the existence of a set without entanglement but with genuine hidden nonlocality. In this paper, we eliminate this doubt by constructing a series of sets without entanglement but whose nonlocality can be genuinely activated. We derive a method to tackle with the local irredundancy problem which is a key tricky for the systems whose local dimensions are composite numbers. Unexpectedly, the constructions of genuine hidden nonlocal sets without entanglement seems to be easier than that with entanglement. Therefore, from this perspective, this kind of nonlocality is rather different from the Bell nonlocality.
In this paper, we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the perfect distinguishability problem of two-qubit ensembles-both for separable operations and LOCC-by providing necessary and sufficient conditions for the perfect discrimination of one pure and one mixed state. Then, for the well-known task of minimum error discrimination, it is shown that almost all two-qubit ensembles consisting of three pure states cannot be optimally discriminated using LOCC. This is surprising considering that any two pure states can be distinguished optimally by LOCC. Special attention is given to ensembles that lack entanglement, and we prove an easy sufficient condition for when a set of three product states cannot be optimally distinguished by LOCC, thus providing new examples of the phenomenon known as non-locality without entanglement. We next consider an example of N parties who each share the same state but who are ignorant of its identity. The state is drawn from the rotationally invariant trine ensemble, and we establish a tight connection between the N-copy ensemble and Shor's lifted single-copy ensemble. For any finite N, we prove that optimal identification of the states cannot be achieved by LOCC; however, as N→∞, LOCC can indeed discriminate the states optimally. This is the first result of its kind. Finally, we turn to the task of unambiguous discrimination and derive new lower bounds on the LOCC inconclusive probability for symmetric states. When applied to the double trine ensemble, this leads to a rather different distinguishability character than when the minimum error probability is considered.