Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2111.01209 · Physical Review A

Local simultaneous state discrimination

Christian Majenz, Māris Ozols, Christian Schaffner, Mehrdad Tahmasbi

Published May 14, 2024• 5 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.109.052217

Related papers

LOCAL SIMULTANEOUS STATE DISCRIMINATION WITH PURE STATES

JASON PAN

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.

•May 1, 2022•0 citations

Nonclassical traits in multi-copy state discrimination

Tim Achenbach, Leevi Leppäjärvi, Hanwool Lee +1 more

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.

quant-pharXiv:2604.26647•Apr 30, 2026•0 citations

Parallel repetition of local simultaneous state discrimination

Llorenç Escolà-Farràs, Jaròn Has, Māris Ozols +2 more

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.

arXiv:2211.06456•Quantum•Apr 15, 2025•2 citations

Robustness of quantum data hiding against entangled catalysts and memory

Aby Philip, Alexander Streltsov

Quantum data hiding stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate whether this limitation can be overcome when the communicating parties are assisted by additional quantum resources. We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols and analyze their power to reveal hidden information. We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability, establishing the robustness of separable data-hiding schemes. In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly. Our results delineate the fundamental limits of catalytic and memory-assisted state discrimination and identify separable encodings as a robust strategy for quantum data hiding.

quant-pharXiv:2511.04408•Nov 7, 2025•4 citations

When Do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?

Eric Chitambar, Runyao Duan, Min-Hsiu Hsieh

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.

arXiv:1308.1737•IEEE Transactions on Information Theory•Jan 31, 2014•51 citations

Discrimination of three symmetric states

Lan-Lan Li, Wen‐Hai Zhang, Ke Zhang +1 more

The quantum state discrimination problem is ubiquitous in quantum information and serves as the foundation for many quantum communication schemes proposed so far. This paper investigates the optimal discrimination of three symmetric quantum states with equal prior probabilities. To obtain completely accessible information about the input pure states, this strategy makes improvements to the two standard strategies of quantum state discrimination, namely the minimum error discrimination and unambiguous discrimination. The new discrimination strategy proposed in this paper can be applied to both linearly independent and dependent quantum states.

AIP Advances•Jan 1, 2025•0 citations
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μ/161/2+\ensuremath{\mu}/161/2+\ensuremathμ/16 where \ensuremathμ\ensuremath{\mu}\ensuremathμ is related to the largest eigenvalue of the resulting quantum ciphertext states.
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 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 data hiding stores classical information in bipartite quantum states that are, in principle, perfectly distinguishable, yet remain almost indistinguishable without access to a quantum communication channel. Here, we investigate whether this limitation can be overcome when the communicating parties are assisted by additional quantum resources. We develop a general framework for state discrimination that unifies catalytic and memory-assisted local discrimination protocols and analyze their power to reveal hidden information. We prove that when the hiding states are separable, neither entangled catalysts nor quantum memory can increase the optimal discrimination probability, establishing the robustness of separable data-hiding schemes. In contrast, for some entangled states, a reusable quantum memory turns locally indistinguishable states into ones that can be discriminated almost perfectly. Our results delineate the fundamental limits of catalytic and memory-assisted state discrimination and identify separable encodings as a robust strategy for quantum data hiding.
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.
The quantum state discrimination problem is ubiquitous in quantum information and serves as the foundation for many quantum communication schemes proposed so far. This paper investigates the optimal discrimination of three symmetric quantum states with equal prior probabilities. To obtain completely accessible information about the input pure states, this strategy makes improvements to the two standard strategies of quantum state discrimination, namely the minimum error discrimination and unambiguous discrimination. The new discrimination strategy proposed in this paper can be applied to both linearly independent and dependent quantum states.