Pith. sign in

REVIEW 1 cited by

Approximate quantum error correcting codes from conformal field theory

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.09555 v3 pith:SUAXOM6S submitted 2024-06-13 quant-ph cond-mat.str-elhep-th

classification quant-phcond-mat.str-elhep-th
keywords quantumcodeserrorcodeconformalcorrectingdephasingfield
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

The low-energy subspace of a conformal field theory (CFT) can serve as a quantum error correcting code, with important consequences in holography and quantum gravity. We consider generic 1+1D CFT codes under extensive local dephasing channels and analyze their error correctability in the thermodynamic limit. We show that (i) there is a finite decoding threshold if and only if the minimal nonzero scaling dimension in the fusion algebra generated by the jump operator of the channel is larger than $1/2$ and (ii) the number of protected logical qubits $k \geq \Omega( \log \log n)$, where $n$ is the number of physical qubits. As an application, we show that the one-dimensional quantum critical Ising model has a finite threshold for certain types of dephasing noise. Our general results also imply that a CFT code with continuous symmetry saturates a bound on the recovery fidelity for covariant codes.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Approximate Quantum Error Correction at Chiral Topological Edges

    quant-ph 2026-08 conditional novelty 7.0 of 10

    Chiral edge codes have local-erasure robustness governed by power-law exponents with hierarchy γ≥α≥min{α,β}, so the 2D code is at least as robust as its 1D CFT reduction.

Pith tools