The algorithm returns a uniformly random marked input with certainty. The Born rule applied to the final state gives, for each individual basis label ,
Summing over the marked inputs gives . The outcome is a marked input label, not merely the bit indicating whether some marked input exists. There is one use of the supplied phase oracle, together with the specified preparation, reflection and measurement.
The exact success relies on the marked fraction . More generally, the mean amplitude immediately after the oracle is . Inversion about the mean sends an unmarked amplitude to and a marked amplitude to . Thus a single iteration has marked success probability . At the unmarked amplitudes vanish and the marked amplitudes become , giving the one-step exact Grover search with a quarter of the inputs marked. No claim of one-query certainty for an arbitrary marked fraction is needed.
Figure 1.
Original amplitude and Born-probability illustration for eight inputs with two marked. The oracle's relative minus signs become exact concentration on the marked inputs after one reflection.
Details.
Apply parts (b)(ii) and (b)(iii), keeping the oracle's minus sign:
The middle equality uses part (a), and the last uses . The final squared norm is , providing a normalization check.
The sign convention matters: here fixes and negates its orthogonal complement. Its action on amplitudes is inversion about the mean. The negative of this reflection would change the final vector by an overall global phase, but mixing those conventions midway would give incorrect intermediate signs.[ref]
The phase oracle multiplies an unmarked basis vector by and a marked one by . Thus the state after the oracle is
Its squared norm is . All computational outcomes would still have probability if measured at this point: the oracle has changed the relative phase, not the magnitudes of the amplitudes. The following reflection converts that phase information into a changed probability distribution through quantum interference.
Substitute the promised cardinalities:
The marked and unmarked subsets also exhaust the computational basis, so ; this will ensure that the uniform initial state has unit norm.
Measure the first qutrit in the computational basis and the second in the orthonormal basis from Question 1(a), with those labels as outcomes. For first-party outcome 0, the unnormalized conditional vector of the second party is , so this outcome occurs with probability and leaves the normalized state .
The second-party Born rule probabilities are then , , and . Hence
The relevant joint probabilities are , each divided by . This distinguishes the conditional statement from an unconditional outcome probability. More generally, conjugate-state steering from a maximally entangled pair explains how the first local measurement determines the second party's conditional vector; the basis choice here makes that vector especially simple.
Write the product state as . The two partial inner products are
Both vectors therefore lie in the same one-dimensional vector subspace, possibly with one or both equal to zero. If , choose and ; then , and the multipliers are not both zero. If both vanish, choose .
Thus the conditional vectors are linearly dependent, with a nontrivial pair of multipliers in every case. The printed existential condition does not explicitly exclude , which would make it vacuous for arbitrary vectors; the argument establishes the stronger intended statement. These unnormalized vectors need not themselves be valid unit state vectors, and a zero vector corresponds to a measurement outcome of probability zero. This is the forward direction of the conditional-vector product-state criterion.

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!
We have two killer features:
  1. 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-calculus
    Articles 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/derivative
  2. 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.
    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.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
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