Figure 2
From: Dynamic Concatenation of Quantum Error Correction in Integrated Quantum Computing Architecture
A density-plot of the effective N with respect to \({F}_{1Q}^{(l-\mathrm{1)}}\) and \({\varepsilon }_{\tau }\) (on a log-log scale). A colored region indicates the length N that allows us to lower the concatenation level, satisfying Eq. (6). This graph also provides a useful intuition about how our DC scheme works. For instance, consider two points: \({F}_{1Q}^{(l)}\simeq {10}^{-13}\) (blue, denoted B) and \({F}_{CNOT}^{(l)}\simeq {10}^{-11}\) (red, denoted A) in the line of \({\varepsilon }_{\tau }\simeq {10}^{-8}\). The concatenation level is conventionally determined by the lowest performance gates, i.e., the point A. However, in our DC scheme, the concatenation can be controlled dynamically between from A to B, depending on the number N of decomposed gates, providing the advantage (see the main text).
