## Text Block: Supplementary Note 2 ### Overview The image presents a mathematical lemma and its proof related to quantum information theory, specifically concerning the relationship between high fidelity and low entropy. ### Components/Axes * **Title:** Supplementary Note 2 * **Lemma 1:** (High fidelity implies low entropy) * **Mathematical Condition:** If `<R singlets|ρ|R singlets> > 1 - δ where δ << 1, then the von Neumann entropy S(ρ) < -(1 - δ)log₂(1 - δ) - δlog₂(δ/(2^(2R)-1)).` * **Proof:** If `<R singlets|ρ|R singlets> > 1 - δ`, then the largest eigenvalue of the density matrix ρ must be larger than 1 - δ, the entropy of ρ is, therefore, bounded above by that of ρ₀ = diag {1 - δ, δ/(2^(2R)-1), δ/(2^(2R)-1), ..., δ/(2^(2R)-1)}. That is, ρ₀ is diagonal with a large entry 1 - δ and with the remaining probability δ equally distributed between the remaining 2^(2R) - 1 possibilities. * **End of Proof:** Q.E.D. ### Detailed Analysis or ### Content Details The text presents a lemma stating that high fidelity implies low entropy in a quantum system. It provides a mathematical condition under which this implication holds, involving the density matrix ρ, a small parameter δ, and the von Neumann entropy S(ρ). The proof outlines the reasoning behind this lemma, relating the fidelity to the largest eigenvalue of the density matrix and bounding the entropy. ### Key Observations * The lemma establishes a connection between the fidelity of a quantum state and its entropy. * The condition `δ << 1` suggests that the result is valid for high-fidelity states. * The proof relies on the properties of the density matrix and its eigenvalues. * The term `δ/(2^(2R)-1)` represents the equal distribution of the remaining probability among the possible states. ### Interpretation The lemma and its proof suggest that in quantum systems, achieving high fidelity (i.e., a state close to the desired state) implies a low entropy (i.e., a state with low uncertainty or mixedness). This is a fundamental result in quantum information theory, as it connects the ability to reliably prepare a quantum state with its inherent randomness. The mathematical condition provides a precise quantification of this relationship, showing how the entropy is bounded by a function of the fidelity and the parameter δ. The proof demonstrates how the fidelity constrains the eigenvalues of the density matrix, leading to a bound on the entropy.

\n ## Text Block: Supplementary Note 2 ### Overview The image contains a block of text presenting a lemma and its proof related to quantum information theory, specifically concerning the relationship between fidelity and entropy. It's a mathematical statement and its justification. ### Content Details The text is as follows: "Supplementary Note 2: Lemma 1: (High fidelity implies low entropy) If ⟨R singlets|ρ|R singlets⟩ > 1 − δ where δ ≪ 1, then the von Neumann entropy S(ρ) < −(1 − δ)log₂(1 − δ) − δlog₂(2²ᴿ⁻¹). Proof: If ⟨R singlets|ρ|R singlets⟩ > 1 − δ, then the largest eigenvalue of the density matrix ρ must be larger than 1 − δ, the entropy of ρ is, therefore, bounded above by that of ρ₀ = diag {1 − δ, δ/(2²ᴿ⁻¹), δ/(2²ᴿ⁻¹), ..., δ/(2²ᴿ⁻¹)}. That is, ρ₀ is diagonal with a large entry 1 − δ and with the remaining probability δ equally distributed between the remaining 2²ᴿ − 1 possibilities. Q.E.D." ### Key Observations The text uses mathematical notation including: * ⟨...|...⟩: Dirac notation for inner products. * ρ: Density matrix. * S(ρ): von Neumann entropy. * δ: A small positive number (δ ≪ 1). * R: An integer representing the number of qubits or systems. * log₂: Logarithm base 2. * diag{...}: Diagonal matrix. The proof relies on bounding the entropy of a density matrix based on its fidelity to a specific state. ### Interpretation This text establishes a connection between the fidelity of a quantum state (ρ) to a reference state (|R singlets⟩) and its von Neumann entropy. The lemma states that high fidelity (close to 1) implies low entropy. The proof demonstrates this by showing that if the fidelity is greater than 1 - δ, then the entropy is bounded above by the entropy of a diagonal matrix (ρ₀) with a large diagonal entry (1 - δ) and a small, evenly distributed probability for the remaining states. This is a fundamental result in quantum information theory, often used in the analysis of quantum error correction and quantum communication protocols. The "Q.E.D." signifies "quod erat demonstrandum," meaning "which was to be demonstrated," indicating the completion of the proof.

## Supplementary Note: Mathematical Lemma and Proof ### Overview The image displays a section of a technical document, specifically "Supplementary Note 2," containing a formal mathematical lemma and its proof. The content is presented in a standard academic typesetting style, likely from a paper in quantum information theory or a related field. The text is entirely in English. ### Components/Axes The document is structured as follows: 1. **Title:** "Supplementary Note 2:" 2. **Lemma Statement:** "Lemma 1: (High fidelity implies low entropy)" followed by the formal proposition. 3. **Proof:** A paragraph providing the logical derivation for the lemma, concluding with "Q.E.D." ### Detailed Analysis **Lemma 1: (High fidelity implies low entropy)** * **Condition:** If the fidelity between a state `ρ` and the state of `R` singlets is greater than `1 - δ`, where `δ` is much less than 1 (`δ ≪ 1`). This is written as: `⟨R singlets|ρ|R singlets⟩ > 1 - δ`. * **Conclusion:** Then the von Neumann entropy `S(ρ)` is bounded above by the expression: `S(ρ) < -(1 - δ) log₂(1 - δ) - δ log₂(δ / (2^(2R) - 1))`. **Proof:** The proof proceeds by logical deduction: 1. **Premise:** Start with the given condition: `⟨R singlets|ρ|R singlets⟩ > 1 - δ`. 2. **Implication for Eigenvalues:** This implies that the largest eigenvalue of the density matrix `ρ` must be greater than `1 - δ`. 3. **Entropy Bound:** Therefore, the entropy of `ρ` is bounded above by the entropy of a specific diagonal density matrix `ρ₀`. 4. **Definition of `ρ₀`:** The matrix `ρ₀` is defined as: `ρ₀ = diag {1 - δ, δ/(2^(2R)-1), δ/(2^(2R)-1), ..., δ/(2^(2R)-1)}`. 5. **Interpretation of `ρ₀`:** This matrix `ρ₀` is diagonal with one large entry `(1 - δ)` and the remaining probability `δ` equally distributed among the other `2^(2R) - 1` possibilities. ### Key Observations * The lemma establishes a direct, quantitative relationship between a high-fidelity condition (closeness to a specific pure state) and an upper bound on the von Neumann entropy (a measure of mixedness or uncertainty). * The proof relies on a majorization argument: the state `ρ` is majorized by the constructed state `ρ₀`, and entropy is a Schur-concave function, meaning it respects this ordering. * The bound becomes very tight for small `δ`. As `δ` approaches 0, the upper bound on entropy also approaches 0, consistent with the intuition that a state very close to a pure state must itself have very low entropy. ### Interpretation This lemma provides a fundamental tool for analyzing quantum states. It quantifies the intuition that if a quantum system is very likely to be found in a specific, highly ordered configuration (the `R` singlets), then its overall disorder (entropy) must be low. * **What it demonstrates:** It translates a *fidelity* criterion (a measure of state overlap) into an *entropy* bound (a measure of information content). This is crucial for protocols where maintaining a high-fidelity state is necessary, such as in quantum communication or computation. * **Relationship between elements:** The condition `⟨R singlets|ρ|R singlets⟩ > 1 - δ` is the input. The proof constructs a "worst-case" mixed state `ρ₀` that satisfies this condition and has the maximum possible entropy. The entropy of any other state `ρ` meeting the condition cannot exceed that of `ρ₀`. * **Notable implications:** The term `2^(2R)` in the denominator suggests the dimension of the Hilbert space involved scales exponentially with `R`, which is typical for systems of `R` entangled particles (e.g., `R` Bell pairs). The lemma is likely used in a larger argument to show that high-fidelity preparation or transmission of such states is possible only if the entropy is correspondingly low, placing limits on noise or decoherence.

## Supplementary Note 2: Lemma 1 and Proof ### Overview This document presents **Lemma 1**, which establishes a relationship between high fidelity (quantified by the overlap of singlet states) and low von Neumann entropy in quantum systems. The proof derives bounds on entropy using properties of density matrices and eigenvalues. ### Components/Axes - **Key Variables**: - \( \delta \): A small parameter where \( \delta \ll 1 \). - \( \rho \): Density matrix of the quantum state. - \( \langle R \text{ singlets}|\rho|R \text{ singlets} \rangle \): Fidelity measure between the state \( \rho \) and the singlet subspace. - **Mathematical Elements**: - Von Neumann entropy \( S(\rho) \). - Eigenvalues of \( \rho \): \( \rho_0 = \text{diag}\left\{1-\delta, \frac{\delta}{2^{2R}-1}, \frac{\delta}{2^{2R}-1}, \dots, \frac{\delta}{2^{2R}-1}\right\} \). ### Detailed Analysis 1. **Lemma Statement**: If \( \langle R \text{ singlets}|\rho|R \text{ singlets} \rangle > 1 - \delta \) (high fidelity), then the von Neumann entropy satisfies: \[ S(\rho) < -(1-\delta)\log_2(1-\delta) - \delta \log_2\left(\frac{\delta}{2^{2R}-1}\right). \] This implies that high fidelity constrains the entropy to a logarithmic bound dependent on \( \delta \) and system size \( R \). 2. **Proof Logic**: - **Step 1**: High fidelity \( > 1-\delta \) implies the largest eigenvalue of \( \rho \) exceeds \( 1-\delta \). - **Step 2**: The entropy \( S(\rho) \) is bounded above by the entropy of a diagonal density matrix \( \rho_0 \), where: - One eigenvalue is \( 1-\delta \). - Remaining \( 2^{2R}-1 \) eigenvalues are \( \frac{\delta}{2^{2R}-1} \), equally distributed. - **Conclusion**: The entropy is maximized when probability \( \delta \) is spread uniformly across all other states, leading to the derived bound. ### Key Observations - The entropy bound tightens as \( \delta \to 0 \), reflecting that high fidelity (near-perfect singlet overlap) enforces low entropy. - The term \( \frac{\delta}{2^{2R}-1} \) highlights the exponential growth of possible states with system size \( R \), emphasizing scalability challenges. - The proof assumes \( \delta \ll 1 \), limiting applicability to regimes where fidelity deviations are small. ### Interpretation This lemma formalizes the trade-off between fidelity and entropy in quantum error correction. High fidelity (e.g., in quantum error detection) necessitates a state concentrated in a small subspace (singlets), suppressing entropy. The bound quantifies how entropy grows with system size \( R \) and fidelity tolerance \( \delta \), providing a theoretical foundation for designing robust quantum codes. The result is critical for understanding the limits of quantum error mitigation strategies. **Note**: No numerical values or trends are present, as this is a theoretical proof. All relationships are analytical.