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 2007 iii Paper 60 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The eigenvalues of a density operator are nonnegative and sum to one. ThereforeFor a non-pure state at least two eigenvalues are positive, so the last expression is strictly positive. Combining this with the Generalized Bloch representation givesThus every non-pure quantum state lies strictly inside the radius sphere for . It need not be an interior point of the entire physical state body: for , a rank-deficient mixed density operator can lie on that body's boundary while still lying inside the Euclidean sphere.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 60 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Take any rank-one orthogonal projection and its generalized Bloch vector . The antipodal vector is on the same sphere, but its corresponding trace-one Hermitian matrix isOn the range of , this matrix has eigenvalue , which is negative for . It is therefore not a positive semidefinite matrix and cannot be a density operator. Hence the pure states do not cover the sphere when . This also shows directly why the purity bound for generalized Bloch vectors does not by itself guarantee a physical quantum state.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 60 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
By orthonormality in the Generalized Bloch representation,A pure state has density operator with , so and its purity of a density operator is one. ConsequentlyEvery pure state therefore maps to the specified radius- sphere in , of dimension . The expansion is unique, so it distinguishes pure-state density operators, while vectors differing only by global phase describe the same point. This proves that pure states lie on the sphere, without asserting that they fill it.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 60 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the real vector space of Hermitian matrices and its Hilbert-Schmidt inner product . A Hermitian -by- matrix has real diagonal entries and two real parameters for each off-diagonal pair, hence real dimension . Imposing zero trace removes one real dimension. Each supplied generalized Pauli matrix is Hermitian and traceless, and there are off-diagonal matrices and diagonal matrices, totaling .
Their assumed orthonormality makes them linearly independent. Since this equals the dimension of the traceless space, they are an orthonormal basis of the traceless Hermitian matrices. To extend the family, the required additional generator is , which is implicit in the indexing of the question. It has unit Hilbert-Schmidt norm and is orthogonal to every traceless generator, so the extended family is an orthonormal basis of all Hermitian matrices.
For a density operator , cyclicity of the trace givesThus . Since , the resulting Generalized Bloch representation is
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 4 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
First explain the stated local conversion. The four equally weighted correlated local Pauli operations , , , and remove coherences in the Bell states basis, since those states have distinct joint parity eigenvalues. This leaves four Bell probabilities. One-party Pauli operations permute the Bell projectors, so the largest probability can be placed on the singlet . Call it ; necessarily .
The two common unitaries found above generate permutations of the three triplet projectors: exchanges and , and exchanges and . Averaging the six triplet permutations replaces their weights by their common mean, while collective-unitary covariance of the two-qubit singlet fixes the singlet projector. This is Bell twirling followed by triplet symmetrization, producing the specified two-qubit Werner state. Shared randomness coordinates the local choices, so the procedure is allowed by local operations and classical communication. Common unitaries alone would preserve the original singlet weight, which need not initially be at least ; the preceding one-party permutation is what ensures that range.
For the eigenvalue calculation, put , , and . Then . In the ordered computational basis , transposing the second subsystem givesThe block has eigenvalues and , while the other two basis vectors also have eigenvalue . Thus the partial transpose spectrum isThe last three are positive throughout the given range, so the partial transpose is not positive exactly when . A separable quantum state is a convex sum of product density operators, each still positive after transposing one factor. The negative eigenvalue therefore proves entanglement.
For completeness, separability on the other side can be proved explicitly rather than inferred solely from a theorem name. Let be the one-qubit Pauli eigenprojectors. At , the mixture of six antiparallel product states isusing . It is manifestly separable. For ,with nonnegative coefficients summing to one; is also separable. ConsequentlyAt the boundary the partial transpose has a zero eigenvalue and the explicit decomposition shows separability.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 4 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Choose the phase gateIt is unitary. Acting on both qubits leaves unchanged and multiplies by , so sends to with exactly the requested phase.
Using the Hadamard gate , chooseIt is unitary and symmetric, andFor any matrix , applying to gives the coefficient matrix . Here , henceBoth displayed transformations are exact, not merely equal up to global phase. These common local unitaries permute the triplet Bell projectors while preserving the singlet projector by the preceding determinant identity.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 4 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Pauli matrices act by , , , and . Consequently swaps with and with . The plus combinations are its eigenvectors, and the minus combinations its eigenvectors. Meanwhile is on the even-parity basis vectors and on the odd-parity ones. Thus, with the paper's labels,This verifies all four Bell states directly. The two observables commute: on each factor, so the two minus signs cancel in their tensor products. Their joint eigenvalues distinguish the four states, as used in a Bell-basis measurement.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 4 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the PDF's Bell state labels throughout this question: its is the antisymmetric spin singlet state, whereas are the even-parity states. WriteExpanding the antisymmetric combination cancels its and components and givesThe two normalized orthogonal vectors are the columns of a unitary matrix . Its determinant has modulus one because . ThereforeThis proves collective-unitary covariance of the two-qubit singlet: a common basis change alters only its global phase, and leaves its density projector unchanged.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 3 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Use the probability of failing to restore an arbitrary unknown input in the original encoded subspace as the error criterion. With no extraction fault, the bit-flip repetition code succeeds exactly on channel-error patterns of weight zero or one. Independent physical flips giveThe probability is the logical bit-flip probability for the ideal recovery. The preceding calculation shows that every occurrence of the specified internal fault leaves the code space. Independence of that fault therefore gives exact encoded-state failure with a faulty parity check:A single unencoded qubit has bit-flip error probability . Thus the encoded scheme improves this error criterion precisely whenFor , and . Rearranging givesEquality gives no improvement. At the unencoded channel is already perfect; at ideal recovery only ties it. For , the stipulated majority correction is no better even without the internal fault, and this fault cannot improve it. Hence there is no nonnegative giving a strict improvement in those ranges.
The criterion concerns restoration of every possible logical state: a logical bit flip can accidentally preserve a particular logical eigenstate, but that is not protection of an unknown input. The threshold assumes the displayed single fault location and ideal encoding, measurement and conditional correction. Adding another recovery circuit or comparing a different average-fidelity metric would define a different noise model or performance criterion.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 3 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The PDF places the extra on after that qubit has interacted with but before it interacts with . Its timing is essential. With no incoming error, the first extracted parity is zero. The fault then changes the data toThe remaining parity measurement gives on both branches. Thus the measured error syndrome is , which the rule in the preceding part interprets as an error on . Applying leavesThis is outside the original encoded subspace: neither of its supporting basis strings is or . The incorrect syndrome causes a second data error rather than restoring the input. This timed bit flip during repetition-code syndrome extraction demonstrates why a simple parity circuit need not tolerate its own faults.
The same failure can be checked for every incoming channel error. Let indicate the internal fault and let be the correction bit pattern from the table. The observed syndrome and the final pre-correction data pattern areBecause is linear over binary addition and , the residual pattern satisfiesWhenever the fault occurs, the residual syndrome is , so recovery never returns the state to the encoded subspace, even if a channel error also occurred. The diagram therefore must not be treated as an extra independent pre-extraction data flip that would always be diagnosed normally.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 3 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The first two CNOT gates encode asthe three-qubit bit-flip repetition code. In the printed detection circuit the first quantum ancilla records and the second records . Both start in . For an incoming bit-error pattern , the two logical basis branches give the same error syndromeAdding to a computational string leaves both parities unchanged, so the ancillas acquire no information about or . The joint state after extraction isThe syndrome measurement therefore preserves the unknown logical amplitudes. For zero or one bit flip the corrections areEach indicated correction squares to the identity and restores the encoded state. The order of the two ancilla labels matters: the printed first ancilla is the parity, not the parity. This is coherent syndrome extraction for the three-qubit repetition code with the circuit's specific parity choices.
For later use, an error pattern and its complement have the same syndrome. Minimum-weight recovery corrects patterns of weight zero or one. Patterns of weight two or three instead leave , the logical bit flip that exchanges the two codewords. The code protects against the stated bit-flip channel, not arbitrary single-qubit phase errors.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 2 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
An oracle can recognize a solution without disclosing it in advance. If an efficiently evaluable or black-box predicate has the promised unique marked input, write exactly for that input. A Boolean quantum oracle computes this predicate reversibly asIts diagonal projector on the search register is . To implement a selectable phase, compute into a zero quantum ancilla, apply a known phase to its component, and uncompute. The search register then undergoesThis requires evaluation access to the predicate, not classical knowledge of which input passes it. The term is known from the Hadamard transform. With Hamiltonian-oracle access, or by controlled short-time simulations of the two terms, their sum can realize continuous-time quantum search.
The unknown projector is supplied through an oracle or a physically encoded recognition rule. It cannot be manufactured for an arbitrary hidden with no such input-dependent resource. The oracle assumption and the fixed energy scale are essential when interpreting the square-root search time as a computational advantage.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 2 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For the normalized vector defining the orthogonal projection , for every . Thuswhich proves the projector phase rotation identity in this case:It changes the sign of the component along and fixes the orthogonal complement, so it is a reflection operator.
For a marked computational basis vector , is the marked-state phase oracle. With , the other reflection isThe Hadamard gates thus implement its change of basis from the known all-zero state. The usual Grover diffusion operator is . Consequently a Grover search algorithm iteration isThe minus sign is an irrelevant global phase. These two reflections rotate the search state in the span of the marked vector and the unmarked uniform vector, with the Grover rotation angle controlled by the initial marked amplitude. Iterating them approximately times gives high-probability search. The same pair of projectors appears additively in the continuous-time Hamiltonian, but the product of full reflections and evolution under their sum are distinct dynamics.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 2 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Write , which is real and satisfies for . The invariant two-dimensional span has orthonormal eigenvectorswith eigenvalues and . In this basis,Transfer therefore requires the two evolved eigenphases to differ by an odd multiple of :The first positive time isEquivalently, exponentiating on the invariant span gives the full evolutionAt this is , so the requested global phase can be chosen as modulo . Since the two vectors are linearly independent, their relative coefficient cannot produce exact transfer at an earlier positive time. This is continuous-time quantum search, with time proportional to the square root of the search-space dimension for fixed . Restoring units multiplies the stated time by . The degenerate zero-qubit case would already have , so there would be no smallest positive transfer time; the formula concerns the nontrivial search.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 2 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
The Hamiltonian operator annihilates every vector orthogonal to both of its defining states:Every positive power also annihilates that vector. The exponential series therefore givesIt is a stationary zero-energy state under this unitary time evolution. The displayed evolution uses , as in the question. For the two independent defining vectors already span the whole qubit space, so no nonzero vector satisfies both orthogonality conditions; for larger their orthogonal complement has dimension .
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 1 e Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Consider any POVM, not necessarily rank one, with two distinct reported outcomes intended to identify the two states. Its effects satisfy and ; equality holds for a two-outcome measurement. If , then positivity and completeness force . Taking a positive square root gives . Likewise, and imply , or .
Using Hermiticity,Thus perfect discrimination of pure states requires orthogonality, contradicting the proposed nonzero overlap. This proves perfect discrimination of pure states requires orthogonality for arbitrary generalized measurements. Measurements with an inconclusive outcome can sometimes identify nonorthogonal inputs unambiguously, but unambiguous quantum state discrimination has a nonzero failure probability and is not perfect deterministic discrimination.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 1 d Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
For one fixed POVM repeated on independently prepared copies, the Born rule gives outcome probabilities with one normalization constraint. An arbitrary mixed qubit density operator has three independent real parameters,The probability map is affine in . It can be injective on the full Bloch ball only if . If its rank is smaller, a nonzero undetected direction gives two nearby physical Bloch vectors with the same probabilities. Hence for an informationally complete POVM.
To attain this bound, take the four directionsThey are the vertices of a regular tetrahedron. The tetrahedral qubit POVM has effects , each positive and rank one, and . The observed probabilities areSince and , they recover the state byThis is the minimum for a single fixed measurement family. If the wording permits changing measurement settings between groups of copies, three binary projective measurements of the three Pauli observables also suffice, each with . That procedure is informationally complete three-observable qubit tomography, and it does not contradict the four-outcome bound for one fixed POVM. Tomography estimates probabilities statistically from many copies; a finite sample does not determine an arbitrary continuous state exactly.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 1 c Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
A centre turns position into a displacement . If are a basis of the -dimensional vector space, every position has unique coordinatesThus linearly independent vectors are necessary and sufficient. Fewer vectors span a proper subspace and cannot represent arbitrary displacements. The coordinates use the field defining the space. For qubit tomography, the relevant parameter space is the real three-dimensional space of Bloch vectors, rather than the complex two-dimensional space of state amplitudes.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 1 b Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Normalize the vector defining the first effect and write . Since the two effects sum to , the eigenvalues of are along and on its orthogonal complement. For to have rank one, . Hence this binary rank-one qubit POVM is a projective measurement:The two Bloch vectors are antipodal on the Bloch sphere; the corresponding state vectors are orthogonal. The plot below chooses one representative unit vector. Rotating both directions gives every other case. The sphere represents the effect projectors' Bloch directions, rather than plotting their matrix entries.
Past exam of the mathematics course of the University of Cambridge 2007 iii Paper 58 1 a Solution by
Codex 0 Created 2026-10-03 Updated 2026-10-14
Let be another complete orthonormal basis, and write . Orthonormality makes a unitary matrix, so . ThereforeThus the resolution of the identity is independent of the orthonormal basis. Equivalently, expanding any vector in the new complete basis shows that the sum of its orthogonal projections returns that vector.
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






