Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generated
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.

Haar-average fidelity versus entanglement fidelity

PDF p. 3: Opening paragraph

Statement

Assume the Axiom of Choice. Let dL≥1, let HL=CdL, and let E:L(HL)→L(HL) be a quantum channel, meaning a complex-linear, completely positive, trace-preserving map. Let U range over the unitary group U(dL) with normalized Haar probability, and put ∣ψU⟩=U∣0⟩. The Haar-average pure-state fidelity and entanglement fidelity at the maximally mixed input are respectively

Fˉ(E)=∫U(dL)⟨ψU∣E(∣ψU⟩⟨ψU∣)∣ψU⟩ dU,Fe(E)=⟨Φ∣(id⊗E)(∣Φ⟩⟨Φ∣)∣Φ⟩,

where ∣Φ⟩=dL−1/2∑j=0dL−1∣j⟩⊗∣j⟩ and id is the identity map on operators on the reference copy of HL. Then

Fˉ(E)=dLFe(E)+1dL+1.

In particular, let V:HL→HP be an isometry between nonzero finite-dimensional complex coordinate spaces, let N:L(HP)→L(HO) be a channel with a finite nonempty Kraus family (El), and let P=VV†. Put Q=N(P) and let Q−1/2 be the inverse of its positive square root on its support and zero on its kernel. A transpose recovery T is a channel obtained by completing the map with Kraus operators PEl†Q−1/2 outside the support of Q using a code state. Let Etr be the logical channel obtained by encoding with V, applying N and T, and decoding the code-supported output with V†. If M[μ,l],[ν,k]=⟨μˉ∣El†Ek∣νˉ⟩, where ∣μˉ⟩=V∣μ⟩, and if Tr⁡L contracts the logical indices, define Ftr=dL−2∥Tr⁡LM∥F2, with M the positive square root and ∥B∥F2=∑l,k∣Bl,k∣2. Then Fe(Etr)=Ftr and Fˉ(Etr)=(dLFtr+1)/(dL+1). This includes singular M and Q and is independent of the completion choice.

Facts & Assumptions

[F1]

The finite operator conventions give the basis, adjoint, tensor-product and bra-ket notation used in the statement. Finite operator and ket conventions

[F2]

A quantum channel is complex-linear, completely positive and trace-preserving; the entanglement-fidelity definition gives the displayed maximally entangled overlap. Finite-dimensional quantum channel Entanglement fidelity on a finite logical space

[F3]

Under the Axiom of Choice, the normalized Haar probability on the compact unitary group gives the unitary-invariant pure-state distribution in the statement. For every channel on Cd, its average pure-state fidelity equals (dFe+1)/(d+1). Normalized Haar probability on a compact group Haar-average versus entanglement fidelity

[F4]

The QEC matrix, logical partial trace and Frobenius norm are as displayed, and the support-completed transpose recovery is a channel whose output is supported on the code. QEC matrix and logical partial trace Transpose (Petz) recovery on a code

[F5]

For the stated finite-dimensional code, channel and support-completed transpose recovery, the decoded logical channel has entanglement fidelity dL−2∥Tr⁡LM∥F2, including singular cases and independently of the completion choice. Transpose fidelity from the QEC matrix

[A1]

Assume the Axiom of Choice, as required by the Haar-average supplier. The Axiom of Choice

Proof

[A1] Assume the Axiom of Choice, as required by the Haar-average supplier. The Axiom of Choice

Given: The Axiom of Choice, the finite logical space and channel, and, for the particular case, the code, noise channel and transpose recovery specified in the statement.

Goal: Prove the average-fidelity identity and its transpose-recovery specialization.

1.1givenF2F3A1

The given E is a quantum channel on CdL with dL≥1. Its entanglement fidelity is the overlap in [F2], and its average is taken with the normalized Haar distribution in [F3]. Applying the Haar-average relation under [A1] gives Fˉ(E)=(dLFe(E)+1)/(dL+1).

2.1givenF1F4F5step 1.1∎

In the particular case, [F4] supplies the specified recovery and matrix conventions, while [F5] gives a decoded logical channel and identifies its entanglement fidelity with the displayed Ftr. Apply step 1.1 to that channel and substitute this equality. The singular-case and completion-independence assertions follow from [F5], since the average is the same function of that completion-independent fidelity.

Depends on

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources