Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 5 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let the quantum channel send to . From its Kraus representation, choose a Stinespring representation and formThe channel output is . Isometric invariance of Von Neumann entropy givesTherefore the quantum mutual information satisfies . Expanding its loss after discarding the environment givesThe final expression is the quantum conditional mutual information . The Strong subadditivity of Von Neumann entropy states exactly that it is nonnegative. HenceThis proves data processing for quantum mutual information for any mixed input and any local quantum channel, not just the atomic channel in earlier parts. The correlations lost are exactly the conditional correlations with the discarded environment.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 5 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Take an environment initially in its vacuum state , with recording an emitted photon. In atom-environment order, put and . A unitary dilation of amplitude damping is defined byThe middle two images are orthonormal, and they are orthogonal to the two fixed images. Thus this completion really is a unitary operator. For the occupied initial environmental subspace, it leaves a ground-state atom unchanged and splits an excited-state atom into no-emission and emission alternatives with probabilities and .
Tracing out the environment after this unitary evolution givesThe environment matrix elements are and , recovering the Kraus operators in part (a). More explicitly, the basis operators transform asApplying linearity to the atomic density operator therefore yieldsThe lost excited population goes to the ground state, the trace stays one, and coherences decrease by . Discarding the distinguishable environmental photon record is precisely what turns the joint unitary evolution into a noisy atomic quantum channel.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 5 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A unital quantum channel preserves the identity operator: . For equal input and output dimensions, this is equivalent to preserving the maximally mixed density operator.
For the amplitude damping channel,Thus the channel is not unital for ; it is unital only at , when it is the identity channel. In particular, it biases the maximally mixed state toward the atomic ground state. The trace-preservation condition involves , whereas unitality involves the opposite products .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 5 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Label the atomic ground state and excited state , with . The process is the amplitude damping channel, with Kraus operatorsThey satisfy , so the resulting Kraus representation is trace preserving.
The operator represents emission: it maps the excited state to times the ground state and annihilates the ground state. Its probability for an initially excited atom is . The operator represents no emission: it leaves the ground state unchanged and retains the excited amplitude with factor . This branch is not generally the identity operation; the absence of a photon itself changes the conditional relative amplitudes. For an arbitrary atomic density operator, the emission probability is and the no-emission probability is .
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Yes, the conversion can be deterministic using local operations and classical communication. Put and . The initial state's squared Schmidt coefficients are , while the target's decreasingly ordered squared Schmidt coefficients are . Since , one has and both pairs sum to one. ThusThe direction of this majorization is the allowed one in Nielsen's pure-state conversion theorem: maximal entanglement can be reduced by deterministic LOCC.
Here is an explicit protocol, so no conversion theorem need be assumed. The sender first applies a Pauli Z gate to remove the initial Bell-state minus sign. Starting from , she performs a two-outcome local measurement with Kraus operatorsThey define a valid measurement because . The two unnormalized states after measurement areEach outcome has probability . For outcome zero, the normalized state is already . For outcome one, both parties apply Pauli X gates, obtaining the same state. The sender communicates only which outcome occurred. Finally the receiver applies a Pauli X gate, giving in either branch. This is deterministic two-qubit entanglement dilution, with total success probability one; it does not rely on postselection.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Yes: use superdense coding, with a shared Bell state. Let the sender and receiver initially hold the first and second qubits of . To encode bits , the sender applies to her qubit. These Pauli operators produce four orthogonal states:She sends this qubit through the noiseless quantum channel. The receiver then possesses both qubits. He applies a controlled-NOT gate from the received qubit to his original qubit, followed by a Hadamard gate on the received qubit. This maps the four states in the table to . A measurement in the computational basis therefore recovers the two bits with certainty. No classical message is sent.
The resource assumption deserves care: one-qubit superdense coding needs a Bell pair already shared before encoding. If none is initially available, the sender can prepare a Bell pair locally and send one half through the same noiseless quantum channel in advance. The protocol then uses two transmitted qubits in total, including distribution of the entanglement, still with no classical communication. Alternatively, sending two computational basis qubits directly also communicates two bits. With a pre-shared Bell pair, one transmitted qubit suffices; without it, the entanglement-distribution cost must be counted. An unassisted single transmitted qubit cannot perfectly encode four classical messages: its Holevo bound is at most bit.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 3 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Take the rank-one orthogonal projections . Their pinching map givesThis has exactly the specified diagonal entries and no off-diagonal entries. Applying the entropy increase under nonselective projective measurement proved in part (c) therefore givesWriting , the output Von Neumann entropy is the Shannon entropy . Equality holds precisely when was already diagonal in this basis.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Using base-two logarithms, define the quantum conditional entropy byThe Subadditivity of Von Neumann entropy, , immediately gives .
For the lower bound, purify by an auxiliary system . Complementary subsystems of a pure state have the same nonzero reduced-state eigenvalues, by the Schmidt decomposition. Hence and . Applying Subadditivity of Von Neumann entropy to givesRearranging yields . This is the relevant side of the Araki–Lieb inequality, here derived using purification.
Finally the maximum entropy of a quantum state gives . For example, this follows directly fromby nonnegativity of quantum relative entropy. Combining the two bounds provesBoth signs can be attained: a maximally mixed independent of has the positive extreme, while a maximally entangled state with a sufficiently large has the negative extreme.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write . The Holevo quantity iswhere is Von Neumann entropy, with a consistent logarithm base. Attach an orthogonal classical label register to form the classical-quantum stateThe entropy of an orthogonal quantum mixture givesHere is the Shannon entropy of the classical label. Hence , where denotes quantum mutual information.
Let be the proposed quantum channel. Using its Kraus representation, define an linear isometry , since . This is a Stinespring representation. Apply it to , obtaining a state ; tracing out applies to every ensemble member. An linear isometry preserves nonzero eigenvalues and therefore Von Neumann entropy, soTheir difference isThe Strong subadditivity of Von Neumann entropy states that this expression is nonnegative for every tripartite state. ConsequentlyThus the Holevo quantity under a quantum channel decreases because discarding the dilation environment cannot improve correlations with the classical label. The probabilities remain unchanged throughout.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Fix a basis for the transposition map . If , write . ThenThus transposition is a positive linear map and also preserves the trace.
For dimension , apply it to one subsystem of the maximally entangled state from part (a):where is the swap operator, . It satisfies and , so its eigenvalues are on symmetric vectors and on antisymmetric vectors. In particular,A positive input has therefore acquired a negative expectation value after adjoining an identity channel. Transposition is positive but not completely positive in dimension at least two. The one-dimensional case is the identity map and is completely positive; the dimension qualification is necessary.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let and introduce an isomorphic reference system . Choose a basis and the maximally entangled stateComplete positivity makesa positive density operator. This is the normalized Choi matrix, with the reference placed first. Its spectral decomposition can be writtenThe number is at most .
Here an index state is a chosen basis vector in the reference. The corresponding relative state of is the generally unnormalized vectorThus . Define a linear map by its columns:Then , soExpand both sides in reference matrix units. The block with reference indices on the left is ; on the right it is . Since matrix units span all operators and is linear,This constructs the Kraus representation explicitly from the relative states, rather than assuming it.
Finally, trace preservation implies for every density operator thatTaking every rank-one orthogonal projection as forces the Hermitian operator in brackets to have the same quadratic form as the identity. ThereforeThe argument is finite-dimensional, as appropriate to the quantum-information setting; a channel with a different output dimension has the same construction with rectangular Kraus operators.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Interpret as the largest guaranteed radius for correcting all unknown-location Pauli operators of weight at most together. Products of two such errors have weight at most , so the Knill--Laflamme condition holds when . Conversely, let be a minimum-weight Pauli operator with nonscalar compression . If , split its support into two sets of size at most and write , up to an irrelevant phase. These two admissible errors violate the Knill--Laflamme condition. Thus the correctable Pauli error radius isIn particular, requires the additional assumption that is odd. Distance is not uniquely determined by alone. Nor does the weight of a particular correctable error characterize this radius: particular higher-weight errors can also be correctable.
For a concrete even-distance example, the stabilizer code generated by and has parameters . Every single-qubit nonidentity Pauli operator anticommutes with a generator, so it has zero compression. But commutes with both generators and acts nonscalarly on the code: it is unitary there and its code trace is zero. Hence the distance is two and its guaranteed radius is zero. This shows why an unconditional odd-distance formula would be incorrect.
Ignoring overall phases, an error of weight has choices of support and three choices, , at each affected qubit. The identity is the weight-zero term, soFor a nondegenerate quantum code, distinct correctable Pauli errors have orthogonal error-image subspaces. Each has dimension , since a Pauli operator is unitary. All subspaces lie in the physical Hilbert space of dimension . Counting dimensions proves the quantum Hamming boundDegeneracy would allow distinct errors to share an error-image subspace, so this particular counting argument would then fail.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use base-two logarithms, so Von Neumann entropy is measured in bits. Take an orthonormal basis of the code and purify its maximally mixed logical state asOnly a -dimensional reference support is needed; it can be embedded in the larger reference Hilbert space in the hint. Its reduced density matrix is maximally mixed on that support, so .
For any correctable erased subsystem , the Knill--Laflamme condition gives for every operator . Taking its matrix elements in the logical basis shows that for , and that the diagonal reductions are all the same state . ThusIn particular, the reference is decoupled from every set of at most erased qubits.
For an information-carrying code , first justify that two disjoint sets of size fit. If , partition all the physical qubits into sets each of size at most . Both are correctable. Additivity of Von Neumann entropy for a product state, and equality of complementary entropies for the pure state on , giveAdding yields , contradicting . Hence .
Now choose disjoint of size , and let contain the remaining qubits. The state on is pure. Product-state entropy additivity, equality of complementary entropies, and Subadditivity of Von Neumann entropy giveandAdding and cancelling proves . Finally use the maximum entropy of a quantum state bound . Therefore the quantum Singleton bound isThis proof uses quantum erasure correction, not nondegeneracy, so it applies to degenerate codes as well. A code encoding no logical information requires a separate distance convention; the argument above concerns the usual coding problem.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the known set of affected qubits, with . Expand arbitrary operators on in tensor products of . These Pauli operators span the complete error space on .
By the distance of a quantum error-correcting code, every Pauli operator of weight below has scalar compression . For two errors on the same known set , their product is also supported entirely on . Its weight is therefore at most , rather than twice . Expansion in the Pauli basis consequently givesThe Knill--Laflamme condition applies to the full operator space on , so it gives a recovery for any error channel acting on that subsystem. Every set of at most known error locations is correctable. This is quantum erasure correction; the ability to use the locations is what improves the guarantee over unknown-location errors.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 50 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be the orthogonal projection onto the code, and let be the specified error operators, including their linear span. The necessary and sufficient Knill--Laflamme condition iswhere the scalar matrix is independent of the encoded state. In an orthonormal basis of the code this meansThere must be one recovery quantum channel which corrects every allowed error channel, rather than a different recovery chosen using the unknown logical input.
The scalar condition means that any information carried away by the errors depends on their labels but not on the encoded amplitudes. To see how recovery works, diagonalize the positive semidefinite matrix and take corresponding linear combinations of the errors. Then . For each positive , the map is an linear isometry into an error-image subspace, and these subspaces are mutually orthogonal. Measuring their label and reversing the associated linear isometry recovers the logical state without measuring its amplitudes. Zero eigenvalues correspond to errors that annihilate the code. This also explains why the condition corrects arbitrary coherent combinations of the listed errors.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 5 3 vi Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write and . The commutator subgroup is the normal closure of : imposing makes the two generators commute, so the quotient is abelian. Part (iii), with , makes a powerfully embedded subgroup. Part (ii) therefore givesThis proves the hint, but cyclicity of the commutator subgroup alone is not yet the required cyclic normal subgroup with cyclic quotient.
If , the group is abelian and any one of the two generator subgroups is normal with cyclic quotient. Otherwise . Part (v) permits taking a th root of . Whenever the chosen root is still in , take another th root. The order increases by a factor at every step, since the power being rooted is nonidentity. Finiteness forces this process to stop. Thusfor some . The cyclic subgroup contains , and hence is normal: every conjugate of differs from by an element of . The nonzero image of in the Frattini quotient can be completed to a basis of dimension at most two. By the Burnside basis theorem, for a suitable ; if the quotient has dimension one, already generates . Therefore is cyclic. The powerful two-generator finite p-group is metacyclic.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 5 3 v Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Set and . The permitted power-embedding result, applied repeatedly, gives , and each is a powerful p-group. These subgroups eventually reach : if , its Frattini subgroup is proper. In fact these are the lower p-series layers, with their indices shifted by one.
For and , the commutator lies in , is central modulo , and has exponent dividing there. The class-two collection calculation from part (iv) therefore givesApplying part (iv) inside , whose third lower-series term is contained in , shows that the map is onto .
Given , first choose with . Suppose . Choose with . The displayed collection congruence then gives . Replacing by improves the approximation by one layer. Since the filtration on a group terminates, a finite sequence of corrections gives exactly. The reverse inclusion is the definition of . Hence
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 5 3 iv Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For a powerful p-group, , and . In , the image of is central and has exponent dividing , while the commutator subgroup is contained in that image. The quotient thus has nilpotency class at most two. Direct collection in such a group givesbecause is odd. If , the same calculation gives modulo , since . Consequently the power map is well defined on and is a group homomorphism to . Its image contains all the power generators of that quotient. It is therefore surjective.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 5 3 iii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the allowed reduction . Set and . Then , so is central. For and , put . The identity and centrality of give, by induction on ,At , both factors belong to : the first is a th power in , and the second is a th power because and . The subgroup is normal in . Commuting products of the generators with and using the same identity consequently yieldsSince , it follows that . Thus is powerfully embedded. This proves the reduced case, and the reduction permitted in the question gives the general assertion.
Past exam of the mathematics course of the University of Cambridge 2009 iii Paper 5 3 ii Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The powerfully embedded subgroup is itself a powerful p-group, so the finite Frattini subgroup formula gives . Conjugation by acts trivially on , because . Since is the normal closure of , the image of therefore generates : all conjugates have the same images as the original elements. The Burnside basis theorem now gives . Equivalently, a proper generated subgroup would lie in a maximal subgroup of , which contains and contradicts generation of that quotient.
Pinned article: Introduction to the OurBigBook Project
Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
Intro to OurBigBook
. Source. We have two killer features:
- topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculusArticles of different users are sorted by upvote within each article page. This feature is a bit like:
- a Wikipedia where each user can have their own version of each article
- a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.Figure 1. Screenshot of the "Derivative" topic page. View it live at: ourbigbook.com/go/topic/derivativeVideo 2. OurBigBook Web topics demo. Source. - local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
- to OurBigBook.com to get awesome multi-user features like topics and likes
- as HTML files to a static website, which you can host yourself for free on many external providers like GitHub Pages, and remain in full control
Figure 2. You can publish local OurBigBook lightweight markup files to either OurBigBook.com or as a static website.Figure 3. Visual Studio Code extension installation.Figure 5. . You can also edit articles on the Web editor without installing anything locally. Video 3. Edit locally and publish demo. Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension. - Infinitely deep tables of contents:
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact





