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.
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.
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.
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.
In this thesis, we are concerned with the problem of characterizing noise associated with implementations of quantum circuits. We first explore the notion of error rates of quantum circuits and argue that the semantic distinction between process fidelity as “average error rate” and diamond distance as “worst-case error rate” is wrong. To this end, we analyze their worst-case and average analogies, and show they are proportional to their original measures. We show that the non-unital contributions to the diamond distance are negligible and the discrepancy between the process fidelity and diamond distance is primarily due to unitary errors. \n \nWe then turn to a new analysis of cycle benchmarking, a randomized benchmarking-like protocol to estimate the process fidelity of a cycle as engineered by randomized compiling. Using this approach, we prove that gate-dependent noise on the randomized gates is de- scribed by a single perturbation term that decays rapidly as long as the implementation is close to a representation. We also comment on how the protocol can be extended to qudits, what the cycle benchmarking decay actually measures, and how our analysis is amenable to the Fourier analysis of randomized benchmarking. We end with a discussion of how the gate-dependent cycle benchmarking process fidelity relates to gate-dependent randomized compiling.
In practical randomized benchmarking of logical gates for quantum computation, partial averaging is sometimes used to simplify the implementation. For instance, for two-qubit gates, averaging over only single-qubit operations is much easier to realize than the full averaging. We analyze such simplified, partial averaging and demonstrate that, unlike for the standard randomized benchmarking, the measured decay law of fidelity is a linear combination of several exponentials with different decay factors (3 for two qubits and single-bit averaging). The evolution with the sequence length is given by an iteration matrix, whose eigenvalues give the decay factors. For generic two-qubit gates two contributions decay fast and are barely visible, while the third factor characterizes a combination of gate errors in three channels. While the decay factor of this slowest exponential is close to that in the standard randomized benchmarking, we demonstrate that they differ in general and find this correction to the leading order. Furthermore, via a connection to the local invariants of two-qubit gates we find all exceptional gates, with more than one slow exponential, and analyze possibilities to extract their decay factors from the measured curves.
Randomized benchmarking (RB) protocols have become an essential tool for providing a meaningful partial characterization of experimental quantum operations. While the RB decay rate is known to enable estimates of the average fidelity of those operations under gate-independent Markovian noise, under gate-dependent noise this rate is more difficult to interpret rigorously. In this paper, we prove that single-qubit RB decay parameter p coincides with the decay parameter of the gate-set circuit fidelity , a novel figure of merit which characterizes the expected average fidelity over arbitrary circuits of operations from the gate-set. We also prove that, in the limit of high-fidelity single-qubit experiments, the possible alarming disconnect between the average gate fidelity and RB experimental results is simply explained by a basis mismatch between the gates and the state-preparation and measurement procedures, that is, to a unitary degree of freedom in labeling the Pauli matrices. Based on numerical evidence and physically motivated arguments, we conjecture that these results also hold for higher dimensions.
As quantum-computing platforms are susceptible to noise, the fidelity of quantum operations is limited by decoherence. Understanding this limitation is crucial for building utility-scale quantum processors. In previous works [Phys. Rev. Lett. 129, 150504 (2022); Quantum 9, 1684 (2025)], we presented analytical formulae for the average gate fidelity of multi-qubit operations under static Markovian noise processes, including operations that temporarily leave the computational subspace. However, some quantum-computing architectures dynamically modulate qubit or coupler frequencies to implement two-qubit gates, e.g., baseband flux gates; such modulation can lead to dissipation rates varying in time. In this Letter, we therefore generalize the fidelity-reduction formulae to encompass time-dependent dissipation. Applying our generalized formula, we obtain a fidelity bound for adiabatic operations and demonstrate that flux-dependent noise sensitivity, combined with qubit-coupler hybridization, significantly reduces the fidelity of adiabatic controlled-Z (CZ) gates in superconducting quantum computers. Our work thus provides essential theoretical tools for evaluating error budgets and optimizing the design of quantum operations in tunable quantum-computing architectures, and may also find applications in quantum-sensing and quantum-communication protocols that are affected by time-dependent dissipation.