REVIEW 3 cited by
Less Bacon More Threshold
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
read the original abstract
We give the Bacon-Shor code a threshold purely by deleting gates from its circuit. Specifically: we use lattice surgery to concatenate the Bacon-Shor code with itself using local planar connectivity, and observe that the resulting circuit is a subset of the circuit that would be used by a larger Bacon-Shor code.
Forward citations
Cited by 3 Pith papers
-
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 ...
-
Feasibility of Logical Bell State Generation in Memory Assisted Quantum Networks
Logical Bell-state protocols with d=3/5 surface and Bacon-Shor codes in ion traps need gate error rates around 10^-4 to 10^-5 to beat unencoded Bell states at 1 km, and the non-local protocol reaches about 33 Hz over ...
-
Dynamical codes for hardware with noisy readouts
Repeating measurement rounds in dynamically condensed colour codes substantially reduces teraquop volume under measurement-biased noise, while decoder choice determines whether XZ-only or XYZ schedules win.
Discussion (0). Continue with ORCID to comment.