CyberIntel ⬡ News
★ Saved ◆ Cyber Reads
← Back ◌ Quantum Computing Aug 11, 2025

Is minimizing trace distance between two density matrices equivalent to minimizing their entropy difference?

Quantum Computing SE Archived Jun 02, 2026 ! Full text unavailable

Suppose $\rho$ is an input state , and $\sigma$ is a recovered state obtained after approximately encoding $\rho$ in a quantum error-correcting code and then applying some recovery channel. Here, the minimization is over the choice of recovery channel . We fix the encoding map $\mathcal{E}$ and the input state $\rho$ . Let $\mathcal{R}$ be any CPTP map acting on the code space. The recovered state is $$ \sigma(\mathcal{R}) = \mathcal{R} \circ \mathcal{E}(\rho). $$ The optimizations we are compar

Full text unavailable — view original
✦ AI Summary · Claude Sonnet


    Full text unavailable.
    Open original ↗
    💬 Team Notes
    Article Info
    Source
    Quantum Computing SE
    Category
    ◌ Quantum Computing
    Published
    Aug 11, 2025
    Archived
    Jun 02, 2026
    Full Text
    ✗ Not available
    Open Original ↗