Optimal recovery for quantum error correction
Sun Woo P. Kim

TL;DR
This paper investigates the ultimate limits of quantum error correction by analyzing optimal recovery channels, introducing a new diagnostic tool, and proving the optimality of certain recovery schemes to determine the true error threshold.
Contribution
It introduces the mutual trace distance as a diagnostic for optimal thresholds and proves the Petz and SW recovery schemes are optimal for quantum error correction.
Findings
Mutual trace distance effectively determines the optimal error threshold.
Petz and SW recovery schemes are proven to be optimal.
The structure and phase diagrams of recovery schemes are analyzed.
Abstract
The calculation of the error threshold of quantum error correcting codes typically proceeds as follows. First, syndromes are measured. Then, a decoder infers the error chain and the corresponding correction is applied. The threshold is then defined as the largest correctable error rate, with the maximum-likelihood decoder corresponding to the ``optimal'' threshold. However, a broader set of operations could be used to recover quantum information. The true optimal threshold should be optimised over all possible recovery schemes, which can be described by quantum channels. Here, we study such optimal recovery channels and their thresholds . We introduce an information-theoretic quantity, mutual trace distance, which provides a necessary and sufficient diagnostic for sharply determining without explicit optimisation. In contrast,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
