Quantum Epistemology and Falsification.

The operational axiomatization of quantum theory in previous works can be regarded as a set of six epistemological rules for falsifying propositions of the theory. In particular, the Purification postulate-the only one that is not shared with classical theory-allows falsification of random-sequences generators, a task classically unfeasible.

1. Introduction

Our physical world is ruled by two theories: classical theory (CT) and quantum theory (QT). Compared to CT, QT still looks weird; however, this may be a symptom that we are still missing the hidden logic of the theory. Indeed, we should not forget that among the two theories, QT is the most powerful one, simply because CT is a restriction of QT. In fact, for given system dimension d, CT restricts QT’s states to the convex hull of a fixed maximal set of jointly perfectly discriminable pure states (the d-simplex), and, correspondingly, transformations are restricted to (sub)Markov linear maps. (For mathematical axiomatizations and main theorems of both theories, QT and CT, see Appendix A). We can thus regard the indeterminism inherent QT as the price to be payed for adding information-processing power.

Deriving QT from information-theoretical principles [1,2,3] reveals how the theory is more powerful than CT. Indeed, the two theories share five postulates, whereas the sixth QT postulate highlights the fundamental task that QT can achieve, whereas CT cannot: purification. On the other hand, the sixth CT postulate makes the theory a restriction of QT. Thus, purification synthesizes the additional power of QT compared to CT.

In the following, OPT will be the acronym for Operational Probabilistic Theory. (See Table A1 in Appendix A for acronyms, abbreviations, and symbols). OPTs have been introduced in Refs. [1,2,3], originally inspired by the works of L. Hardy [4] and C. Fuchs [5].

Table A1

Notation, special-cases corollaries, and common abbreviations.

B^+(H)	bounded positive operators over H
CP_≤	trace-non increasing completely positive map
CP_=	trace-preserving completely positive map
H	Hilbert space over C
Cone(S)	conic hull of S
Cone_≤1(S)	convex hull of {S∪0}
Conv(S)	convex hull of S
Eff(A)	set of effects of system A
Eff_1(A)	set of deterministic effects of system A
Mrkv_≤	normalization-non-incressing right-stochastic Markov matrices
Mrkv_1	normalization-preserving right-stochastic Markov matrices
Prm(n)	n×n permutation matrices
(R^n)≤1+	{x∈R^n_A|x≥0,x≤1}: simplex S^n_A+1
(R^n)1+	{x∈R^n_A|x≥0,||x||_1=1}: simplex S^n_A
St(A)	set of states of system A
St_1(A)	set of deterministic states of system A
T(H)	trace-class operators over H
T^+(H)	trace-class positive operators over H
T≤1+(H)	positive sub-unit-trace operators over H
T=1+(H)	positive unit-trace operators over H
Trn(A→B)	set of transformations from system A to system B
Trn_1(A→B)	set of deterministic transformations from system A to system B
U(H)	unitary group over H
	Special cases corollaries
	T(C)=C, T^+(C)=R^+, T≤1+(C)=[0,1], T=1+(C)={1}
	CP(T(H)→T(C))=P(T(H)→T(C))={Tr[·E], E∈B^+(H)}
	CP(T(C)→T(H))=P(T(C)→T(H))=T^+(H)
	CP_≤(T(C)→T(H))≡T≤1+(H)
	CP_≤(T(H)→T(C))≡{ϵ(·)=Tr[·E], 0≤E≤I}
	Mrkv_≤(n,1)=(R^n)≤1+
	Mrkv_1(n,1)=(R^n)=1+

In the convex-OPT language, the five common postulates are:

Causality : The probability of preparation is independent on the choice of observation.

Perfect discriminability: Every state on the boundary of the convex set of states can be perfectly distinguished from some other state.

Local discriminability: It is possible to discriminate any pair of states of composite systems using only local observations.

Compressibility: For all states that are not completely mixed there exists an ideal compression scheme.

Atomicity of composition: The composition of two atomic transformations is atomic.

The sixth postulate, different for each of the two theories, is:

Purification: Every state has a purification. For a fixed purifying system, every two purifications of the same state are connected by a reversible transformation on the purifying system.

Perfect joint discrimination: For any system, all pure states can be perfectly discriminated jointly.

Notice that P6 forces CT to restrict QT’s pure states to a maximal set of perfectly discriminable ones.

2. The Purification Principle

Let us recall the statement of the principle.

