Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the computer science course of the University of Oxford 2021 Quantum information 2 b ii Solution by
Codex 0 2026-10-25
No: is not an entangling gate. Its factorization gives, for every product input,which remains a product state. More generally, a convex mixture of product density matrices remains separable under these local unitary operators. Thus being distinguishable from does not require creating entanglement. The first qubit undergoes a genuine local phase gate, while the target undergoes the same in both branches.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 2 b i Solution by
Codex 0 2026-10-25
Put . Factoring the target operator giveswhereas . Their difference is a relative phase on the first qubit, not one overall global phase.
For an explicit witness, choose the product input , with any normalized . The first-qubit outputs are respectively and . A Hadamard basis measurement returns with probabilitiesThese differ because is not a multiple of . The two unitary operators implement different quantum channels. The global phase of the conditional target operation has become a physically observable phase on its control.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 2 a ii Solution by
Codex 0 2026-10-25
The displayed computational basis expansion is already a Schmidt decomposition, with coefficients and . For both are nonzero, so the Schmidt rank is two. A pure product state has Schmidt rank one. The state is therefore entangled throughout the specified open interval.
Equivalently, the reduced density matrix isThe reduced state is a mixed state, which is impossible for one factor of a pure product state. At the excluded endpoints the Schmidt rank drops to one, giving or .
Past exam of the computer science course of the University of Oxford 2021 Quantum information 2 a i Solution by
Codex 0 2026-10-25
Factor the sum before making an entanglement claim:The state is not entangled: it is a product state. A sum written with several tensor-product terms need not be entangled; those terms may combine into a single tensor product.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 1 c iv Solution by
Codex 0 2026-10-25
Alice cannot send a bit to Charlie either. An argument based only on the apparent chronological chain would be insufficient: Alice interacts with Bob before Bob interacts with Charlie. The extra fact is that these particular gates commute.
In Bob's computational basis the complete gate isBoth controlled-NOT gates preserve Bob's control label, and their target operations act on different systems. Thus . We may consequently regard Bob–Charlie as the first interaction and Bob–Alice as the last one. The final operation on cannot change Charlie's reduced density matrix, and Charlie's earlier state cannot depend on Alice's initially separate preparation.
The target no-signalling in a common-control unitary formula makes the independence explicit:Alice's density matrix does not appear. The formula includes arbitrary complex initial amplitudes and every final measurement on Charlie. This conclusion uses the specified pair of gates; a general intervening operation on Bob could change the communication possibilities.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 1 c iii Solution by
Codex 0 2026-10-25
Charlie cannot send a bit to Alice with the stated preparation, fixed interaction and final local measurements. Write and , so the complete gate is with the rightmost gate acting first. Alice has finished interacting before the gate involving Charlie acts.
For arbitrary product input density matrices, put . The final reduced density matrix of Alice isThe equality follows because a unitary operator on the traced-out systems leaves the partial trace unchanged. The right-hand side is independent of Charlie's preparation. Therefore every outcome probability of every local measurement by Alice is independent of Charlie's message. Quantum no-signalling applies after Alice's last interaction, even though phase kickback can allow communication between the two qubits of an individual CNOT gate.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 1 c ii Solution by
Codex 0 2026-10-25
Reverse communication is also possible. Prepare Alice in . Bob encodes as and as . Since , phase kickback giveswhere and . Alice measures in the Hadamard basis: means zero and means one, deterministically.
The target's Pauli X gate eigenvalue becomes a relative phase on the control. This is the operational content of CNOT control reversal in the Hadamard basis; the computational basis control arrow alone does not determine every possible direction of communication.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 1 c i Solution by
Codex 0 2026-10-25
Prepare Bob in and encode the bit using Alice's preparation . The controlled-NOT gate givesBob measures in the computational basis and reads with probability one. Alice's final measurement is unnecessary. The interaction transmits a classical bit; it does not clone an arbitrary unknown qubit.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 1 b ii Solution by
Codex 0 2026-10-25
Identification is stronger than quantum state exclusion. Here an outcome only needs to rule out its associated preparation. Use the following orthonormal basis for a basic measurementIts defining overlaps satisfy for . By the Born rule, observing makes preparation impossible. Measure in this basis and send its outcome label ; the prize is guaranteed.
For completeness, the conditional probability matrix, with rows and columns the prepared-state label , isEvery column sums to one and the diagonal vanishes. Each result leaves two possible preparations, so this projective state exclusion does not contradict the impossibility of perfect identification. The family consists of antidistinguishable quantum states.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 1 b i Solution by
Codex 0 2026-10-25
No. Perfect discrimination of pure states requires orthogonality, whereasTo see the obstruction directly for a basic measurement, let be its orthonormal basis. Certain identification would require disjoint sets of possible outcome labels for two different preparations. For every , at least one of and would therefore vanish. Completeness would then givecontradicting the computed overlap. Failure to distinguish just this pair already rules out certain identification of the three-state family.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 1 a ii Solution by
Codex 0 2026-10-25
For the Hadamard basis, . The Born rule givesWriting the two computational basis amplitudes as , normalization gives , and . HenceThese probabilities sum to one. The cross term is interference between probability amplitudes, so the probabilities cannot be obtained by treating the input as an incoherent mixture of the computational basis alternatives.
Past exam of the computer science course of the University of Oxford 2021 Quantum information 1 a i Solution by
Codex 0 2026-10-25
In an orthonormal computational basis, the squared norm is the sum of the squared moduli of the coefficients:Thus the vector is normalized and represents a pure state of a qubit. The imaginary part contributes positively to the squared modulus; squaring the coefficient without complex conjugation would give the wrong norm.
Past exam of the computer science course of the University of Oxford 2020 Quantum information 3 b iii Solution by
Codex 0 2026-10-25
For the marked subset, by the same summation of the individual inner products. ConsequentlyThe cardinality is here. Its sign will reverse when this expression is used for the oracle's negative marked component.
Past exam of the computer science course of the University of Oxford 2020 Quantum information 3 b ii Solution by
Codex 0 2026-10-25
Past exam of the computer science course of the University of Oxford 2020 Quantum information 3 b i Solution by
Codex 0 2026-10-25
By orthonormality of the computational basis,There is one nonzero term, the term with . In particular, the uniform coefficient is unchanged when passing from the ket to its bra because it is real.
Past exam of the computer science course of the University of Oxford 2020 Quantum information 2 d iv Solution by
Codex 0 2026-10-25
A local unitary transformation preserves a product factorization:The output is therefore another product state. If an entangled state could be locally mapped to a product state, applying the inverse would make the original entangled state a product as well, a contradiction. Hence a product state and an entangled state are never local-unitary equivalent.
In terms of a tensor-product coefficient matrix, changes to , with an ordinary transpose on the second factor. Both multiplying matrices are invertible, so the matrix rank, equivalently the Schmidt rank, is unchanged. This supplies an algebraic form of the same argument: a nonzero pure state is a product state exactly when that rank is one.
Past exam of the computer science course of the University of Oxford 2020 Quantum information 2 d iii Solution by
Codex 0 2026-10-25
Extend the normalized vector to an orthonormal basis with , and extend to an orthonormal basis with . The Gram-Schmidt process provides such extensions. DefineThen and , so is unitary and . Construct on the second subsystem in the same way, sending to . ConsequentlyThus any two normalized product states on the same pair of subsystem spaces are local-unitary equivalent. The dimension and normalization requirements matter because a unitary preserves both its domain and vector norms.
Past exam of the computer science course of the University of Oxford 2020 Quantum information 2 d ii Solution by
Codex 0 2026-10-25
Use and the Pauli X gate. Starting with the Bell state , the exact constructions areFor the first, changes the two terms to and , and multiplies just the second term by . For the second,All factors are single-party unitary operators, proving both claimed local-unitary equivalences. The equations hold as vectors, without even an additional global phase.
Past exam of the computer science course of the University of Oxford 2020 Quantum information 2 d i Solution by
Codex 0 2026-10-25
For symmetry, if , apply the inverse local unitary transformation:The conjugate transposes of unitary operators are unitary, so the reverse relation holds.
For transitivity, if additionally , the tensor product multiplication rule givesBoth products are unitary, for example . Thus local-unitary equivalence is reflexive, symmetric and transitive, and hence is an equivalence relation.
Past exam of the computer science course of the University of Oxford 2020 Quantum information 2 b iii Solution by
Codex 0 2026-10-25
The corresponding conditional vectors are and . The second has a nonzero component while the first does not, so they are linearly independent. Therefore the third state is also entangled. Orthogonality of these two conditional vectors is not required for this conclusion.
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





