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:2307.11271 · New Journal of Physics

Derivation of standard quantum theory via state discrimination

Hayato Arai, Masahito Hayashi

Published May 1, 2024• 5 citations
arXivHTMLPDF

Abstract

Abstract It is a key issue to characterize the model of standard quantum theory out of general models by an operational condition. The framework of general probabilistic theories (GPTs) is a new information theoretical approach to single out standard quantum theory. It is known that traditional properties, for example, Bell-CHSH inequality, are not sufficient to single out standard quantum theory among possible models in GPTs. As a more precise property, we focus on the bound of the performance for an information task called state discrimination in general models. We give an equivalent condition for outperforming the minimum discrimination error probability under the standard quantum theory given by the trace norm. Besides, by applying the equivalent condition, we characterize standard quantum theory out of general models in GPTs by the bound of the performance for state discrimination.

DOI
10.1088/1367-2630/ad4d18

Related papers

Structure of Optimal State Discrimination in Generalized Probabilistic Theories

Joonwoo Bae, Dai-Gyoung Kim, L. C. Kwek

We consider optimal state discrimination in a general convex operational framework, so-called generalized probabilistic theories (GPTs), and present a general method of optimal discrimination by applying the complementarity problem from convex optimization. The method exploits the convex geometry of states but not other detailed conditions or relations of states and effects. We also show that properties in optimal quantum state discrimination are shared in GPTs in general: (i) no measurement sometimes gives optimal discrimination, and (ii) optimal measurement is not unique.

arXiv:1707.02521•Entropy•Jan 26, 2016•23 citations

Classical, quantum, and general probabilistic state-discrimination profiles

Mihály Weiner

For a collection of states indexed by $[n]={1,\ldots,n}$, let $F(H)$ denote the optimal unnormalized minimum discrimination error for each nonempty subfamily $H\subseteq[n]$. We call $F$ the discrimination profile and characterize exactly which profiles can arise in a general probabilistic theory (GPT). For fixed $n$, the GPT region $\mathfrak{G}_n$ is a bounded rational polytope, giving a hierarchy $\mathfrak{C}_n\subseteq\mathfrak{Q}_n\subseteq\mathfrak{G}_n$ of classical, quantum, and GPT profiles, analogous to the local--quantum--no-signalling hierarchy in Bell theory. For $n=3$ we determine the classical and GPT polytopes explicitly. Within $\mathfrak{G}_3$, the classical region is characterized by $β:=F(123)-F(12)-F(13)-F(23)\le0$, while the GPT maximum is $1$. For qubit triples, the maximal value is attained by the trine, $β_{\mathrm{tr}}=3\sqrt3/2-2$, and we prove the dimension-independent quantum bound $β_{\mathrm Q}\le2/3$, with a slight further improvement. Hence $0=β_{\mathrm C}<3\sqrt3/2-2\leβ_{\mathrm Q}\le2/3<1=β_{\mathrm{GPT}}$. We conjecture $β_{\mathrm Q}=β_{\mathrm{tr}}$ and prove this for arbitrary pure-state triples, together with further supporting evidence. For arbitrary $n$, every classical facet admitting a GPT violation already admits a quantum violation in dimension at most $3$. A four-state qubit example shows that quantum success profiles need not be submodular, unlike for $n=3$. Finally, we exhibit a four-dimensional quantum triple whose discrete profile is classical for all subfamilies but becomes nonclassical when unequal priors are allowed.

quant-pharXiv:2609.17920•Sep 17, 2026•0 citations

Optimal observables for minimum-error state discrimination in general probabilistic theories

Koji Nuida, Gen Kimura, Takayuki Miyadera

