Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite two-qubit density matrices and separability

Definition

Use the single-qubit space and ordered two-qubit basis from Pauli matrices and the two-qubit exchange operator. A one-qubit density matrix is a Hermitian 2×2 matrix ρ such that ⟨ρx,x⟩≥0 for every x∈C2 and tr⁡(ρ)=1. A two-qubit density matrix is defined in the same way on C2⊗C2, using the four-dimensional trace.

The tensor product of two one-qubit density matrices is again a two-qubit density matrix. To verify positivity, write any positive semidefinite Hermitian matrix as R=(azz‾b); testing the quadratic form on the two coordinate vectors gives a,b≥0. If a>0, completing the square gives

⟨R(x,y),(x,y)⟩=a∣x+zay∣2+(b−∣z∣2a)∣y∣2,

so positivity implies b−∣z∣2/a≥0 and

R=S∗S,S=(az/a0b−∣z∣2/a).

If a=0, positivity forces z=0: if z≠0, choose y=1 and x=−tz with real t>b/(2∣z∣2), giving quadratic form b−2t∣z∣2<0. Then R=S∗S for S=diag⁡(0,b). The nonnegative square roots exist by Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a through the preceding matrix conventions. Thus for one-qubit densities ρA=SA∗SA and ρB=SB∗SB, the tensor-product adjoint identity from Pauli matrices and the two-qubit exchange operator gives

ρA⊗ρB=(SA⊗SB)∗(SA⊗SB),

which is Hermitian and positive semidefinite. In the displayed product basis, tr⁡(X⊗Y)=∑i,j=01XiiYjj=tr⁡(X)tr⁡(Y) for 2×2 matrices X,Y. Therefore tr⁡(ρA⊗ρB)=1.

A product density matrix is ρA⊗ρB for one-qubit density matrices ρA,ρB. A two-qubit density matrix is separable if it is a finite convex combination ∑j=1mtjρA,j⊗ρB,j, where tj≥0 and ∑j=1mtj=1; these convex combinations are again density matrices by linearity of the trace and quadratic form. A two-qubit density matrix that is not separable is entangled. This finite-convex-combination convention is the one used by the local threshold proof.

Depends on

Dependency tree · 2 levels

Sources