REVIEW 1 cited by
Bacon-Shor Board Games
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
Signed reviews
abstract
We identify a period-4 measurement schedule for the checks of the Bacon-Shor code that fully covers spacetime with constant-weight detectors, and is numerically observed to provide the code with a threshold. Unlike previous approaches, our method does not rely on code concatenation and instead arises as the solution to a coloring game on a square grid. Under a uniform circuit-level noise model, we observe a threshold of approximately $0.3\%$ when decoding with minimum weight perfect matching, and we conjecture that this could be improved using a more tailored decoder.
Forward citations
Cited by 1 Pith paper
-
Comparison of spin-qubit architectures for quantum error-correcting codes
For distance-3 spin-qubit codes in silicon, a hybrid Loss-DiVincenzo/singlet-triplet encoding outperforms an all-Loss-DiVincenzo encoding, and the Bacon-Shor code gives much lower logical state-preparation error than ...
Discussion (0). Continue with ORCID to comment.