Past exam of the computer science course of the University of Oxford 2019 Quantum information 2 c Solution by
Codex 0 2026-10-25
For deterministic classical responses, denote the two possible local answers by , and . Certainty in the GHZ game would requireTaking the exclusive or of all four equations gives zero on the left, since every answer occurs twice, but one on the right. This contradiction rules out deterministic certainty. Pre-shared randomness cannot cure it: conditioning on the random seed fixes a deterministic response table, and none succeeds on every allowed input. Thus noncommunicating classical players cannot win with certainty. No uniform distribution on the referee's questions is needed for this worst-case claim.
For the quantum strategy, share the GHZ state and measure the Pauli X gate observable when the local question is 0, or the Pauli Y gate observable when it is 1. Return bit 0 for measurement eigenvalue and bit 1 for eigenvalue . The four relevant operator identities areFor the first identity, the three bit flips exchange and . For each remaining identity, the two Y actions contribute on and on , so they exchange the terms with a minus sign. Local measurements on separate systems commute, and the product of their observed eigenvalues is therefore fixed by the displayed joint eigenvalue. That product equals , giving exactly the required output parity for each promised input. Hence the quantum strategy wins with certainty without communication. This is the GHZ theorem in nonlocal-game form; it does not let a player control another player's individual outcome.
Past exam of the computer science course of the University of Oxford 2019 Quantum information 1 c Solution by
Codex 0 2026-10-25
Let and . The first basic measurement has outcome probabilities and , obtained by conjugating the amplitudes in the bras. Conditional on its first outcome, the next computational-basis measurement returns 0 with probability ; conditional on its second outcome, that probability is . The law of total probability therefore givesConsequently the minimum is , attained exactly when . The relative complex phases do not affect this result. The alternatives after the first measurement form a classical mixture; their amplitudes must not be added coherently as if no measurement occurred.
Past exam of the computer science course of the University of Oxford 2019 Quantum information 1 a Solution by
Codex 0 2026-10-25
A basic measurement is specified by an orthonormal basis , with outcome associated with the rank-one orthogonal projection . For a normalized pure state , the Born rule givesThe probabilities sum to one because . Conditional on an outcome with , the post-measurement state iswhich represents up to a global phase. An outcome of zero probability has no conditional state to normalize. For a density matrix , the corresponding expressions are and . If the outcome is ignored, the nonselective projective measurement instead produces , generally a mixed state.[ref]
Basic notions of quantum information. §2.3, Definition 2.34 and the outcome-probability rule; specialize to rank-one orthogonal projections
Past exam of the computer science course of the University of Oxford 2019 Computational game theory 3 e Solution by
Codex 0 2026-10-25
Where its denominator is nonzero, normalization enforces cooperative-game efficiency and preserves cooperative-game symmetry and the null player axiom. The violated axiom is cooperative-game additivity.
For an exact counterexample on three players, let be the majority game, and let be the dictatorship in which a coalition wins precisely when it contains player one. Their probabilistic Banzhaf indices arewith . HenceUnnormalized indices add, so . Their sum is , while . ThereforeThe sum game is a valid transferable utility game, although it is not binary; that is the natural domain of the additivity axiom. The failure comes from a game-dependent scaling factor. A zero denominator, as for the zero game, makes the displayed normalization undefined unless a separate convention is supplied; none of the counterexample's denominators vanish.
Past exam of the computer science course of the University of Oxford 2019 Computational game theory 3 d Solution by
Codex 0 2026-10-25
The probabilistic Banzhaf index satisfies cooperative-game symmetry, the null player axiom and cooperative-game additivity, but not cooperative-game efficiency.
For cooperative-game symmetry, interchangeable players have for every omitting them. The Banzhaf difference identity therefore gives equal indices. For a null player, every marginal contribution in the defining average is zero, so its index is zero.
For cooperative-game additivity, each marginal contribution is additive:Averaging both sides over the same coalitions gives .
For failure of cooperative-game efficiency, the indices computed in part (b) sum to , whereas the grand-coalition value is one. This is already a counterexample. Independently, a three-player majority game gives each player index , also exceeding the total value when summed. Pivotality averaged over independently chosen coalitions does not telescope in the way the ordering-average Shapley value does.
Past exam of the computer science course of the University of Oxford 2019 Computational game theory 3 c Solution by
Codex 0 2026-10-25
Fix distinct players and write , with analogous notation for and . Splitting sampled coalitions according to whether they contain the other player givesSubtracting yields the Banzhaf difference identity,In a weighted voting game, means that has greater total weight than . Thus for every : if the lighter coalition reaches the quota, the heavier one does too. Every summand is nonnegative, proving . Equality remains possible even when the weights differ.
Past exam of the computer science course of the University of Oxford 2019 Computational game theory 3 b Solution by
Codex 0 2026-10-25
Use the inclusive quota: a coalition wins at weight at least . For each player, count losing predecessor coalitions that become winning when that player joins. Group these swing counts by predecessor cardinality :
| Player and weight | Swing counts | Shapley value | Banzhaf index |
|---|---|---|---|
For example, player one is pivotal for predecessor coalitions , , , and . Player three is pivotal only for ; player four has the symmetric counterpart.
Each swing contributes to the probabilistic Banzhaf index. For the Shapley value, a swing with predecessors contributes , which is for the four possible sizes. Applying these weights to the table givesThe Shapley values sum to one. The unnormalized Banzhaf indices sum to ; they must not be replaced by normalized shares in this part.
There are unlisted articles, also show them or only show them.