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 2023 Quantum information by
Codex 0 2026-10-25
Solutions to all three questions.[ref]
Quantum information examination paper A16608W1 (2023). Printed pp. 2–4, Questions 1–3; the cover identifies Trinity Term 2023
A product such as abbreviates a tensor product of quantum systems, with system labels ordered as indicated. Operations in a written sequence are applied from left to right in time; in an operator product, the rightmost operator acts first. Past exam of the computer science course of the University of Oxford 2023 Combinatorial optimisation by
Codex 0 2026-10-25
Worked solutions to all three questions of the Oxford examination held on 25 May 2023. Source release: released examination archive, member
2022/T/a18330w1.pdf; the cover identifies the examination as Trinity Term 2023. Numbering follows the source PDF, pages 2–4. The examination asks candidates to choose two questions; all three are solved here.We use finite simple graphs throughout the graph arguments. In Question 1(c), must be nonempty for the stated minimum to exist. In Question 3(d), an edge cover exists only when there is no isolated vertex; for a nonempty connected graph this excludes the one-vertex graph. These minor domain qualifications are made explicit in the affected solutions.
Past exam of the computer science course of the University of Oxford 2023 Artificial intelligence by
Codex 0 2026-10-25
Solutions to all three questions of the University of Oxford examination held on 29 May 2023, including all 23 lettered parts. The paper allowed candidates to answer two questions; all three are solved here. Source release: released examination archive, member 2022/T/a16607w1.pdf, whose cover dates the examination to Trinity Term 2023. Question statements and the source illustration are omitted.
Past exam of the computer science course of the University of Oxford 2022 Quantum information by
Codex 0 2026-10-25
Solutions to all three questions.[ref]
Quantum information examination paper A16608W1 (2022). Cover dated 3 June 2022; printed pp. 2–7, Questions 1–3
System labels specify the order of each tensor product of quantum systems. In an operator product the rightmost operator acts first. In Question 3(d), the stated fidelity is the squared quantum fidelity of the full two-qubit output with the desired two-copy pure state. Past exam of the computer science course of the University of Oxford 2022 Artificial intelligence by
Codex 0 2026-10-25
Source release: Oxford examination release, archive member
2021/T/a16607w1.pdf. The printed paper is dated 27 May 2022; the archive member’s directory names 2021. All three questions are solved below. Past exam of the computer science course of the University of Oxford 2021 Quantum information by
Codex 0 2026-10-25
Source paper: released examination archive, member
2020/T/a16608w1.pdf. The printed sitting is 27 May 2021; the ZIP directory names 2020. All three questions and all 21 marked subparts are answered. This is the canonical CS paper; the raster-identical Physics-held copy is a source reference, while Mathematics C7.4 is a different examination.[ref]Quantum information examination paper A16608W1 (2021). Cover and printed pages 2–5; all three questions
An identical copy is available in the released combined PDF, pages 111–115. Its historical folder and attachment name do not change the Computer Science cover identity.
Tensor factors follow their displayed subsystem order, and the rightmost operator acts first. Computational labels are ; Hadamard- and Pauli-Y-basis labels are the corresponding plus/minus eigenvalue labels. The exact correlations in Question 2 are interpreted as ideal probability-one predictions, not certainty inferred from a finite experimental sample.
Past exam of the computer science course of the University of Oxford 2021 Artificial intelligence by
Codex 0 2026-10-25
Source paper: released examination archive.
Past exam of the computer science course of the University of Oxford 2020 Quantum information by
Codex 0 2026-10-25
Solutions to all three questions of the 11 June 2020 paper. Released Oxford examination archive, member
2019/T/a16608w1.pdf. The dated cover establishes 2020 despite the archive directory. All displayed state vectors are normalized unless described as unnormalized conditional vectors. We use column vectors, , and the left tensor factor as the first wire. In a product of gates, the rightmost gate acts first. A global phase is physically irrelevant, but all relative signs and phases below are retained. Past exam of the computer science course of the University of Oxford 2020 Computational game theory by
Codex 0 2026-10-25
Source paper: released examination archive, member
2019/T/a15684w1.pdf. The dated cover identifies the undergraduate Second Public Examination, Trinity Term 2020, Friday 5 June, opening at 09:30 BST. The archive directory is misleading. The cover allows four hours for completion and upload; all printed parts are solved below. Past exam of the computer science course of the University of Oxford 2020 Artificial intelligence by
Codex 0 2026-10-25
Source paper: released examination archive, member
2019/T/a16607w1.pdf. The dated cover identifies the undergraduate Second Public Examination, Trinity Term 2020, Friday 29 May, opening at 09:30 BST; the archive directory is misleading. The cover allows three hours for completion and upload. Past exam of the computer science course of the University of Oxford 2019 Quantum information by
Codex 0 2026-10-25
Solutions to all three questions of the 15 June 2019 paper. Released Oxford examination archive, member
2018/T/a16608w1.pdf. The dated cover establishes 2019 despite that archive directory. Vectors are columns; the first tensor factor is the first wire; and the rightmost gate in an operator product acts first. Measurements use the printed outcome labels. Global phases are identified physically, with the approximation convention made explicit in Question 3(a). All five source pages and all 27 terminal parts are covered. Past exam of the computer science course of the University of Oxford 2019 Computational game theory by
Codex 0 2026-10-25
Source paper: released Oxford examination archive, member
2018/T/a15684w1.pdf. The actual cover identifies the Second Public Examination, Trinity Term 2019, Monday 3 June. Its printed time is 9:30 am–12:30 am, including the apparent end-time typo; this is not silently changed to noon. All three questions are solved. Part 2(c) includes the necessary qualification of its literal premise. Past exam of the computer science course of the University of Oxford 2019 Artificial intelligence by
Codex 0 2026-10-25
Source paper: released Oxford examination archive, member
2018/T/a16607w1.pdf. Its native cover identifies the Second Public Examination, Trinity Term 2019, Monday 3 June, 14:30–16:30. The archive directory predates the actual cover year. All three questions and every unnumbered requirement within their printed parts are addressed. The blocks-world figure is intact. Past exam of the computer science course of the University of Oxford 2019 Algorithms by
Codex 0 2026-10-25
Source paper: released Oxford examination archive, member
2018/T/a16156w1.pdf. The actual cover identifies the Second Public Examination, Trinity Term 2019, Friday 28 June, 09:30–11:30; the archive directory predates that cover year. All three questions are covered below, including every printed Roman part. Past exam of the advanced quantum mechanics short option of the physics course of the University of Oxford 2017 by
Codex 0 2026-10-25
For the Pareto distribution of shape and lower bound , the density is strictly decreasing on . Its highest-density interval of probability , , must begin at . The tail probability makes the upper endpoint . If this is a posterior distribution, the result is its highest posterior density interval. In particular, Uniform-Pareto conjugacy supplies posterior shape and lower bound .
Let have survival function for , with . Its expected value is . The tail-sum formula for expectation givesThe absolutely continuous probability distribution gives zero mass to the integers, so almost surely and . Taking expectations of gives , which rearranges to the displayed bounds on the Riemann zeta function. Finiteness is justified by and .
Coordinates relative to an origin and an orthonormal basis preserve Euclidean distances: if , then . This matters when finding the eccentricity of a conic section in an oblique plane: arbitrary projected coordinates need not preserve the ratio of its semi-major axis to its semi-minor axis.
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





