Benchmarking Accuracy in an Emulated Memory Experiment
Tim Chan
Abstract
This note proposes a simpler method to extract the logical error rate from an emulated surface code memory experiment.
Table of Contents
Fetching ...
Benchmarking Accuracy in an Emulated Memory Experiment
Authors
Abstract
This note proposes a simpler method to extract the logical error rate from an emulated surface code memory experiment.
Paper Structure
This paper contains 3 sections, 2 figures, 1 algorithm.
Table of Contents
Figures (2)
- Figure 1: Sweeping upward through the decoding graph. The green horizontal line is the sweep line. The two blue vertical lines are boundaries. The black (red) curves are paths of encountered (unencountered) bitflipped edges. Each pair of red dots joined by a grey curve is an anyon pair. (a) An anyon pair is created. (b) Another pair is created. (c) The first pair spans opposite boundaries, so is recorded as a logical bitflip and removed. The second pair will later span between the same boundary, so will not contribute a logical bitflip.
- Figure 2: Estimated logical error rate of the Union--Find decoder Delfosse2020Delfosse2021 adapted with the forward method Dennis2002, as a function of memory experiment duration. Each datapoint is the mean of $1.0e5$ lots of $d$ measurement rounds; shading shows the 95% confidence region. (a) Noise level $p =8.0e-3$, which is above threshold; (b) $p =4.0e-3$, which is below threshold.