arXiv:1909.04432

Markov chains for error accumulation in quantum circuits

Long Ma, Jaron Sanders

Published Sep 10, 2019• 0 citations

Abstract

We study a model for the accumulation of errors in multi-qubit quantum computations, as well as a model describing continuous errors accumulating in a single qubit. By modeling the error process in a quantum computation using two coupled Markov chains, we are able to capture a weak form of time-dependency between errors in the past and future. By subsequently using techniques from the field of discrete probability theory, we calculate the probability that error measures such as the fidelity and trace distance exceed a threshold analytically. The formulae cover fairly generic error distributions, cover multi-qubit scenarios, and are applicable to e.g. the randomized benchmarking protocol. To combat the numerical challenge that may occur when evaluating our expressions, we additionally provide an analytical bound on the error probabilities that is of lower numerical complexity, and we also discuss a state space reduction that occurs for stabilizer circuits. Finally, taking inspiration from the field of operations research, we illustrate how our expressions can be used to e.g. decide how many gates one can apply before too many errors accumulate with high probability, and how one can lower the rate of error accumulation in existing circuits through simulated annealing.

DOI: 10.48550/arxiv.1909.04432

Related papers

Fidelity decay and error accumulation in random quantum circuits

Nadir Samos Sáenz de Buruaga, Rafał Bistroń, Marcin Rudziński +3 more

Fidelity decay captures the inevitable state degradation in any practical implementation of a quantum process. We devise bounds for the decay of fidelity for a generic evolution given by a random quantum circuit model that encompasses errors arising from the implementation of two-qubit gates and qubit permutations. We show that fidelity decays exponentially with both circuit depth and the number of qubits raised to an architecture-dependent power and we determine the decay rates as a function of the amplitude of the aforementioned errors. Furthermore, we demonstrate the utility of our results in benchmarking quantum processors using the quantum volume figure of merit and provide insights into strategies for improving processor performance. These findings pave the way for understanding how states evolving under generic quantum dynamics degrade due to the accumulation of different kinds of perturbations.

arXiv:2404.11444SciPost PhysicsJul 8, 20253 citations

An Efficient Analytical Approach for Error Assessment in Quantum Circuits

Eesa Nikahd, Naser Mohammadzadeh, Zahra Shirmohammadi

One of the most important challenges in constructing large-scale quantum computers is handling the high error rates in quantum systems. Using error correction codes and frequently applying error correction on qubits is a common approach to compete with this challenge. Quantum error analysis techniques are required to compare the effectiveness of error correction codes and also to efficiently insert the error correction procedures (ECPs) in a quantum circuit. However, most existing assessment approaches are either inaccurate and inefficient or are slow and time-consuming. To address these problems, in this paper, a fast analytical approach is proposed that analyzes errors and smartly inserts ECPs into a quantum circuit and finally estimates the failure probability of the circuit. The approach is also able to estimate the pseudo-threshold of quantum error correction codes. Experimental results show that the proposed method improves the number of ECPs and the latency of the circuit encoded by the Steane’s [[7, 1, 3]] code on average by about 52.6% and 29.4% for the one-level one and by about 79.4% and 48.5% for the two-level concatenated code respectively compared with a related method in the literature. Moreover, the proposed method takes only a few seconds to run on even our relatively large benchmark circuits.

IEEE AccessJan 1, 20250 citations

Continuous Noise Model for Quantum Circuits

Yunos El Kaderi, Andreas Honecker, Iryna Andriyanova

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.

quant-pharXiv:2604.26008Apr 30, 20260 citations

Real-time measurement error mitigation for one-way quantum computation

Tobias Hartung, S. Schuster, Joachim von Zanthier +1 more

Abstract We propose a quantum error mitigation scheme for single-qubit measurement errors, particularly suited for one-way quantum computation. Contrary to well established error mitigation methods for circuit-based quantum computation that require the circuits to be run several times, our method is capable of mitigating measurement errors in real time during the processing measurements in the one-way computation. For that, an ancillary qubit register is entangled with the to-be-measured qubit and additionally measured afterwards. By using a voting protocol on all measurement outcomes, occurring measurement errors can be mitigated in real time while the one-way computation continues. We provide an analytical expression for the probability to detect a measurement error depending on the error rate and the number of ancilla qubits. From this, we derive an estimate of the ancilla register size for a given measurement error rate and a required success probability to detect a measurement error. Additionally, we consider the CNOT gate error in our mitigation method and investigate how this influences the probability to detect a measurement error. Finally, we show in proof-of-principle simulations and in experiments executed on IBM quantum hardware that our method is capable of reducing the measurement errors significantly in a one-way quantum computation with only a small number of ancilla qubits.

arXiv:2411.09084Scientific ReportsSep 19, 20260 citations

Robust error accumulation suppression for quantum circuits

Tatsuki Odake, Philip Taranto, Nobuyuki Yoshioka +4 more

We present a (REAS) technique to manage errors in quantum computers. Our method reduces the accumulation of errors in any quantum circuit composed of single- or two-qubit gates expressed as e − i σ θ for Pauli operators σ and θ ∈ [ 0 , π ) , which forms a universal gate set. For coherent errors, which include gate overrotation and crosstalk, we demonstrate a reduction of the error scaling in an L -depth circuit from O ( L ) to O ( L ) . This asymptotic error suppression behavior can be proven in a regime where all gates, including those constituting the error-suppressing protocol itself, are noisy. Going beyond coherent errors, we derive the general form of decoherence noise that can be suppressed by REAS. Lastly, we experimentally demonstrate the effectiveness of our approach regarding realistic errors using 100-qubit circuits with up to 64 two-qubit gate layers on IBM Quantum processors.

arXiv:2401.16884Physical Review ResearchJun 3, 20250 citations

Error accumulation in dissipative quantum circuits

Nadir Samos-Sáenz de Buruaga, Rodrigo M. C. Pereira, Karol Życzkowski +2 more

Present-day quantum processors are open systems in which dissipation and decoherence degrade the information carried by a quantum state as it propagates through a circuit. We study this degradation in dissipative random quantum circuits, modeling each two-qubit gate as a diluted unitary that interpolates between the intended unitary operation and a random dissipative quantum channel. Using the fidelity between the ideal and noisy output states as a diagnostic, we show that sufficiently random unitary gates or dissipative Kraus operators lead to a universal decay of the average fidelity. This decay is determined only by the dissipation strength, system size, and circuit depth, while microscopic details of the gates and noise, including the Kraus rank, appear only in subleading corrections to higher moments. We derive a closed-form expression for the average fidelity in terms of three physically meaningful error parameters, dissipation strength, coherent two-qubit gate-error strength, and connectivity-error probability. Finally, we identify the cases when dissipative effects can be reproduced by an unitary-noise model and when dissipation-induced decoherence remains distinguishable from coherent noise at the level of the average fidelity.

quant-pharXiv:2609.01848Sep 3, 20260 citations