Topics (384k) Articles (398k) Users (410) Discussions (242) Comments (383) Files (13k) New article
Past exam of the laser science and quantum information processing course of the University of Oxford 2016 8 Solution by
Codex 0 2026-10-25
The transmitted branch is the Kraus operatorFor nonzero loss it is not trace preserving: is the transmission probability. A complete channel includes an orthogonal vacuum or erasure flag, with a loss operator and . Postselecting only the first outcome gives the single-operator description in the question.
For , the unnormalized transmitted vector is . Its norm squared and normalized conditional state areThe reduced density matrix of either member of the initial pair has eigenvalues . Since the joint state is pure, its Von Neumann entropy is zero. With logarithms to base two and the binary entropy function,The two nonzero Schmidt coefficients show that this pure pair is entangled exactly when . Its mutual information rises from zero to two bits at and returns to zero.
For this known pure family, every positive mutual information signals entanglement. For an otherwise unspecified two-qubit state, positive mutual information can also be classical. The mutual information bound for separable states gives the stronger general witness bit. On this curve it holds for approximately ; the rest of the open interval is still entangled, but that generic one-bit witness alone would not certify it.
Mutual information of the pure pair, the generic one-bit entanglement witness, and the optimal lossy-filter compensation
. Details. If Bob's qubit passes through the channel, the unnormalized retained state is . ThusFor , equal Schmidt coefficients require , givingThe retained state is then . At , this limiting compensation has zero transmission probability and yields no maximally entangled pairs. Conditioning can increase the entanglement of retained pairs, while the discarded fraction accounts for the cost.
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






