Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the introduction to representation theory course of the University of Oxford 2023 1 b Solution by
Codex 0 2026-10-25
Since is a nonzero associative algebra of finite dimension, it has a nonzero left ideal of least positive dimension. Such a minimal left ideal is a simple module under left multiplication.
For , right multiplication defines the module homomorphismIts kernel is a submodule of , so its image is either zero or a simple module isomorphic to . Each is a left ideal, since .
ConsiderIt is a left ideal. It is also stable under right multiplication, because , so it is a two-sided ideal. Moreover , giving . The assumption that is a simple ring therefore forces .
Only finitely many summands are needed: express each member of a finite basis of as a finite sum of elements of the , and collect the finitely many indices used. After discarding zero summands, is a finite sum of simple modules. Part (a)(ii) makes its left regular module a semisimple module. This is exactly the definition of a semisimple algebra, proving that a finite-dimensional simple algebra is semisimple. The finite dimension assumption is essential to this assertion about a simple ring.
Past exam of the introduction to quantum information course of the University of Oxford 2021 3 e Solution by
Codex 0 2026-10-25
With the basis known, choose a unitary operator that interchanges its two basis states. On the Bloch sphere this is a rotation by about an axis perpendicular to , sending to . Follow it by , which is completely positive. ThenThus can be converted to using the allowed operations and a suitable physically available depolarizing parameter.
The reverse direction would have to increase Bloch radius from to . Unitaries preserve radius, and every completely positive has , so any composition of the allowed operations cannot increase it. Hence still cannot be converted to using these resources. This conclusion uses the stated unitary/depolarizing resources; an unrestricted state-preparation channel would be a different allowance.
Past exam of the introduction to quantum information course of the University of Oxford 2021 3 d Solution by
Codex 0 2026-10-25
Write the unknown common eigenbasis as an unknown unit Bloch vector . Then has vector , while has vector . A single deterministic channel working for every possible basis must therefore map to for every unit .
By the basis-independent conversion of qubit Bloch radii, linearity forces that channel to be . Explicitly, add the conditions for and to get , then use the three coordinate directions to fix its action on every Pauli matrix. But , so part iv excludes complete positivity. Thus the forward conversion cannot be implemented reliably without knowing the basis.
The reverse conversion would require , which is not even positive by part ii. Therefore the reverse conversion is also impossible. Unitary operations interspersed with physically allowed depolarizing maps cannot evade these restrictions: their composition remains a physical quantum channel. The question concerns one basis-independent operation on the supplied qubit, not an additional resource of many copies for learning its basis.
Past exam of the introduction to quantum information course of the University of Oxford 2021 3 b Solution by
Codex 0 2026-10-25
No: the advertised pure joint state is incompatible with these marginals. Their eigenvalue multisets are and , which differ. Part a shows that a bipartite pure state must give the same nonzero Schmidt spectrum on both sides.
This excludes Eve's purity claim, not every possible joint state or every possibility of entanglement. A mixed state can have unequal marginal spectra; the product , for example, has exactly the stated marginals.
Past exam of the introduction to quantum information course of the University of Oxford 2021 3 a Solution by
Codex 0 2026-10-25
The partial trace removes the other orthonormal factor in the Schmidt decomposition:For instance, tracing over gives , which vanishes unless . Consequently the nonzero eigenvalues of the two reduced density operators agree, with multiplicity. If the subsystem dimensions differ, the orthonormal Schmidt families can be completed to full bases and the extra eigenvalues are zero.
Past exam of the introduction to quantum information course of the University of Oxford 2021 2 f Solution by
Codex 0 2026-10-25
No. The independent-setting assumption can fail if Eve controls the random-number generators. Her hidden information can then include the settings that will be selected, and the outcome assignment can depend on that information. For each known setting pair she can prearrange its one tested winning relation, without having to satisfy all four counterfactual relations at once.
For example, arrange equal outputs for the first three setting pairs and opposite outputs for the fourth, conditioning the programmed outputs on the known pair. This can give success one with predetermined records. It does not contradict the proof, which assumes the same hidden-assignment distribution for every independently selected pair. This is the measurement-independence loophole, so the claimed security conclusion is not established by such a compromised test.
Past exam of the introduction to quantum information course of the University of Oxford 2021 2 e Solution by
Codex 0 2026-10-25
For predetermined outcomes, the four products multiply to one:The four desired signs are , whose product is minus one. Thus at least one winning condition must fail for every deterministic assignment. Uniform independent settings give success at most per assignment, and averaging over hidden assignments preserves the bound.
An observed rate near , with enough trials to exclude statistical fluctuation, therefore contradicts Eve's predetermined-local-outcome claim, provided the settings are independent of her devices and the devices cannot communicate during a run. It violates the local bound of the CHSH inequality while remaining consistent with the quantum optimum .
The observation is not by itself exact certification of a perfect two-qubit state. Maximal quantum CHSH correlations support CHSH self-testing only with the appropriate quantum/locality assumptions and up to local changes of representation and unused ancillary systems; a near-maximal finite data set requires a quantitative error analysis. An unrestricted communicating pair of black boxes can instead win every run, so the quantum bound is not a bound on arbitrary devices without these assumptions.
Past exam of the introduction to quantum information course of the University of Oxford 2021 2 d Solution by
Codex 0 2026-10-25
The first three angle differences have cosine , while the fourth has cosine . The first three winning conditions require agreement and the fourth requires disagreement. Each consequently succeeds with the same probabilityUniform independent selection of the four setting pairs gives this same average. Equivalently the CHSH inequality expression is , attaining the CHSH Tsirelson bound.
Past exam of the introduction to quantum information course of the University of Oxford 2021 2 c Solution by
Codex 0 2026-10-25
The matrices are real symmetric, , and . Part b therefore givesSince the local measurement outcomes are , their product is one exactly on agreement. Thus , and
Past exam of the introduction to quantum information course of the University of Oxford 2021 2 b Solution by
Codex 0 2026-10-25
Expand the Bell state in the standard basis:The transpose is not an adjoint: the formula is complex-linear in both operators. The equality follows since .
Past exam of the introduction to quantum information course of the University of Oxford 2021 2 a Solution by
Codex 0 2026-10-25
Each local reduced density operator of the Bell state is . Alice's unrecorded local measurement leaves Bob's reduced state unchanged: he still sees a fair random bit. Only after learning her outcome through a classical channel can he identify the corresponding conditional state. Alice cannot choose the random outcome to encode a bit, so the correlations obey the no-signalling theorem.
If the shared state is the trusted pure Bell state, measuring both sides in the basis gives identical, uniformly random raw bits. A pure joint state of Alice and Bob has no correlations with an external system, so these bits can form a shared secret. In an actual quantum key distribution protocol, the parties must verify the necessary state/device assumptions and authenticate their classical communication; correlation alone, without a security test, does not certify secrecy against an untrusted source.
Past exam of the introduction to quantum information course of the University of Oxford 2021 1 f Solution by
Codex 0 2026-10-25
Write and . After the controlled-NOT gate, the joint state isAn ancilla measurement outcome zero leaves the unnormalized data state . Outcome one leaves . Both outcomes have probability . The correction for outcome one is , and , so after correction the data is always , up to an irrelevant global phase. This proves magic-state injection of a T gate.
The resource state's Bloch vector is , outside the stabilizer octahedron. Clifford gates alone preserve stabilizer structure and, with standard-basis preparation and measurement, admit efficient classical simulation by the Gottesman--Knill theorem. Adding the non-Clifford T gate supplies a universal quantum gate set together with Clifford gates: arbitrary finite-qubit unitaries can be approximated to arbitrary precision. The assertion is approximate universality, not exact representation of every unitary by a finite circuit.
Past exam of the introduction to quantum information course of the University of Oxford 2021 1 e Solution by
Codex 0 2026-10-25
While the sequence is remembered, the conditional quantum state is the known pure endpoint , so its Bloch vector is one of the six Pauli vertices. Partial forgetting leaves a probability distribution over possible endpoints, givingHence the vector lies in the stabilizer octahedron. The mixing describes lost classical information, not a different unitary evolution of the physical qubit.
Under complete unbiased uncertainty over the six endpoints, , the opposite vectors cancel andThis is the maximally mixed state at the center. Mere loss of the particular sequence does not mathematically force uniform probabilities: a known biased distribution of endpoint states would leave its corresponding noncentral mixture. The central conclusion uses the unbiased randomization implicit in complete forgetting in this setting.
Past exam of the introduction to quantum information course of the University of Oxford 2021 1 d Solution by
Codex 0 2026-10-25
Direct matrix multiplication givesThus each generating Clifford gate conjugates every Pauli operator to another Pauli operator up to sign. Repeated conjugation proves the same for every product of generators and their inverses, hence for the Clifford group. For Hermitian Pauli observables the possible phases here are signs; arbitrary Pauli-group elements also include their conventional phases.
If , then . Therefore is another Pauli eigenstate. Every single-qubit Clifford circuit consequently permutes the six Pauli vertices of the stabilizer octahedron.
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