For every system If two pure states then there exists a reversible transformation

We call a purification of , with purifying system.

Informally, Equation (1) guarantees that we can always find a pure state of that is compatible with our limited knowledge of alone. Furthermore, Equation (2) specifies that all the states of that are compatible with our knowledge of are essentially the same, up to a reversible transformation on . We call this property uniqueness of purification. (Note that the two purifications in Equation (2) have the same purifying system).

3. Epistemological Value of the Postulates

In quantum logic [6], one associates a “proposition” about the system to an orthogonal projector on a subspace of the Hilbert space of . With the map between and its support being a bijection, one can equivalently associate “propositions” to Hilbert subspaces . (Here, by “support” of an operator we mean the orthogonal complement of its kernel.) One can now enrich the notion of “proposition” by associating it to a quantum state with support , the state encoding a reacher information more than just its support . We conclude that the notion of “state” constitutes a more detailed concept of “proposition” than that of the orthogonal projector. For this reason, in the present context, it is more appropriate to associate the word “proposition” to the notion of “quantum state” instead of the original definition as the orthogonal projector. In other words, a “proposition about ” will be a synonym of the “state of ”. Clearly, the same notion can be extended to CT, since CT is a restriction of QT.

According to the above identification we can now translate QT and CT into the language of “propositions”, and appreciate how, remarkably, all six postulates for QT and CT are of the epistemological nature, i.e., they all are assertions regarding falsifiability of the theory’s “propositions”.

Causality is required for falsification of propositions by observations.

Perfect discriminability guarantees the existence of falsifiable propositions derived from the theory.

Local discriminability guarantees that falsifiability of joint propositions can be accomplished “locally”, namely using single system observations and classical communication.

Compressibility provides the possibility of reducing the dimension of the system, supporting a falsifiable proposition.

Atomicity of composition guarantees the existence of a class of transformations that do not affect falsifiability of propositions.

Purification allows for falsifiable random generators.

Perfect discrimination allows any set of determinate propositions to be jointly falsifiable.

Epistemological Rules

Any of the above principles constitutes an epistemological power of the corresponding principle. Statement E6, in particular, establishes the possibility of logically falsifying a quantum random generator, namely, there exists a falsification test that establishes if a given quantum random generator is different from a claimed one. Notice that such a falsification cannot be achieved classically for probabilities that are not deterministic, namely, , since no succession of outcomes can logically falsify a value of p different from 0 and 1. Remarkably, as we will see in this paper, thanks to the purification postulate, within QT we can falsify random generators with any probability distribution. Classically, one falsifies the generator for whenever the event does not occur, and for when it does. In such a case, the probability value itself is directly falsified. We stress that in the other cases, QT makes the random generator falsifiable—not the probability value.

Before proving the epistemological rules, we recall the theory of falsification tests introduced in Ref. [7].

4. The Falsification Test

We say that an event F is a falsifier of hypothesis if F cannot happen for . We will call the binary test a falsification test for hypothesis , and denote by the inconclusive event. Notice that the occurrence of generally does not mean that , but that Hyp has not been falsified.

Suppose now that one wants to falsify a proposition about the quantum state of system . In such case, any effective falsification test can be achieved as a binary observation test of the form: where by the symbol F () we denote both event and corresponding positive operator. The strict positivity of F is required for effectiveness of the test, corresponding to the inconclusive test, which outputs only the inconclusive outcome. On the other hand, corresponds to the logical a priori falsification.

Examples of inconclusive tests have been given in Ref. [7], to prove that hypotheses as “purity of an unknown state”, or “unitarity of an unknown transformation” cannot be falsified.

Falsification of a Quantum State Support

Consider the proposition: denoting the support of . Then, any operator of the form: would have zero expectation for a state satisfying in Equation (4), which means that occurrence of F would falsify Hyp, namely: Equation (5) provides the most general falsification test of in Equation (4), the choice corresponding to the most efficient test, namely the one maximizing falsification chance. Notice that the outcome corresponding to does not correspond to a verification of Hyp, since it generally can occur for .

5. Proofs of Epistemological Rules

In this section we prove the epistemological rules given in Section 3. We will denote by the convex set of states of system and by its boundary.

For any proposition that is falsifiable (i.e., ), causality protects the falsification target state from being changed by the particular choice of observation.

