An entangling gate is a unitary transformation on two quantum systems for which at least one pure product input has an entangled output:
It need not create quantum entanglement on every product state. For example, the controlled-NOT gate leaves a product state but maps to a Bell state, so it is an entangling gate.
A bipartite pure state is entangled exactly when it is not a product state: there are no normalized quantum states such that
Equivalently, its Schmidt rank exceeds one, or either reduced density matrix is a mixed state. This definition concerns quantum entanglement across the specified division into systems and .
We prove the one-query constancy obstruction for phase oracles while allowing arbitrary quantum ancillas. By purification of a density operator, the quantum state immediately before the sole query can be taken as
The ancilla vectors need not be normalized or orthogonal. Classical randomness and earlier quantum measurements can be included in additional ancillas; allowing access to these systems only gives the proposed algorithm more power.
For the zero constant function, the phase oracle is , leaving unchanged. For each , consider the Boolean function that is one at and zero elsewhere. Since , it is nonconstant, and its phase oracle produces
Any later fixed unitary transformation preserves these inner products. An arbitrary final quantum measurement cannot distinguish the constant output from each nonconstant output with certainty unless they are orthogonal, by perfect discrimination of pure states requires orthogonality. Explicitly, an accepting POVM effect would satisfy and , forcing .
Therefore exact classification requires for every . Summing gives
which contradicts . Thus one query cannot decide constancy with certainty. The other constant function gives , differing only by a global phase, so it does not change the argument. For comparison, permits ; the impossibility arises from demanding the test work for every nonconstant Boolean function.
Use three-way qutrit sign-flip discrimination. Prepare the qutrit in the uniform superposition state
For an unknown label , the supplied unitary operator is . Apply it once and then apply the known inversion about the mean
Since and , this is an allowed unitary transformation. Using gives
Perform a computational-basis measurement and guess that its outcome is the unknown label. The Born rule gives
Each incorrect outcome has probability , verifying normalization. The success probability is separately for every label, so no assumption about their prior probabilities is needed.
In the ordered computational basis , the Pauli X gate, Pauli Y gate, Pauli Z gate, Hadamard gate and T gate are
In the ordered two-qubit computational basis , with the first qubit controlling the second, the controlled-NOT gate is
Here the T gate uses the conventional representative with first diagonal entry one; another common representative differs only by a global phase.
Use deterministic two-qubit entanglement dilution, retaining the specified complex probability amplitudes. Alice implements a quantum instrument on with Kraus operators
The Kraus representation completeness condition holds even for complex :
To realize this using the permitted quantum gates and a basic measurement, Alice initializes an ancilla qubit to . Conditional on her computational-basis state being , she applies to the unitary matrix
Each has orthonormal columns. Therefore is a unitary gate, with
A computational-basis measurement of implements the desired quantum instrument. Its two unnormalized branches on are
Each has probability . Alice sends her outcome as one classical bit. For , both parties keep their qubits unchanged. For , both apply a Pauli X gate, giving
Thus both outcomes produce the exact target using one classical bit and local operations. The construction includes or and arbitrary relative quantum phases; it requires no quantum channel between the parties.

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