A universal, scalable quantum computer will require the use of quantum error correction in order to achieve fault tolerance. The assessment and comparison of error-correcting strategies is performed by classical simulation. However, due to the prohibitive exponential scaling of general quantum circuits, simulations are restrained to specific subsets of quantum operations. This creates a gap between accuracy and efficiency which is particularly problematic when modeling noise, because most realistic noise models are not efficiently simulable on a classical computer. We have introduced extensions to the Pauli channel, the traditional error channel employed to model noise in simulations of quantum circuits. These expanded error channels are still computationally tractable to simulate, but result in more accurate approximations to realistic error channels at the single qubit level. Using the Steane [[7,1,3]] code, we have also investigated the behavior of these expanded channels at the logical error-corrected level. We have found that it depends strongly on whether the error is incoherent or coherent. In general, the Pauli channel will be an excellent approximation to incoherent channels, but an unsatisfactory one for coherent channels, especially because it severely underestimates the magnitude of the error. Finally, we also studied the honesty and accuracy of the expanded channels at the logical level. Our results suggest that these measures can be employed to generate lower and upper bounds to a quantum code's threshold under the influence of a specific error channel.
A universal, scalable quantum computer will require the use of quantum error correction in order to achieve fault tolerance. The assessment and comparison of error-correcting strategies is performed by classical simulation. However, due to the prohibitive exponential scaling of general quantum circuits, simulations are restrained to specific subsets of quantum operations. This creates a gap between accuracy and efficiency which is particularly problematic when modeling noise, because most realistic noise models are not efficiently simulable on a classical computer. We have introduced extensions to the Pauli channel, the traditional error channel employed to model noise in simulations of quantum circuits. These expanded error channels are still computationally tractable to simulate, but result in more accurate approximations to realistic error channels at the single qubit level. Using the Steane [[7,1,3]] code, we have also investigated the behavior of these expanded channels at the logical error-corrected level. We have found that it depends strongly on whether the error is incoherent or coherent. In general, the Pauli channel will be an excellent approximation to incoherent channels, but an unsatisfactory one for coherent channels, especially because it severely underestimates the magnitude of the error. Finally, we also studied the honesty and accuracy of the expanded channels at the logical level. Our results suggest that these measures can be employed to generate lower and upper bounds to a quantum code's threshold under the influence of a specific error channel.
Classical simulations of noisy stabilizer circuits are often used to estimate the threshold of a quantum error-correcting code. Physical noise sources are efficiently approximated by random insertions of Pauli operators. For a single qubit, more accurate approximations that still allow for efficient simulation can be obtained by including Clifford operators and Pauli operators conditional on measurement. We examine the feasibility of employing these expanded error approximations to obtain better threshold estimates. We calculate the level-1 pseudothreshold for the Steane [[7,1,3]] code for amplitude damping and dephasing along a non-Clifford axis. The expanded channels estimate the actual channel action more accurately than the Pauli channels before error correction. However, after error correction, the Pauli twirling approximation yields very accurate estimates of the performance of quantum error-correcting protocols in the presence of the actual noise channel.
Quantum error correction (QEC), the lynchpin of fault-tolerant quantum computing (FTQC), is designed and validated against well-behaved Pauli stochastic error models. But in real-world deployment, QEC protocols encounter a vast array of other errors -- coherent and non-Pauli errors -- whose impacts on quantum circuits are vastly different than those of stochastic Pauli errors. The impacts of these errors on QEC and FTQC protocols have been largely unpredictable to date due to exponential classical simulation cost. Here, we show how to accurately and efficiently model the effects of coherent and non-Pauli errors on FTQC, and we study the effects of such errors on syndrome extraction for surface and bivariate bicycle codes, and on magic state cultivation. Our analysis suggests that coherent error can shift fault-tolerance thresholds, increase the space-time cost of magic state cultivation, and can increase logical error rates by an order of magnitude compared to equivalent stochastic errors. These analyses are enabled by a new technique for mapping any Markovian circuit-level error model with sufficiently small error rates onto a detector error model (DEM) for an FTQC circuit. The resulting DEM enables Monte Carlo estimation of logical error rates and noise-adapted decoding, and its parameters can be analytically related to the underlying physical noise parameters to enable approximate strong simulation.
Accurate modeling of noise in realistic quantum processors is critical for constructing fault-tolerant quantum computers. While a full simulation of actual noisy quantum circuits provides information about correlated noise among all qubits and is therefore accurate, it is, however, computationally expensive as it requires resources that grow exponentially with the number of qubits. We propose an efficient systematic construction of approximate noise channels, where their accuracy can be enhanced by incorporating noise components with higher qubit-qubit correlation degree. To formulate such approximate channels, we first present a method, dubbed the cluster expansion approach, to decompose the Lindbladian generator of an actual noise channel into components based on interqubit correlation degree. We generate a k -th order approximate noise channel by truncating the cluster expansion and incorporating noise components with correlations up to the k -th degree. We require that the approximate noise channels must be accurate and also “honest", i.e., the actual errors are not underestimated in our physical models. As an example application, we apply our method to model noise in a three-qubit quantum processor that stabilizes a [[2,0,2]] codeword, which is one of the four Bell states. We find that, for realistic noise strength typical for fixed-frequency superconducting qubits coupled via always-on static interactions, correlated noise beyond two-qubit correlation can significantly affect the code simulation accuracy. Since our approach provides a systematic characterization of multi-qubit noise correlations, it enables the potential for accurate, honest and scalable approximations to simulate large numbers of qubits from full modeling or experimental characterizations of small enough quantum subsystems, which are efficient yet still retain essential noise features of the entire device.
Full accuracy simulations of quantum systems are very costly, and as a result most studies \nof quantum error correction assume a probabilistic Pauli error model, largely because such \nerrors can be e ciently simulated. Therefore, the behaviour of more general noise in a \nquantum error correcting code is poorly characterized. In this thesis, we present results which \ndemonstrate the scaling of the logical noise with respect to the physical delity, and argue \nthat the e ective logical noise approaches a Pauli channel as the code distance increases, \neven when no recovery operations are applied. As a result, we argue that the average logical \n delity can be used to accurately quantify the e ective logical noise, and to select recovery \noperations appropriate to the system. We further demonstrate that when physical noise \nacts on fewer than d qubits in an [[n; k; d]] code, the resultant noise is Pauli, and develop \na method for approximating the dominant contributions to the e ective logical noise up to \na speci ed precision in terms of the physical in delity. We derive conditions under which \nsets of recovery operations will produce equivalent logical noise channels, with examples of \nequivalencies in the 3 qubit repetition code, the 5 qubit code, the Steane code, and the Shor \ncode. We also provide a general expression for the e ective logical noise when the physical \nqubits undergo depolarizing or Pauli noise in a quantum error correcting code, examine the \nbehaviour of depolarizing noise under concatenation of the 5 qubit and Steane codes, and \npresent an algorithm for soft decoding which is not subject to statistical sampling, with an \nemphasis on the e ective behaviour of a concatenated 5 qubit code undergoing depolarizing \nnoise after applying a specialized version our soft decoding algorithm.
Quantum noise is a central challenge in quantum computing across many applications. Extensive work has examined how qubits couple to their environment, leading to decoherence and irreversible relaxation. This work studies a continuous coherent noise model for quantum circuits and compares it with a discrete Pauli model. The focus is on small, coherent gate errors that accumulate across circuit depth. These errors are modeled as random rotations on the Bloch sphere using a von Mises-Fisher distribution. In the small-angle limit, the model reduces to an isotropic Gaussian distribution. We test the model on quantum error-correction circuits based on the [[5,1,3]] and [[7,1,3]] codes. A variant of Grover's search circuit with different qubit counts is also examined. To enable fair comparison, we introduce a model-independent matching scheme. Pauli and continuous noise channels are aligned using the binary entropy at readout. This isolates the effect of noise structure at fixed uncertainty. An approximate analytical method for the propagation of coherent errors is also developed. The method tracks error distributions both on Clifford and non-Clifford circuits without full Monte Carlo sampling. It reduces simulation cost while preserving accuracy for circuit-level error estimates. The approximation is validated against brute-force simulations, identifying its regime of validity with Clifford and non-Clifford circuits under error correction. Our results show that continuous coherent noise and Pauli noise lead to comparable logical-error trends in the stabilizer-code circuits studied here. This behavior is consistent with syndrome extraction projecting a general single-qubit error onto Pauli-error subspaces before recovery. They also show where simplified propagation models work well and where their accuracy is reduced.
We compare the effect of single qubit incoherent and coherent errors on the logical error rate of the Steane [[7,1,3]] quantum error correction code by performing an exact full-density-matrix simulation of an error correction step. We find that the effective 1-qubit process matrix at the logical level reveals the key differences between the error models and provides insight into why the Pauli twirling approximation is a good approximation for incoherent errors and a poor approximation for coherent ones. Approximate channels composed of Clifford operations and Pauli measurement operators that are pessimistic at the physical level result in pessimistic error rates at the logical level. In addition, we observe that the pseudothreshold can differ by a factor of 5 depending on whether the error is calculated using the fidelity or the distance.