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.
AI Summary
The paper asks which patterns of minimum-error discrimination can occur when every subfamily of a fixed state list is tested. It studies the unnormalized error profile $F(H)=|H|-D(H)$ and the nested classical, quantum, and general probabilistic theory (GPT) regions.
Classical success profiles are exactly normalized coverage functions. GPT success profiles are exactly finite pointwise maxima of these functions, realized on Cartesian products of classical simplexes. A decomposition of affine measurements on such products establishes the converse. This yields an exact linear-programming membership test and proves that the GPT region is a bounded rational polytope. Universal measurement-relabeling arguments also give a maximum-spanning-tree lower bound on discrimination error.
For three states, explicit classical and GPT polytopes differ by the single classical constraint $\beta=F(123)-F(12)-F(13)-F(23)\le0$. Its GPT maximum is $1$. Quantum triples satisfy $0.598076\ldots=3\sqrt3/2-2\le\beta_{\mathrm Q}\le(3\sqrt{15}-9)/4=0.654738\ldots$. The lower value is attained by the qubit trine and proved optimal for all qubit triples and arbitrary pure-state triples, using Bloch-ball geometry and Gram-matrix/pretty-good-measurement bounds. The dimension-independent upper bound combines operator inequalities with a fidelity-based error estimate.
For arbitrary list size, every classical facet admitting a GPT violation also admits a quantum violation in dimension at most three. Further examples show failure of quantum success-profile submodularity with four states and nonclassical unequal-prior behavior hidden by a classical discrete profile. The mixed-state trine conjecture and full quantum-region characterization remain open; the general GPT realization and membership test have exponential-size bounds.
Little sign of AI-generated text
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
For a collection of states indexed by [n]=1,…,n, let F(H) denote the optimal unnormalized minimum discrimination error for each nonempty subfamily H⊆[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 Gn is a bounded rational polytope, giving a hierarchy Cn⊆Qn⊆Gn 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 G3, the classical region is characterized by β:=F(123)−F(12)−F(13)−F(23)≤0, while the GPT maximum is 1. For qubit triples, the maximal value is attained by the trine, βtr=33/2−2, and we prove the dimension-independent quantum bound βQ≤2/3, with a slight further improvement. Hence 0=βC<33/2−2≤βQ≤2/3<1=βGPT. We conjecture βQ=β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.
The paper asks which patterns of minimum-error discrimination can occur when every subfamily of a fixed state list is tested. It studies the unnormalized error profile F(H)=∣H∣−D(H) and the nested classical, quantum, and general probabilistic theory (GPT) regions.
Classical success profiles are exactly normalized coverage functions. GPT success profiles are exactly finite pointwise maxima of these functions, realized on Cartesian products of classical simplexes. A decomposition of affine measurements on such products establishes the converse. This yields an exact linear-programming membership test and proves that the GPT region is a bounded rational polytope. Universal measurement-relabeling arguments also give a maximum-spanning-tree lower bound on discrimination error.
For three states, explicit classical and GPT polytopes differ by the single classical constraint β=F(123)−F(12)−F(13)−F(23)≤0. Its GPT maximum is 1. Quantum triples satisfy 0.598076…=33/2−2≤βQ≤(315−9)/4=0.654738…. The lower value is attained by the qubit trine and proved optimal for all qubit triples and arbitrary pure-state triples, using Bloch-ball geometry and Gram-matrix/pretty-good-measurement bounds. The dimension-independent upper bound combines operator inequalities with a fidelity-based error estimate.
For arbitrary list size, every classical facet admitting a GPT violation also admits a quantum violation in dimension at most three. Further examples show failure of quantum success-profile submodularity with four states and nonclassical unequal-prior behavior hidden by a classical discrete profile. The mixed-state trine conjecture and full quantum-region characterization remain open; the general GPT realization and membership test have exponential-size bounds.
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.
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.
General probabilistic theories (GPTs) are theoretical models having states, measurements, and probabilities of obtaining measurement outcomes.For example, classical probability theory and quantum theory are GPTs with probability vectors and density matrices as states, respectively.In the study of GPTs, one often describes a finite number of GPTs A 1 , . . ., A n together, as one GPT A = A 1 • • • A n .In this case, we say that A is a whole system of subsystems A 1 , . . ., A n .If A 1 , . . ., A n are quantum systems, then A is called a locally quantum system.A quantum system is locally quantum, but there are many other locally quantum systems.In this thesis, we study three topics associated with quantum systems and locally quantum systems.The first one is capacity.For a GPT, the maximum number of simultaneously and perfectly distinguishable states is called the capacity.It is known that the capacity does not really depend on the GPT.In this thesis, we propose a statement S to determine the capacities of special locally quantum systems, and prove a weaker statement WS.Statement WS is a statement associated with tensor product spaces over C. Our proof works even if replacing the scalar field C with an arbitrary infinite field F. We also show a partial result for finite fields.The second one is differential privacy (DP).DP was born in the study to utilize private data while protecting the data (privacy-preserving data mining, PPDM).For this reason, DP has been studied by using classical probability theory, and has almost never been studied in quantum information theory.In this thesis, we define a quantum version of DP (called classical-quantum DP) and investigate its mathematical aspects.We define the set CQ n of all classical-quantum differentially private n-tuples of quantum states and the subset EC n of CQ n that is essentially classical.We prove that EC n = CQ n if n = 2 and EC n = CQ n if n ≥ 3.The third one is perfect discrimination of two states.In quantum theory, orthogonality is a necessary and sufficient condition to distinguish two states perfectly (denote this equivalence by E).However, equivalence E does not hold for a general GPT.In this thesis, we construct continuous one-parameter families of locally quantum systems in a certain natural manner, and investigate perfect discrimination of two states in the framework of those locally quantum systems.These one-parameter families contain a locally quantum system sufficiently close to a quantum system.Nevertheless, we show that they violate equivalence E.
This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly distributed ensembles of the form {N1,ρi⊗k}i=1N, where N states in dimension d are provided in k identical copies, and derive universal limits in this scenario. For pure state ensembles, we prove that whenever N is large enough to support a state k-design, these designs will exactly give rise to the maximally discriminable sets. We further show that when N exceeds the size required for a k-design, mixed states can outperform all pure state ensembles. We then recognise that the problem of most discriminable classical states in the multi-copy regime is in one-to-one correspondence to the concept of the multiplicative Bayes capacity of independent uses of classical channels, a concept that emerges naturally in the context of classical information leakage. This connection allows us to completely solve the classical analogue of our problem when N≥(kd+k−1), and to prove that quantum systems offer a quadratic advantage (in number of copies k) over classical ones. Then, we prove that this quantum over classical advantage is strongly reduced when one is restricted to real quantum states, more precisely, when N≥k+1, pure real qubits only offer a constant advantage over classical bits. Finally, we introduce computational techniques to find sets of most discriminable ensembles and to obtain rigorous universal upper bounds on the maximal success probability for multi-copy state discrimination in cases that are analytically intractable.
We present the solution to the problem of optimally discriminating among quantum states, i.e., identifying the states with maximum probability of success when a certain fixed rate of inconclusive answers is allowed. By varying the inconclusive rate, the scheme optimally interpolates between unambiguous and minimum error discrimination, the two standard approaches to quantum state discrimination. We introduce a very general method that enables us to obtain the solution in a wide range of cases and give a complete characterization of the minimum discrimination error as a function of the rate of inconclusive answers. A critical value of this rate is identified that coincides with the minimum failure probability in the cases where unambiguous discrimination is possible and provides a natural generalization of it when states cannot be unambiguously discriminated. The method is illustrated on two explicit examples: discrimination of two pure states with arbitrary prior probabilities and discrimination of trine states.
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.