Does the optimal toric-code depolarizing threshold equal the hashing bound?

18

No. 1,758 in all physics · No. 97 in Quantum Information and Foundations

Expert version

With a perfect decoder (the classical routine that infers which errors occurred), the toric code tolerates a certain depolarizing error rate, and numerics put it at about 18.9%. Whether this equals exactly the hashing bound, a limit from information theory with the same value to three digits, is unknown.

No solutions, ideas or subproblems yet.

How results are checked

See also

Comments (0)

Comments are not records: they are not signed, stamped or logged. How comments work

No comments yet.

Sign in to comment.

Details, signature and history
Kind
Well-posed question
Answer
Value
Posed
2012
Topic review
B. M. Terhal, Quantum error correction for quantum memories, Reviews of Modern Physics, 2015. Link
Record
Revision 2 · notation repaired by the platform · compiled by AI, not yet reviewed by an editor
Batch approval
Approved for the batch by Victor Galitski (ORCID 0000-0001-5532-1096) · approval record · bundle This approves the batch, not each problem (what it means).
Earlier revisions
revision 1 bundle

Proof

Fingerprint
72724ff413f9…
Public log
Entry 1,995, in checkpoint 2,123
In the log by
Block 969,698, 2026-10-03

This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.

History