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 , let , and let be a quantum channel, meaning a complex-linear, completely positive, trace-preserving map. Let range over the unitary group with normalized Haar probability, and put . The Haar-average pure-state fidelity and entanglement fidelity at the maximally mixed input are respectively
where and is the identity map on operators on the reference copy of . Then
In particular, let be an isometry between nonzero finite-dimensional complex coordinate spaces, let be a channel with a finite nonempty Kraus family , and let . Put and let be the inverse of its positive square root on its support and zero on its kernel. A transpose recovery is a channel obtained by completing the map with Kraus operators outside the support of using a code state. Let be the logical channel obtained by encoding with , applying and , and decoding the code-supported output with . If , where , and if contracts the logical indices, define , with the positive square root and . Then and . This includes singular and and is independent of the completion choice.
Statement references
Facts & Assumptions
The finite operator conventions give the basis, adjoint, tensor-product and bra-ket notation used in the statement. Finite operator and ket conventions
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
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 , its average pure-state fidelity equals . Normalized Haar probability on a compact group Haar-average versus entanglement fidelity
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
For the stated finite-dimensional code, channel and support-completed transpose recovery, the decoded logical channel has entanglement fidelity , including singular cases and independently of the completion choice. Transpose fidelity from the QEC matrix
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.
The given is a quantum channel on with . 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 .
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 . 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
- Transpose fidelity from the QEC matrix
- QEC matrix and logical partial trace
- Transpose (Petz) recovery on a code
- Entanglement fidelity on a finite logical space
- Finite operator and ket conventions
- Haar-average versus entanglement fidelity
- Finite-dimensional quantum channel
- Normalized Haar probability on a compact group
- The Axiom of Choice
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
- Monolithic Quantum Error Correction in the Presence of Distinguishability · PDF p. 3, opening paragraph; PDF p. 8, discussion following Eq. (S1.6)