Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Basis states are exactly tensor products of single-qubit basis states

Proved
QAlgorithms.Nannicini.basisState_iff_prod_basisStates

by Goku · Oct 13, 2026 · Mathlib 0df444a (Lean v4.33.1)

lecture-notesnanniciniquantum-information

Let q>1q>1q>1 and let ∣ψ⟩∈(C2)⊗q|\psi\rangle\in(\mathbb C^2)^{\otimes q}∣ψ⟩∈(C2)⊗q be a qqq-qubit quantum state, i.e. a unit vector. Recall (Def. 1.16) that ∣ψ⟩|\psi\rangle∣ψ⟩ is a basis state if ∣ψ⟩=αk∣k⃗⟩|\psi\rangle=\alpha_k|\vec k\rangle∣ψ⟩=αk​∣k⟩ for some k⃗∈{0,1}q\vec k\in\{0,1\}^qk∈{0,1}q and some αk∈C\alpha_k\in\mathbb Cαk​∈C with ∣αk∣2=1|\alpha_k|^2=1∣αk​∣2=1. Then ∣ψ⟩|\psi\rangle∣ψ⟩ is a basis state if and only if there are single-qubit states ∣ψ1⟩,…,∣ψq⟩∈C2|\psi_1\rangle,\dots,|\psi_q\rangle\in\mathbb C^2∣ψ1​⟩,…,∣ψq​⟩∈C2, each of which is a basis state, such that

∣ψ⟩=∣ψ1⟩⊗∣ψ2⟩⊗⋯⊗∣ψq⟩.|\psi\rangle=|\psi_1\rangle\otimes|\psi_2\rangle\otimes\cdots\otimes|\psi_q\rangle .∣ψ⟩=∣ψ1​⟩⊗∣ψ2​⟩⊗⋯⊗∣ψq​⟩.

The statement shows that basis states are always product states, in contrast with superpositions, which can be entangled.

Formalization Note The qqq-qubit register is indexed by {0,1}q\{0,1\}^q{0,1}q with the first qubit as the most significant bit; the tensor product of the single-qubit states is the vector whose z⃗\vec zz-coordinate is ∏i⟨zi∣ψi⟩\prod_{i}\langle z_i|\psi_i\rangle∏i​⟨zi​∣ψi​⟩, with qubit iii of the source being the iii-th factor. Being a basis state already forces unit norm, so the unit-norm hypotheses are stated for fidelity to the source but are redundant.

Preamble
import Definitions.Def_QAlgorithms_Defs_Measurement
set_option autoImplicit false
Formal statement
namespace QAlgorithms.Nannicini


/-- Nannicini p.14, Proposition 1.19: a `q`-qubit register, `q > 1`, is in a basis state
(Def. 1.16: `|ψ⟩ = α_k |k⟩` with `|α_k|² = 1`) if and only if its state is the tensor product
`|ψ_1⟩ ⊗ ⋯ ⊗ |ψ_q⟩` of `q` single-qubit states each of which is a basis state. Wire `i` is the
source's qubit `i + 1` (the first qubit is the most significant). -/
theorem basisState_iff_prod_basisStates {q : ℕ} (hq : 1 < q)
    (ψ : EuclideanSpace ℂ (Qubits q)) (hψ : IsState ψ) :
    IsBasisState ψ ↔ ∃ φ : Fin q → EuclideanSpace ℂ Bool,
      (∀ i, IsState (φ i) ∧ IsBasisState (φ i)) ∧ ψ = prodState φ := by
  sorry




end QAlgorithms.Nannicini
Source
Giacomo Nannicini, Quantum algorithms for optimizers, 2025, v5; notes dated 9 July 2025, PDF p. 14, Proposition 1.19. https://arxiv.org/pdf/2408.07086v5
Read-back

What the Lean code literally says, in plain math · claude-opus-5-5

Let qqq be a natural number with q>1q > 1q>1 (so q≥2q \ge 2q≥2). Index an qqq-qubit vector by bit strings z=(z0,…,zq−1)∈{0,1}qz = (z_0,\dots,z_{q-1}) \in \{0,1\}^qz=(z0​,…,zq−1​)∈{0,1}q. Let ψ∈C{0,1}q\psi \in \mathbb{C}^{\{0,1\}^q}ψ∈C{0,1}q be a unit vector, ∥ψ∥=1\|\psi\| = 1∥ψ∥=1.

Call a vector a basis state if it equals α ek\alpha\, e_kαek​ for some index kkk and some complex α\alphaα with ∣α∣=1|\alpha| = 1∣α∣=1. Here eke_kek​ is the standard basis vector at kkk.

For a family φ0,…,φq−1\varphi_0,\dots,\varphi_{q-1}φ0​,…,φq−1​ of single-qubit vectors in C{0,1}\mathbb{C}^{\{0,1\}}C{0,1}, define the product vector φ0⊗⋯⊗φq−1\varphi_0\otimes\cdots\otimes\varphi_{q-1}φ0​⊗⋯⊗φq−1​ by

(φ0⊗⋯⊗φq−1)z=∏i=0q−1(φi)zi.(\varphi_0\otimes\cdots\otimes\varphi_{q-1})_z = \prod_{i=0}^{q-1} (\varphi_i)_{z_i}.(φ0​⊗⋯⊗φq−1​)z​=i=0∏q−1​(φi​)zi​​.

The theorem states that ψ\psiψ is a basis state if and only if there exist single-qubit vectors φ0,…,φq−1\varphi_0,\dots,\varphi_{q-1}φ0​,…,φq−1​ with both of the following properties:

  • each φi\varphi_iφi​ has unit norm and is itself a basis state of C{0,1}\mathbb{C}^{\{0,1\}}C{0,1}, i.e. of the form βiebi\beta_i e_{b_i}βi​ebi​​ with ∣βi∣=1|\beta_i| = 1∣βi​∣=1 and bi∈{0,1}b_i \in \{0,1\}bi​∈{0,1};
  • ψ=φ0⊗⋯⊗φq−1\psi = \varphi_0\otimes\cdots\otimes\varphi_{q-1}ψ=φ0​⊗⋯⊗φq−1​.

The cases q=0q = 0q=0 and q=1q = 1q=1 are excluded by the hypothesis.

Human review
  • Endorsed by Shuze Chen · Oct 13, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Goku · Oct 13, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me