Every rank-one projective measurement of one qubit of the three-qubit W state has at least one nonzero-probability outcome whose other two qubits remain entangled. To see this, contract the measured factor against , where . The unnormalized tensor-product coefficient matrix of the other pair is
At least one vector in a complete measurement basis has , giving nonzero determinant and an entangled conditional branch. Its probability is positive. This property survives local unitary changes of basis. The GHZ state lacks it because computational-basis measurement of one qubit leaves a product state on each branch, so the property also separates the states under local-unitary equivalence.
Local-unitary equivalence 2026-10-25
Two bipartite pure states on fixed subsystem spaces are local-unitary equivalent when related by the displayed product of unitary operators. Identity operators give reflexivity, inverse operators give symmetry, and products of local operators give transitivity. Thus this is an equivalence relation, whose classes are the orbits under local unitaries.
Every pair of normalized product states is local-unitary equivalent: extend each factor to an orthonormal basis and use a unitary operator carrying one basis to the other. Local operators preserve a product factorization, and their inverses do too, so quantum entanglement cannot be created or removed this way. More generally, the tensor-product coefficient matrix changes as , which preserves its singular values and therefore its Schmidt coefficients. The transpose on the second factor is ordinary, not a conjugate transpose, because coefficients of a tensor product depend bilinearly on the two input vectors.
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.
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.
A local unitary transformation preserves a product factorization:
The output is therefore another product state. If an entangled state could be locally mapped to a product state, applying the inverse would make the original entangled state a product as well, a contradiction. Hence a product state and an entangled state are never local-unitary equivalent.
In terms of a tensor-product coefficient matrix, changes to , with an ordinary transpose on the second factor. Both multiplying matrices are invertible, so the matrix rank, equivalently the Schmidt rank, is unchanged. This supplies an algebraic form of the same argument: a nonzero pure state is a product state exactly when that rank is one.
Separability of a tensor 2026-10-14
In a two-factor tensor product over a field, a pure tensor is also called a separable or decomposable tensor: it can be expressed as one product . Every tensor is a finite sum of pure tensors, but a sum need not itself be a pure tensor.[ref]
For finite-dimensional vector spaces, the tensor-product coefficient matrix gives a decisive test: a nonzero tensor is a pure tensor exactly when its matrix rank is one. Indeed, every column of is a scalar multiple of . Conversely, if all columns of a nonzero matrix are multiples of one nonzero column , collect their multipliers in to obtain . The zero tensor is also a pure tensor, for example , but its matrix rank is zero.
In , the tensor
is nonseparable: its matrix rank is two and its determinant is one, whereas . Directly, trying requires and . The first two equations force all four scalars nonzero, contradicting the others. In contrast, products sharing a factor do combine: . Thus being written as two summands alone does not establish nonseparability.
Tensor product Created 2026-09-24 Updated 2026-10-14
A tensor product turns a bilinear map into a linear map. For vector spaces over the same field , its elements are finite sums of pure tensors , subject to bilinearity:
The scalar belongs to ; writing makes this choice explicit. These rules preserve separate linearity while allowing arbitrary linear combinations of products.[ref]
For a concrete example, take , with basis vectors in the first copy and in the second. The four tensor-product basis elements are
The pure tensor made from and expands to
Each basis vector in one factor can interact with each basis vector in the other. This is why dimensions multiply; the tensor-product coefficient matrix displays these four interactions as a two-by-two grid.
The tensor product is different from the Cartesian product . With componentwise vector addition and scalar multiplication, the latter contains pairs and has dimension . The map is bilinear, generally neither linear on that Cartesian product nor injective nor surjective. In our example, , and ; the separability of a tensor explains why some outputs cannot be reached at all. Both spaces happen to have dimension four when , but this coincidence does not identify their structures.
Two-factor tensor rank 2026-10-14
The two-factor tensor rank is the smallest number of pure tensors whose sum equals , with zero allowed as the empty sum. For two finite-dimensional vector spaces over the same field, it equals the matrix rank of the tensor-product coefficient matrix. A sum of outer products has column space contained in the span of their first factors, so its matrix rank is at most . Conversely, choose a basis for the column space, express each column in that basis, and collect the coefficients into row vectors . This yields , hence a sum of pure tensors.
The pure tensor therefore has two-factor tensor rank one, whereas has two-factor tensor rank two. Both have two factors: the number of factors and the minimum number of product summands are different counts. Over the real numbers, the singular value decomposition supplies a useful decomposition , with one nonzero term per matrix rank. The two-factor rank equality does not extend to three or more factors by merely choosing one matrix layout.