Consider two quantum states . They are perfectly discriminable iff , which implies that with both ranks at least unit. It follows that and the same for , hence both . We conclude that the two states are falsifiable, with falsifiers and , respectively.

Here, we will use the double-ket notation [8] (for a thorough treatment see [3]). Shortly, once it is chosen the orthonormal factorized canonical basis for , the one-to-one correspondence between vectors in and operators on holds where denotes the Hilbert–Schmidt operators in dimensions d. One can then veryify the following identity: with denoting the transposed operator of B, the operator that has the transposed matrix w.r.t. the canonical basis. Notice that e.g., where is the vector with complex-conjugated coefficients w.r.t. the canonical basis.

Consider now the pure entangled state corresponding to state-vector . The following sequence of identities holds: where is an orthonormal basis for , with . Equation (7) shows that choosing orthogonal to one has a local falsifier of the entangled state given by:

One can see that the generalization to mixtures R is straightforward, upon writing the state R in the canonical form:

Any falsifiable state has , hence it can be isometrically mapped to a state of a system with .

A transformation is called atomic if it has only one Krauss term, namely it can be written as , with and . This implies that , namely the falsification space has a dimension that is not decreased; hence, the output state can be falsified. This is not necessarily true for non atomic, namely with more than one Krauss term, i.e.,

See Section 6.

It trivially holds for CT.

6. Falsifiable Setup of a Random Generator

A falsifiable setup for a quantum binary random generator can use any quantum system , e.g., a qubit, in a pure state along with an orthogonal observation test with , (namely a “customary discrete” observable). The following setup, is a binary random generator with probability .

Notice that the advantage of this choice of setup (compared to, e.g., using a mixed state and/or a non orthogonal observation test) is that it is falsifiable. In fact, the preparation of the state can be falsified efficiently by running the falsification test of the state support, using falsifier . On the other hand, the observation test can be taken as just the observable providing the physical meaning of the orthonormal basis chosen for the qubit (e.g., spin-up and spin-down), which is required to physically define the state preparation.

The above setup can be trivially generalized to a N-ary random generator () with probability distribution by using a system with , and a pure state with vector with more than two nonvanishing probability amplitudes. Here, still provides the most efficient falsifier. Notice that for it is also possible to falsify mixed states with rank strictly smaller than . Notice that the probability of falsification of a mixed state is given by , and vanishes linearly with the overlap between the declared state and the true state .

7. Conclusions

CT and QT are more than theories about the world: they constitute extensions of logic. Famously, von Neumann attempted to prove QT to be a kind of logic: we now know that it is an extension of it, instead. We have seen that QT can be regarded as a chapter of epistemology, being a set of rules for accessibility of falsifications. Thus, more than answering the question “what is reality”, QT provides rules for “how we can explore reality”. One can then add axioms to those of QT to get more refined theories, such as Free Quantum Field Theory. The latter can indeed be obtained upon considering a denumerable set of QT systems, and adding the axioms of locality, homogeneity, and isotropy of interactions (see, e.g., the review [9]).

Table A2

Mathematical axiomatization of Quantum Theory. As given in the table, in Quantum Theory to each system , we associate a Hilbert space over the complex field . To the composition of systems and , we associate the tensor product of Hilbert spaces . Transformations from system to are described by trace-nonincreasing completely positive (CP) maps from traceclass operators on to traceclass operators on . Special cases of transformations are those with input trivial system corresponding to states, whose trace is the preparation probability, the latter providing an efficient Born rule from which one can derive all joint probabilities of any combination of transformations. Everything else is simply special-case corollaries and one realization theorem: these are reported in Table A3.

Quantum Theory
system	A	H_A
system composition	AB	H_AB=H_A⊗H_B
transformation	T∈Trn(A→B)	T∈CP_≤(T(H_A)→T(H_B))
Born rule	p(T)=TrT	T∈Trn(I→A)

Table A3