General probabilistic theories provide the most general mathematical framework for the theory of probability in an operationally natural manner and generalize classical and quantum theories. In this article, we study state discrimination problems in general probabilistic theories using a Bayesian strategy. After reformulation of the theories with mathematical rigor, we first prove that an optimal observable to discriminate any (finite) number of states always exists in the most general setting. Next, we revisit our recently proposed geometric approach for the problem and show that for two-state discrimination, this approach is indeed effective in arbitrary dimensional cases. Moreover, our method reveals an operational meaning of Gudder’s “intrinsic metric” by means of the optimal success probability, which turns out to be a generalization of the trace distance for quantum systems. As its by-product, an information disturbance theorem in general probabilistic theories is derived, generalizing its well known quantum version.

arXiv:0906.5419•Journal of Mathematical Physics•Sep 1, 2010•14 citations

Contextual advantage implies limited distinguishability in any physical theory

Roberto D. Baldijão, Felipe A. Barretto, Jarosław K. Korbicz

A central question in quantum information is whether a given set of states can provide an advantage in some information-processing task. We establish a universal connection between two such questions: how well a set of states can be discriminated, and whether it can power tasks whose advantage stems from generalized contextuality. Working in the framework of generalized probabilistic theories (GPTs), which includes quantum and classical systems as special cases, we show that any set of states able to provide a nonclassical advantage in a contextuality-powered task must obey nontrivial upper bounds on the success probability of every state discrimination task using the full set. Contextual advantage therefore implies limited distinguishability, exposing a trade-off between two basic operational resources. Importantly, this is more than a statement about the idealized limit: perfect distinguishability is not needed to preclude contextuality. Our thresholds lie strictly below unity, so any set whose discrimination performance exceeds them while still imperfectly distinguishable is already guaranteed to admit a noncontextual explanation. The bounds follow from a simple geometric property, linear dependence of the state set, take a closed analytical form, and depend only on the prior of the task and the convex geometry of the states. As an illustration, we apply them to generalized parity-oblivious multiplexing, where sufficiently high success in the task implies that at least one sub-ensemble of the codebook cannot power any contextual advantage.

quant-pharXiv:2607.26145•Jul 30, 2026•0 citations

Structure of minimum-error quantum state discrimination

Joonwoo Bae

Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.

arXiv:1210.2845•New Journal of Physics•Jul 18, 2013•89 citations

Nicht-Lokalität und Verschränkung in verallgemeinerten Wahrscheinlichkeitstheorien

Janotta, Peter

