Taking partial inner products with and on the first wire gives and . They are nonzero and orthogonal, hence linearly independent. This contradicts the necessary product-state property proved in part (a), so the second state is entangled.
Equivalently, its tensor-product coefficient matrix is , with . The two-qubit product-state determinant criterion gives the same conclusion. In fact , so its Schmidt coefficients are both : it is maximally entangled.
Factor the coefficients:
Therefore the first state is a product state, not entangled. Both factors have unit norm, so this factorization also checks normalization.
Now . The gates and CNOT are Clifford gates: conjugating a Pauli matrix or a tensor product of them gives another signed Pauli tensor. On one wire,
For CNOT the generator images are , , , and . These identities can be checked on the four computational vectors and generate the preservation property for all Pauli tensors.[ref]
For a fixed number of wires there are only finitely many possible images of the generators in the Pauli group. Their images determine a unitary up to global phase. To see this, if two unitary operators induce identical images, their quotient commutes with every , so is diagonal in the computational basis; commuting with every then forces all diagonal entries to be equal. The quotient is a scalar phase. Thus the generated gates form a finite set modulo global phase, which cannot be dense in the continuous space of all unitary operators. This is finiteness of the projective Clifford group.
A small visible consequence is that from , one-qubit Clifford circuits reach only the six states up to global phase. For instance, is outside this finite set. The fixed- Pauli argument also covers circuits using CNOT on several wires. Therefore is not universal.
Here . Both remaining gates fix the all-zero computational vector: the T gate fixes , and the controlled-NOT gate fixes . Therefore every finite circuit, on any number of initially zero wires, leaves unchanged.
It cannot even approximate , whose squared overlap with that unchanged vector is . Thus the gate set is not universal. The needed quantum superposition cannot be created from this input by basis permutations and diagonal phases alone.
The controlled-NOT gate is its own inverse, so . Every remaining nontrivial gate acts on one wire. By the tensor product rule, any circuit on a product input stays a product state; in particular, starting at it cannot produce a Bell state.
This also prevents arbitrary approximation, not merely exact preparation. For normalized single-qubit vectors ,
by the Cauchy-Schwarz inequality. Hence the quantum fidelity with is bounded away from one for every reachable state. This gate set is not universal. The obstruction is preservation of product states, a special case of the existing product-state obstruction to SWAP universality.
Let . Since the Hadamard gate maps the standard basis to , the given gate is . Because ,
Next, use on the target wire of the Controlled-Z gate:
The control-zero block remains the identity, and the control-one block becomes , proving the identity with the stated control convention. We have therefore constructed each gate in the assumed universal quantum gate set using only .
Replacing every gate of a circuit by its displayed finite construction reproduces that circuit exactly. Thus is universal under the usual arbitrary-accuracy convention: it can perform every approximation obtainable from the given universal set. The claim concerns approximation of arbitrary unitary operators; it does not assert that finitely many circuits exactly represent an uncountable continuum of gates. This is universality transfer by exact gate synthesis.
Compute the parity into the second wire, phase that wire with the T gate, then uncompute with the same controlled-NOT gate. The answer is
For computational bits , the successive states are . The parity is one precisely on the two odd-parity inputs. Thus, in the ordered computational basis , the matrix is exactly , with no omitted overall phase. This is a two-qubit parity phase gate.
Directly applying the Hadamard gate gives
while
Hence the two states are interchanged up to the displayed global phases. Their relative factors and are retained. They are the two Pauli eigenstates of the Pauli Y gate, and the Hadamard interchange of Y eigenstates is consistent with .
Choose
Orthonormality makes this a unit vector. Its probability amplitudes in the given measurement basis are , so the required probabilities are .
Choose . Its inner products with the three measurement vectors are , so the Born rule gives certainty for the outcome labelled 2 and zero probability for the other two outcomes. This uses the measurement basis, rather than assuming that its label 2 means the initial state must be the computational vector .
Choose . Since , the probability amplitudes in the measurement basis are . Their squared moduli give by the Born rule.
Squaring the diagonal gate gives
Thus the T gate is available up to a global phase. Reading the supplied W columns in order , it sends to , to , and fixes the other two vectors: it is CNOT with the second wire controlling the first. Conjugating both wires by the Hadamard gate reverses that orientation:
For instance, write . Conjugation uses and , , yielding . Expanding the first-wire Z eigenspaces gives , as required.
We have H directly and finite constructions of CNOT and T up to physically irrelevant global phase. By universality transfer by exact gate synthesis, the assumed universality of proves that is universal under the phase-insensitive convention. There is no assertion of arbitrary strict operator-norm phases: on a fixed register these generators have only a finite set of possible determinants, which would obstruct density in the entire unitary group if global phase were treated as an observable target.
Both the controlled-NOT gate and Pauli X gate permute computational basis vectors. Any finite composition remains a permutation matrix, and so sends to another computational basis vector. It cannot prepare a superposition such as .
This also rules out approximation: the squared overlap of that target with any computational basis vector is at most , so even after optimizing global phase the pure-state norm distance is at least . Hence is not universal. Basis permutations can create entanglement on some superposed inputs, but this gate set cannot create the required superposition from the specified basis input.
A finite universal quantum gate set can approximate every unitary on any fixed finite number of qubits to any prescribed positive accuracy, using a finite circuit of its gates on allowed wires. Explicitly, for every target and there is such a circuit with
The global-phase convention is the one just specified. Universality means arbitrary approximation, not exact representation of an uncountable family by finitely described circuits. Products of approximate gates can be controlled using the quantum circuit gate-error telescoping bound.
Under fixed phase representatives, two unitary operators on the same space are -close when , where the operator norm is
Thus every input vector is approximated uniformly, not merely one selected input. Under the phase-insensitive convention, replace this bound by . The minimization uses one phase for the whole operator, not a separately chosen phase inside the supremum for each input. This is operator-norm distance between unitary gates with the stated global-phase identification.
For normalized vector representatives in the same Hilbert space, the vector-norm convention is . Since physical pure states identify global phases, a phase-insensitive version is
The equality follows by choosing the phase to make the overlap real and nonnegative. This states an explicit pure-state norm distance convention; fidelity-based or trace-distance conventions use different numerical error parameters. We use the phase-insensitive convention for the universality claim below.
Suppose . Measure C in the orthonormal basis . Its two AB conditional vectors would be proportional to
respectively. Both are product states, because measuring the original GHZ state's C factor in the computational basis selects or . This contradicts part (i), which applies to every basic measurement basis of the W state's C factor. Therefore no local unitary transformation maps GHZ to W.
An additional invariant makes the distinction visible without measurement records. Across the partition AB versus C, the GHZ reduced density matrix on C has eigenvalues , whereas the W state's are . By local-unitary invariance of reduced-state spectra, these spectra cannot be changed by local unitaries. This supplies the same impossibility and emphasizes that the proposed transformation is a product of unitaries, not arbitrary postselected local processing.
Consider one normalized measurement vector on C. The unnormalized partial inner product on AB is
Its tensor-product coefficient matrix and determinant are
The two-qubit product-state determinant criterion therefore says that this branch is entangled whenever . Its probability is , so such a branch is physically possible and can be normalized without changing whether its determinant vanishes.
For an orthonormal basis , completeness gives . At least one vector has . Hence at least one nonzero-probability outcome leaves AB entangled, proving conditional entanglement of the three-qubit W state. Some bases give two entangled branches; the computational basis gives one entangled and one product branch. The claim is not that every outcome must entangle AB.
Here . Keeping that complex conjugation, the joint amplitude is
Hence . The cancellation is destructive quantum interference between the two source components, not the absence of either local outcome. Each local outcome individually has probability , since each reduced density matrix is . Omitting the conjugation in the second bra would turn the cancellation into reinforcement and give the wrong answer.
The joint Born rule uses the tensor product of the two outcome bras. Its amplitude is
The other source component vanishes on contraction with on A. Therefore
This is a joint probability: , while . Dropping the first factor would give only the conditional probability.

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