Corollaries and a theorem of Quantum Theory, starting from Table A2 axiomatization. The first corollary states that the trivial system , in order to satisfy the composition rule , must be associated with the one-dimensional Hilbert space , since it is the only Hilbert space that trivializes the Hilbert space tensor product. The second corollary states that the reversible transformations are the unitary ones. The third corollary states that the deterministic transformations are the trace-preserving ones. Then the fourth and fifth corollaries give the composition of transformations in terms of compositions of maps. We then have four corollaries about states: (1) states are transformations starting from the trivial system and, as such, are positive operators on the system Hilbert space, having trace bounded by one; (2) the deterministic states correspond to unit-trace positive operator; (3) the states of the trivial system are just probabilities; (4) the only deterministic state of the trivial system is number 1. We then have two corollaries for effects, as special cases of transformation toward the trivial system: (1) the effect is represented by the partial trace over the system Hilbert space of the multiplication with an operator that is positive and bounded by the identity; (2) the only deterministic effect is the partial trace over the system Hilbert space. Finally, we have the realization theorem for transformations in terms of unitary interaction with an environment and a projective effect-test over environment , with , being a complete set of orthogonal projectors.

Quantum Theorems
trivial system	I	H_I=C
reversible transf.	U=U·U^†	U∈U(H_A)
determ. transformation	T∈Trn_1(A→B)	T∈CP_≤1(T(H_A)→T(H_B))
parallel composition	T_1∈Trn(A→B), T_2∈Trn(C→D)	T_1⊗T_2
sequential composition	T_1∈Trn(A→B), T_2∈Trn(B→C)	T_2T_1
states	ρ∈St(A)≡Trn(I→A)	ρ∈T≤1+(H_A)
	ρ∈St_1(A)≡Trn_1(I→A)	ρ∈T=1+(H_A)
	ρ∈St(I)≡Trn(I→I)	ρ∈[0,1]
	ρ∈St_1(I)≡Trn(I→I)	ρ=1
effects	ϵ∈Eff(A)≡Trn(A→I)	ϵ(·)=Tr_A[·E], 0≤E≤I_A
	ϵ∈Eff_1(A)≡Trn_1(A→I)	ϵ=Tr_A
Transformations as unitary interaction + von Neumann-Luders		T_iρ=Tr_E[U(ρ⊗σ)U^†(I_B⊗P_i)]

Table A4

Mathematical axiomatization of Classical Theory. To each system , we associate a real Euclidean space . To the composition of systems and , we associate the tensor product spaces . Transformations from system to system are described by substochastic Markov matrices from the input space to the output space. All others are simple special-case corollaries: these are reported in Table A5.

Classical Theory
system	A	R^n_A
system composition	AB	R^n_AB=R^n_A⊗R^n_B
transformation	T∈Trn(A→B)	T∈Mrkv_≤(R^n_A,R^n_B)

Table A5

Main theorems of Classical Theory, starting from axioms in Table A4. The first corollary states that the trivial system in order to satisfy the composition rule must be associated to the one-dimensional space , since it is the only real linear space that trivializes the tensor product. The second corollary states that the reversible transformations are the permutation matrices. The third states that transformations are substochastic Markov matrices. The fourth states that the deterministic transformations are stochastic Markov matrices. Then the fifth and sixth corollaries give the composition of transformations in terms of composition of matrices. We then have four corollaries about states: (1) states are transformations starting from the trivial system and, as such, are sub-normalized probability vectors (vectors in the positive octant with sum of elements bounded by one); (2) the deterministic states correspond to normalized probability vectors; (3) the case of trivial output-system correspond to just probabilities; (4) the only trivial output-system deterministic state is the number 1. We then have two corollaries for effects, as special cases of the transformation toward the trivial system: (1) the effect is represented by scalar product with a vector with components in the unit interval; (2) the only deterministic effect is the scalar product with the vector with all unit components.

Classical Theorems
trivial system	I	R
reversible transformations	P	P∈Prm(n_A)
transformation	T∈Trn_⩽(A→B)	T∈Mrkv_⩽(R^n_A,R^n_B)
determ. transformation	T∈Trn_1(A→B)	T∈Mrkv_1(R^n_A,R^n_B)
parallel composition	T_1∈Trn(A→B), T_2∈Trn(C→D)	T_1⊗T_2
sequential composition	T_1∈Trn(A→B), T_2∈Trn(B→C)	T_2T_1
states	x∈St(A)≡Trn(I→A)	x∈(R^n_A)≤1+
	x∈St_1(A)≡Trn_1(I→A)	x∈(R^n_A)=1+
	p∈St(I)≡Trn(I→I)	p∈[0,1]
	p∈St_1(I)≡Trn(I→I)	p=1
effects	ϵ∈Eff(A)≡Trn(A→I)	ϵ(·)=·x, 0≤x≤1
	ϵ∈Eff_1(A)≡Trn_1(A→I)	ϵ=·1