Quantum theory is considered to be the most fundamental and most accurate physical theory of today. Although quantum theory is conceptually difficult to understand, its mathematical structure is quite simple. What determines this particularly simple and elegant mathematical structure? In short: Why is quantum theory as it is? Addressing such questions is the aim of investigating the foundations of quantum theory. In the past this field of research was sometimes considered as an academic subject without much practical impact. However, with the emergence of quantum information theory this perception has changed significantly and both fields started to fruitfully influence each other. Today fundamental aspects of quantum theory attract increasing attention and the field belongs to the most exciting subjects of theoretical physics. This thesis is concerned with a particular branch in this field, namely, with so-called Generalized Probabilistic Theories (GPTs), which provide a unified theoretical framework in which classical and quantum theory emerge as special cases. This is used to examine nonlocal features that help to distinguish quantum theory from alternative toy theories. In order to extend the scope of theories that can be examined with the framework, we also introduce several generalizations to the framework itself. We start in Chapter 1 with introducing the standard GPT framework and summarize previous results, based on a review paper of the author [New J. Phys. 13, 063024 (2011)]. To keep the introduction accessible to a broad readership, we follow a constructive approach. Starting from few basic physically motivated assumptions we show how a given set of observations can be manifested in an operational theory. Furthermore, we characterize consistency conditions limiting the range of possible extensions. We point out that non-classical features of single systems can equivalently result from higher dimensional classical theories that have been restricted. Entanglement and non-locality, however, are shown to be genuine non-classical features. We review features that have been found to be specific for quantum theory separably or single and joint systems. Chapter 2 incorporates results published in [J. Phys. A 47(32), pp. 1-32 (2014)] and [Proc. QPL 2011 via EPTCS vol. 95, pp. 183–192 (2012)]. The GPT framework is applied to show how the structure of local state spaces indirectly affects possible nonlocal correlations, which are global properties of a theory. These correlations are stronger than those possible in a classical theory, but happen to show different restrictions that can be linked to the structure of subsystems. We first illustrate the phenomenon with toy theories with particular local state spaces. We than show that a particular class of joint states (inner product states), whose existence depends on geometrical properties of the local subsystems, can only have correlations for a known limited set called Q1. All bipartite correlations of both, quantum and classical correlations, can be mapped to measurement statistics from such joint states. Chapter 3 shows unpublished results on entanglement swapping in GPTs. This protocol, which is well known in quantum information theory, allows to nonlocally transfer entanglement to initially unentangled parties with the help of a third party that shares entanglement with each. We review our approach published in [Proc. QPL 2011 via EPTCS vol. 95, pp. 183–192 (2012)], which mimics the joint systems' structure of quantum theory by modifying a popular toy theory known as boxworld. However, it is illustrated that this approach fails for bigger multipartite systems due to inconsistencies evoked by entanglement swapping. It turns out that the GPT framework does not allow entanglement swapping for general subsystems with two-dimensional state spaces with transitive pure states. Altering the GPT framework to allow completely globally degrees of freedom, however, enables us to construct consistent entanglement swapping for these subsystems. This construction resembles the situation in quantum theory on a real Hilbert space. A questionable assumption usually taken in the standard GPT framework is the so-called no-restriction hypothesis. It states that the measurement that are possible in a theory can be derived from the state space. In fact, this assumption seems to exist for reasons of mathematical convenience, but it seems to lack physical motivation. We generalize the GPT framework to also account for systems that do not obey the no-restriction hypothesis in Chapter 4, which presents results published in [Phys. Rev. A 87, 052131 (2013)] and [Proc. QPL 2013, to be published in EPTCS]. The extended framework includes new classes of probabilistic theories. As an example, we show how to construct theories that include intrinsic noise. We also provide a "self-dualization" procedure that requires the violation of the no-restriction hypothesis. This procedure restricts the measurement of arbitrary theories such that the theories act as if they were self-dual. Self-duality has recently gathered lots of interest, since such theories share many features of quantum theory. For example Tsirelson’s bound holds for correlations on the maximally entangled state in these theories. Finally, we characterize the maximal set of joint states that can be consistently defined for given subsystems. This generalizes the maximal tensor product of the standard GPT framework.

