Question 8: Tensor Decomposition (Given a State, Factor Out Its Product Structure)

Source: Chapter 01, slides 27-33 (tensor product); Chapter 03, slides 3, 28-34 (entanglement)

Task type for every problem below: you are given a multi-qubit state written as a sum of computational-basis terms, and you must determine whether it factors into a tensor product of smaller (single- or multi-qubit) states, and if so, find the factors explicitly with a full derivation; if not, prove that it cannot factor. Ordered easiest to hardest.


Problem 1 (easy):

Step 1, read off the bit string. is already written as a single computational basis term, with q0 in position and q1 in position .

Step 2, factor directly. A computational basis state on multiple qubits is, by definition, the tensor product of each qubit’s own basis state:

Why this is the easiest case. No superposition is present at all, so there is nothing to combine or separate; identifying the factors is just reading each digit’s position.


Problem 2 (easy):

Step 1, guess the ansatz. Try writing the state as , and match coefficients against the target, which has every amplitude equal to :

Step 2, solve. From , either (ruled out since ) or . Similarly from , either (ruled out) or . So and ; substituting into with normalization , and likewise .

Step 3, identify the factors.

Step 4, sanity check. , matching the target exactly.


Problem 3 (easy-medium):

Step 1, look for a pattern by fixing q0 and varying q1. Group the four terms by the value of q0:

Step 2, notice the q1 factor is identical in both groups. Both groups carry the same q1 factor , so it can be pulled outside as a common tensor factor:

Step 3, identify the factors.

Step 4, verify by expanding back. , matching the target.

Lesson. The general test used here is: write the amplitude of as a function of the two bits, and check whether it splits as a product of a function of alone times a function of alone. Here amplitude, which is independent of (so constant) and depends only on through (so ) — the product-form test that the remaining problems all rely on.


Problem 4 (medium): prove does not factor

Step 1, set up the ansatz and try to match coefficients. Suppose, for contradiction, that

Matching against requires

Step 2, derive a contradiction. From : both and . From and : it must be . But then , which contradicts .

Step 3, conclude. No choice of can satisfy all four equations simultaneously, so no single-qubit states exist with . The Bell state is genuinely entangled, not just written in an unfamiliar form.

Why the Problem 1–3 method fails here on purpose. The product-form test from Problem 3 asks whether amplitude; here amplitude and amplitude are both nonzero while amplitude amplitude. If a product form existed, and force all nonzero, which in turn forces , contradicting amplitude. The zero/nonzero pattern itself already rules out separability before any algebra.


Problem 5 (medium-hard): , partial factorization (2 qubits entangled, 1 free)

Step 1, apply the product-form test to the third qubit against the rest. Write amplitude and check whether it depends on at all. Listing all four nonzero terms: all carry coefficient , and for both values of ( and ) the same pair of values appear ( and ). So the amplitude does not depend on beyond an overall constant, meaning q2 (the third qubit) factors out.

Step 2, split off q2.

Step 3, identify the factors.

Step 4, verify by expanding back. , matching the target.

Step 5, check that the remaining piece really cannot be split further. By Problem 4, itself does not factor into ; so the fullest possible factorization of this 3-qubit state is exactly two pieces, entangled together and free, not three independent single-qubit factors.

Lesson. Factorization is not all-or-nothing on more than 2 qubits: a state can be partially separable, splitting into an entangled block plus one or more free qubits, and the product-form test must be applied one candidate qubit at a time to find the finest valid split.


Problem 6 (hard): , partial factorization with a complex phase, different qubit grouping

Step 1, test each qubit as a candidate to split off. Group the four terms by the pair : terms with are (coefficient , both values of present); terms with are (coefficient , again both values of present); no terms have or . Since ranges freely over both values for each fixed , with the same coefficient in both cases, (the qubit) factors out.

Step 2, split off q0.

Step 3, identify the factors.

Step 4, verify by expanding back. , matching the target.

Step 5, check the remaining 2-qubit piece for further factorization. has the same zero/nonzero amplitude pattern as the Bell state in Problem 4 (only the and terms are populated, and are both zero), so the identical contradiction argument applies: any attempted product forces while , which is impossible. So stay entangled; only separates.

Why this is harder than Problem 5. The complex coefficient on half the terms must be tracked through the grouping step without disturbing the conclusion (it multiplies both remaining terms consistently, so it does not block factorization on its own), and the qubit that separates out (, the first digit) is not adjacent to how the terms were listed, requiring the solver to actively search across groupings rather than immediately spotting an already-adjacent repeated block as in Problem 5.


Problem 7 (very hard): prove the GHZ state has no nontrivial factorization at all, across every possible split

Step 1, test the split . Suppose for some 2-qubit state . Expand:

Since and are linearly independent, the coefficients multiplying each of them must match separately:

Step 2, derive the contradiction. A valid GHZ decomposition needs both and (otherwise would collapse to a single term, which it is not). With , the first equation gives , i.e. is proportional to . With , the second equation gives proportional to instead. But and are linearly independent vectors, so no single can be proportional to both at once. Contradiction; this split is impossible.

Step 3, note the argument is symmetric under relabeling. Nothing in Step 1–2 depended on which qubit was singled out; the identical argument with or playing the role of the singled-out qubit produces the identical contradiction (the roles of are simply replaced by the corresponding two-bit strings on the other pair). So the splits and fail for the same reason.

Step 4, rule out full separation into three single-qubit factors. A full factorization is a special case of the split tested in Step 1 (with ), so it is already ruled out by the same contradiction.

Conclusion. Unlike Problems 5 and 6, where one qubit could always be peeled off leaving a smaller entangled block, the GHZ state admits no nontrivial tensor factorization whatsoever: every one of its three qubits is entangled with the other two, and there is no bipartition of the register across which the state splits.