For , the corresponding smaller root is . The conditional probability of selecting the larger root is
It is the same weight as a function of the actual selected value . Hence
Combining the two open intervals proves the output has the Inverse Gaussian distribution . The event has probability zero, so no atom occurs at ; the limiting density there is finite. The algorithm always selects one of its positive roots, so these branch densities exhaust its probability distribution.
Use the shape-rate convention for the gamma distribution. A shape and rate give expected value and variance . The two moments here force and . Thus , and the geometric-sum moment-generating function becomes
Put , and . Then , , and
Consequently the geometric sum of shape-two gamma variables has the same probability distribution as the sum of two independent exponential distributions with rates . Their convolution of independent random variables yields
The probability density function is zero for . It is nonnegative because , and its integral is
This verifies normalization directly. An alternative check uses the conditional gamma distribution with shape :
which is exactly the same density. The expected value supplies a further check.
Use five resource qubits, all initially , and prepare the graph state with edges , , , . The labels here identify resource vertices; logical wire 1 travels from vertex 1 to 3, and logical wire 2 travels from 2 to 4 to 5. Each edge is a Controlled-Z gate, and these entangling gates commute, so all can be applied when preparing the resource.
Figure 1.
Five-vertex graph resource, adaptive measurement angle, and classical output corrections for the two-qubit circuit
.
Measure vertex 1 in the equatorial qubit measurement basis at angle , with outcome , and vertex 2 at angle , with outcome . These measurements can be simultaneous. The one-bit teleportation lemma leaves the state on vertices 3 and 4, before the last teleportation, equal up to global phase to
Indeed commuting the two initial byproducts through creates precisely the crossed factors. The unused edge from 4 to the fresh vertex 5 is the last one-bit teleportation link.
Measure vertex 4 at angle , with outcome . By the printed J gate propagation identities,
Thus the remaining two-qubit quantum state is
up to global phase, where is the desired circuit output relabelled onto vertices 3 and 5. The sign choice cancels the unwanted angle reversal caused by the frame on vertex 4.
Finally measure vertices 3 and 5 in the computational basis, obtaining raw results . The Pauli Z gate affects only phases, while the Pauli X gate flips a computational result. The five-vertex graph-state circuit simulation therefore outputs
This deterministic classical correction reproduces the ideal joint probability distribution for every preceding measurement branch. The final fixed-basis measurements may share the second layer with the adaptive measurement of vertex 4, because their projectors act on different vertices; measuring them afterwards is also valid.
The Quasi-Poisson regression retains the same conditional mean but permits
This is a mean–variance function specification through quasi-likelihood; it does not assign a full probability distribution to each count. For independent observations, the quasi-score equation is proportional to , so the mean statistical parameter estimates equal those from Poisson regression. The output estimates through the Pearson dispersion estimator, and inflates the standard errors by approximately .
The large residual deviance relative to 728 residual statistical degrees of freedom also signals substantial overdispersion. Daily weather, traffic and other omitted conditions may produce greater count variation than a homogeneous Poisson distribution allows. The Quasi-Poisson regression accounts for that extra marginal variance. It still requires a correct conditional mean and an appropriate independence assumption; a common dispersion parameter alone does not repair serial correlation.
A scoring rule in the reward convention gives for announcing the probability distribution and then observing . Under genuine belief , the expected score is
A proper scoring rule satisfies for every admissible . A strictly proper scoring rule additionally requires equality only when the distributions coincide:
The expected scores must be well defined. A loss convention reverses the inequalities, but the question uses rewards.
Condition on the count and use the independence of random variables of the claim sizes. For their joint exponential transform factors, while for the empty sum contributes . Consequently the law of total expectation gives
This random sum of independent claims transform uses both independence assumptions: the count must be independent of the entire claim-size sequence, and the sizes must be mutually independent with the same probability distribution. The probability generating function is interpreted through its defining nonnegative series. The identity holds as a finite moment-generating function wherever that series is finite; outside that domain the expectation and series can agree at . In particular a positive argument may take beyond , so finiteness does not follow merely from the usual unit-disk domain of a probability generating function.
The moment-generating function of a mixture distribution is the mixture of its component transforms, so
For the aggregate, positivity of every claim implies exactly when . Choose
If , take to have the zero-truncated claim-count distribution, namely the conditional law of given . Then
Choose this count independently of a fresh independent claim-size sequence and put . Its probability distribution is that of conditional on being positive. Thus the hurdle decomposition of a positive random sum gives
and an independent Bernoulli random variable of success probability realizes . This establishes the distributional representation, including that is itself a positive random sum of independent claims. If , the aggregate is identically zero; set and choose any positive , for example one claim. Conditioning the count on positivity is then unnecessary and would be undefined.
For the specified geometric distribution on the nonnegative integers,
An exponential distribution of expected value has transform . Substitution yields
Hence is exponential with rate and expected value . This is the geometric sum of exponential variables with a rescaling of the claim mean. Identification can also use the uniqueness theorem for Laplace transforms of nonnegative random variables by taking .
The resulting distribution function is
Its jump of size at zero is important: the aggregate law is not a purely continuous exponential distribution.
In an ontological model of a quantum system, a preparation of gives a probability distribution over a physical state . A fixed quantum measurement has response probabilities with , reproducing the Born rule after averaging over . The PBR theorem says that, assuming preparation independence and the quantum predictions, distributions for distinct pure states cannot overlap with positive probability. Thus the quantum state is determined by the physical state in the psi-ontic model sense.
Preparation independence says that separately prepared systems have independent physical states: a product preparation is represented by the product of their individual ontic distributions. This is an assumption about the underlying physical states, not merely a statement that experimental preparation choices are independent. The excluded psi-epistemic model hypothesis is that the same physical state can occur with positive probability for two different pure-state preparations. The theorem neither excludes additional hidden variables nor claims that every interpretation which speaks of information is ruled out without these assumptions.
For the two given qubit preparations, consider the following PBR exclusion measurement for zero and plus, written in the ordered basis :
Direct inner products show that these four vectors are an orthonormal basis. Each labelled vector is orthogonal to the correspondingly labelled product preparation, so the associated projective measurement satisfies
This is an example of antidistinguishable quantum states: every outcome excludes one possible preparation, although the preparations cannot be perfectly distinguished.
To prove the contradiction without requiring deterministic quantum measurement responses, choose a common dominating measure for and write their densities . If they overlap, has mass . By preparation independence, every one of the four product densities dominates . Its total mass is . The zero Born rule probability for outcome implies that its nonnegative response vanishes almost everywhere for its matching preparation, hence also under this common product measure. All four responses would then vanish on a set of positive measure, contradicting their sum being one. Therefore and are mutually singular.
For the second pair, group the independent preparations into two blocks of . Define . The tensor-power reduction of PBR overlap gives
Each block therefore has an effective two-dimensional Hilbert space. Explicitly,
are orthonormal and . Embed the four-vector exclusion basis above into the tensor product of these two block spaces. To obtain a complete quantum measurement on all qubits, add the orthogonal complement of that four-dimensional subspace to one of its four projectors. All four allowed preparations lie in the subspace, so the four forbidden probabilities remain zero.
If the single-copy preparation distributions overlap with common mass , their -fold products all dominate the common measure of mass . The same zero-response contradiction now applies to the four block preparations. Thus
The argument is exact for the ideal devices specified in the question; no finite experimental resolution or noisy overlap bound is assumed.