•Jan 1, 2014•0 citations
Abstract It is a key issue to characterize the model of standard quantum theory out of general models by an operational condition. The framework of general probabilistic theories (GPTs) is a new information theoretical approach to single out standard quantum theory. It is known that traditional properties, for example, Bell-CHSH inequality, are not sufficient to single out standard quantum theory among possible models in GPTs. As a more precise property, we focus on the bound of the performance for an information task called state discrimination in general models. We give an equivalent condition for outperforming the minimum discrimination error probability under the standard quantum theory given by the trace norm. Besides, by applying the equivalent condition, we characterize standard quantum theory out of general models in GPTs by the bound of the performance for state discrimination.
We consider optimal state discrimination in a general convex operational framework, so-called generalized probabilistic theories (GPTs), and present a general method of optimal discrimination by applying the complementarity problem from convex optimization. The method exploits the convex geometry of states but not other detailed conditions or relations of states and effects. We also show that properties in optimal quantum state discrimination are shared in GPTs in general: (i) no measurement sometimes gives optimal discrimination, and (ii) optimal measurement is not unique.
For a collection of states indexed by [n]=1,…,n[n]={1,\ldots,n}[n]=1,…,n, let F(H)F(H)F(H) denote the optimal unnormalized minimum discrimination error for each nonempty subfamily H⊆[n]H\subseteq[n]H⊆[n]. We call FFF the discrimination profile and characterize exactly which profiles can arise in a general probabilistic theory (GPT). For fixed nnn, the GPT region Gn\mathfrak{G}_nGn​ is a bounded rational polytope, giving a hierarchy Cn⊆Qn⊆Gn\mathfrak{C}_n\subseteq\mathfrak{Q}_n\subseteq\mathfrak{G}_nCn​⊆Qn​⊆Gn​ of classical, quantum, and GPT profiles, analogous to the local--quantum--no-signalling hierarchy in Bell theory. For n=3n=3n=3 we determine the classical and GPT polytopes explicitly. Within G3\mathfrak{G}_3G3​, the classical region is characterized by β:=F(123)−F(12)−F(13)−F(23)≤0β:=F(123)-F(12)-F(13)-F(23)\le0β:=F(123)−F(12)−F(13)−F(23)≤0, while the GPT maximum is 111. For qubit triples, the maximal value is attained by the trine, βtr=33/2−2β_{\mathrm{tr}}=3\sqrt3/2-2βtr​=33​/2−2, and we prove the dimension-independent quantum bound βQ≤2/3β_{\mathrm Q}\le2/3βQ​≤2/3, with a slight further improvement. Hence 0=βC<33/2−2≤βQ≤2/3<1=βGPT0=β_{\mathrm C}<3\sqrt3/2-2\leβ_{\mathrm Q}\le2/3<1=β_{\mathrm{GPT}}0=βC​<33​/2−2≤βQ​≤2/3<1=βGPT​. We conjecture βQ=βtrβ_{\mathrm Q}=β_{\mathrm{tr}}βQ​=βtr​ and prove this for arbitrary pure-state triples, together with further supporting evidence. For arbitrary nnn, every classical facet admitting a GPT violation already admits a quantum violation in dimension at most 333. A four-state qubit example shows that quantum success profiles need not be submodular, unlike for n=3n=3n=3. Finally, we exhibit a four-dimensional quantum triple whose discrete profile is classical for all subfamilies but becomes nonclassical when unequal priors are allowed.
General probabilistic theories provide the most general mathematical framework for the theory of probability in an operationally natural manner and generalize classical and quantum theories. In this article, we study state discrimination problems in general probabilistic theories using a Bayesian strategy. After reformulation of the theories with mathematical rigor, we first prove that an optimal observable to discriminate any (finite) number of states always exists in the most general setting. Next, we revisit our recently proposed geometric approach for the problem and show that for two-state discrimination, this approach is indeed effective in arbitrary dimensional cases. Moreover, our method reveals an operational meaning of Gudder’s “intrinsic metric” by means of the optimal success probability, which turns out to be a generalization of the trace distance for quantum systems. As its by-product, an information disturbance theorem in general probabilistic theories is derived, generalizing its well known quantum version.
A central question in quantum information is whether a given set of states can provide an advantage in some information-processing task. We establish a universal connection between two such questions: how well a set of states can be discriminated, and whether it can power tasks whose advantage stems from generalized contextuality. Working in the framework of generalized probabilistic theories (GPTs), which includes quantum and classical systems as special cases, we show that any set of states able to provide a nonclassical advantage in a contextuality-powered task must obey nontrivial upper bounds on the success probability of every state discrimination task using the full set. Contextual advantage therefore implies limited distinguishability, exposing a trade-off between two basic operational resources. Importantly, this is more than a statement about the idealized limit: perfect distinguishability is not needed to preclude contextuality. Our thresholds lie strictly below unity, so any set whose discrimination performance exceeds them while still imperfectly distinguishable is already guaranteed to admit a noncontextual explanation. The bounds follow from a simple geometric property, linear dependence of the state set, take a closed analytical form, and depend only on the prior of the task and the convex geometry of the states. As an illustration, we apply them to generalized parity-oblivious multiplexing, where sufficiently high success in the task implies that at least one sub-ensemble of the codebook cannot power any contextual advantage.
Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.
Quantum theory is considered to be the most fundamental and most accurate physical theory of today. Although quantum theory is conceptually difficult to understand, its mathematical structure is quite simple. What determines this particularly simple and elegant mathematical structure? In short: Why is quantum theory as it is? Addressing such questions is the aim of investigating the foundations of quantum theory. In the past this field of research was sometimes considered as an academic subject without much practical impact. However, with the emergence of quantum information theory this perception has changed significantly and both fields started to fruitfully influence each other. Today fundamental aspects of quantum theory attract increasing attention and the field belongs to the most exciting subjects of theoretical physics. This thesis is concerned with a particular branch in this field, namely, with so-called Generalized Probabilistic Theories (GPTs), which provide a unified theoretical framework in which classical and quantum theory emerge as special cases. This is used to examine nonlocal features that help to distinguish quantum theory from alternative toy theories. In order to extend the scope of theories that can be examined with the framework, we also introduce several generalizations to the framework itself. We start in Chapter 1 with introducing the standard GPT framework and summarize previous results, based on a review paper of the author [New J. Phys. 13, 063024 (2011)]. To keep the introduction accessible to a broad readership, we follow a constructive approach. Starting from few basic physically motivated assumptions we show how a given set of observations can be manifested in an operational theory. Furthermore, we characterize consistency conditions limiting the range of possible extensions. We point out that non-classical features of single systems can equivalently result from higher dimensional classical theories that have been restricted. Entanglement and non-locality, however, are shown to be genuine non-classical features. We review features that have been found to be specific for quantum theory separably or single and joint systems. Chapter 2 incorporates results published in [J. Phys. A 47(32), pp. 1-32 (2014)] and [Proc. QPL 2011 via EPTCS vol. 95, pp. 183–192 (2012)]. The GPT framework is applied to show how the structure of local state spaces indirectly affects possible nonlocal correlations, which are global properties of a theory. These correlations are stronger than those possible in a classical theory, but happen to show different restrictions that can be linked to the structure of subsystems. We first illustrate the phenomenon with toy theories with particular local state spaces. We than show that a particular class of joint states (inner product states), whose existence depends on geometrical properties of the local subsystems, can only have correlations for a known limited set called Q1. All bipartite correlations of both, quantum and classical correlations, can be mapped to measurement statistics from such joint states. Chapter 3 shows unpublished results on entanglement swapping in GPTs. This protocol, which is well known in quantum information theory, allows to nonlocally transfer entanglement to initially unentangled parties with the help of a third party that shares entanglement with each. We review our approach published in [Proc. QPL 2011 via EPTCS vol. 95, pp. 183–192 (2012)], which mimics the joint systems' structure of quantum theory by modifying a popular toy theory known as boxworld. However, it is illustrated that this approach fails for bigger multipartite systems due to inconsistencies evoked by entanglement swapping. It turns out that the GPT framework does not allow entanglement swapping for general subsystems with two-dimensional state spaces with transitive pure states. Altering the GPT framework to allow completely globally degrees of freedom, however, enables us to construct consistent entanglement swapping for these subsystems. This construction resembles the situation in quantum theory on a real Hilbert space. A questionable assumption usually taken in the standard GPT framework is the so-called no-restriction hypothesis. It states that the measurement that are possible in a theory can be derived from the state space. In fact, this assumption seems to exist for reasons of mathematical convenience, but it seems to lack physical motivation. We generalize the GPT framework to also account for systems that do not obey the no-restriction hypothesis in Chapter 4, which presents results published in [Phys. Rev. A 87, 052131 (2013)] and [Proc. QPL 2013, to be published in EPTCS]. The extended framework includes new classes of probabilistic theories. As an example, we show how to construct theories that include intrinsic noise. We also provide a "self-dualization" procedure that requires the violation of the no-restriction hypothesis. This procedure restricts the measurement of arbitrary theories such that the theories act as if they were self-dual. Self-duality has recently gathered lots of interest, since such theories share many features of quantum theory. For example Tsirelson’s bound holds for correlations on the maximally entangled state in these theories. Finally, we characterize the maximal set of joint states that can be consistently defined for given subsystems. This generalizes the maximal tensor product of the standard GPT framework.