Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: 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 IID quantum source and compression code

Definition

Let HA be a nonzero finite-dimensional complex inner-product space and let ρ be a density operator (Density operator) on HA. The finite IID quantum source with state ρ emits the block state ρ⊗n on HA⊗n at blocklength n≥1.

An (n,M) quantum compression code for ρ consists of a finite-dimensional code space HC with dim⁡HC=M≥1, a quantum channel (Finite-dimensional quantum channel) E:L(HA⊗n)→L(HC), and a quantum channel D:L(HC)→L(HA⊗n). Its squared entanglement fidelity is

Fe(n):=⟨ϕ∣(id⁡R⊗(D∘E))(∣ϕ⟩⟨ϕ∣)∣ϕ⟩,

where HR is any finite-dimensional reference space supporting the chosen unit-vector purification ∣ϕ⟩ of ρ⊗n on HR⊗HA⊗n. The value is independent of the chosen finite purification by the isometric equivalence of Purifications exist and are unitarily equivalent after padding. A sequence of codes is reliable when Fe(n)→1. The code's rate is n−1ln⁡M nats per source letter, equivalently n−1log⁡2M qubits per source letter. The entropy threshold in these units is S(ρ) nats or S2(ρ):=S(ρ)/ln⁡2 qubits, where S is the entropy of Finite-dimensional von Neumann entropy.

Depends on

Used by

Dependency tree · two levels

34 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources