Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2103.02188 · New Journal of Physics

Efficient flexible characterization of quantum processors with nested error models

Erik Nielsen, Kenneth Rudinger, Timothy J Proctor, Kevin C Young, Robin Blume-Kohout

Published Sep 1, 2021• 11 citations
arXivHTMLPDF

Abstract

Abstract We present a simple and powerful technique for finding a good error model for a quantum processor. The technique iteratively tests a nested sequence of models against data obtained from the processor, and keeps track of the best-fit model and its wildcard error (a metric of the amount of unmodeled error) at each step. Each best-fit model, along with a quantification of its unmodeled error, constitutes a characterization of the processor. We explain how quantum processor models can be compared with experimental data and to each other. We demonstrate the technique by using it to characterize a simulated noisy two-qubit processor.

DOI
10.1088/1367-2630/ac20b9

Related papers

Wildcard error: Quantifying unmodeled errors in quantum processors

Robin Blume-Kohout, Kenneth Rudinger, Erik Nielsen +2 more

Error models for quantum computing processors describe their deviation from ideal behavior and predict the consequences in applications. But those processors' experimental behavior -- the observed outcome statistics of quantum circuits -- are rarely consistent with error models, even in characterization experiments like randomized benchmarking (RB) or gate set tomography (GST), where the error model was specifically extracted from the data in question. We show how to resolve these inconsistencies, and quantify the rate of unmodeled errors, by augmenting error models with a parameterized wildcard error model. Adding wildcard error to an error model relaxes and weakens its predictions in a controlled way. The amount of wildcard error required to restore consistency with data quantifies how much unmodeled error was observed, in a way that facilitates direct comparison to standard gate error rates. Using both simulated and experimental data, we show how to use wildcard error to reconcile error models derived from RB and GST experiments with inconsistent data, to capture non-Markovianity, and to quantify all of a processor's observed error.

arXiv:2012.12231•Bulletin of the American Physical Society•Dec 22, 2020•15 citations

Detecting and tracking drift in quantum information processors

Timothy J Proctor, Melissa Revelle, Erik Nielsen +5 more

If quantum information processors are to fulfill their potential, the diverse errors that affect them must be understood and suppressed. But errors typically fluctuate over time, and the most widely used tools for characterizing them assume static error modes and rates. This mismatch can cause unheralded failures, misidentified error modes, and wasted experimental effort. Here, we demonstrate a spectral analysis technique for resolving time dependence in quantum processors. Our method is fast, simple, and statistically sound. It can be applied to time-series data from any quantum processor experiment. We use data from simulations and trapped-ion qubit experiments to show how our method can resolve time dependence when applied to popular characterization protocols, including randomized benchmarking, gate set tomography, and Ramsey spectroscopy. In the experiments, we detect instability and localize its source, implement drift control techniques to compensate for this instability, and then demonstrate that the instability has been suppressed.

arXiv:1907.13608•Nature Communications•Oct 26, 2020•124 citations

Probing Context-Dependent Errors in Quantum Processors

Kenneth Rudinger, Timothy J Proctor, Dylan Langharst +3 more

Gates in error-prone quantum information processors are often modeled using sets of one-and two-qubit process matrices, the standard model of quantum errors.However, the results of quantum circuits on real processors often depend on additional external "context" variables.Such contexts may include the state of a spectator qubit, the time of data collection, or the temperature of control electronics.In this article, we demonstrate a suite of simple, widely applicable, and statistically rigorous methods for detecting context dependence in quantum-circuit experiments.They can be used on any data that comprise two or more "pools" of measurement results obtained by repeating the same set of quantum circuits in different contexts.These tools may be integrated seamlessly into standard quantum device characterization techniques, like randomized benchmarking or tomography.We experimentally demonstrate these methods by detecting and quantifying crosstalk and drift on the publicly accessible 16-qubit ibmqx3.

arXiv:1810.05651•Physical Review X•Jun 3, 2019•80 citations

Characterizing Errors in Quantum Information Processors

Yuval R. Sanders

Error-free computation is an unattainable ideal, yet our world now contains many computers that appear error-free to their users. That such things are possible is explained by sophisticated theorems that demonstrate the possibility of efficiently reducing computational errors introduced by reasonably well-behaved noise. My thesis is about the problem of determining whether noise in prototype quantum information processors is sufficiently well-behaved for fault-tolerant quantum computing to be possible. My work is divided into two themes. The first theme is the interpretation of average gate fidelity, a quantity that has become the standard performance metric for assessing progress towards fault tolerance. I have elucidated the connection between average gate fidelity and the requirements of fault-tolerant quantum computing by demonstrating the limits of fidelity as a proxy for error rate, the usual metric in fault-tolerance literature. I thereby conclude that information additional to fidelity is required to assess progress towards fault-tolerance. The second theme is the characterization of two-level defect systems, a particularly deleterious kind of noise that can affect superconducting-integrated-circuit-based quantum computing prototypes. I have designed statistical experimental design algorithms that can rigorously assess the influence of these defect systems, and I helped develop a proposal to mitigate their influence. I thereby demonstrate that existing experimental techniques can become much more powerful by employing advanced data collection procedures. My work has immediate implications for current research efforts towards the first working quantum computer. Theoretical work should be directed at assessing noise sources using metrics other than average gate fidelity, and future experimental characterization techniques should become more modular in order to incorporate advanced statistical inference techniques like the ones I develop herein.

•May 12, 2016•2 citations

Lindblad Tomography of a Superconducting Quantum Processor

Gabriel Samach, Alex Greene, Johannes Borregaard +15 more

As progress is made towards the first generation of error-corrected quantum computers, robust characterization and validation protocols are required to assess the noise environments of physical quantum processors. While standard coherence metrics and characterization protocols such as ${T}_{1}$ and ${T}_{2}$, process tomography, and randomized benchmarking are now ubiquitous, these techniques provide only partial information about the dynamic multiqubit loss channels responsible for processor errors, which can be described more fully by a Lindblad operator in the master equation formalism. Here, we introduce and experimentally demonstrate Lindblad tomography, a hardware-agnostic characterization protocol for tomographically reconstructing the Hamiltonian and Lindblad operators of a quantum noise environment from an ensemble of time-domain measurements. Performing Lindblad tomography on a small superconducting quantum processor, we show that this technique naturally builds on standard process tomography and ${T}_{1}/{T}_{2}$ measurement protocols, characterizes and accounts for state-preparation and measurement errors, and allows one to place bounds on the fit to a Markovian model. Comparing the results of single- and two-qubit measurements on a superconducting quantum processor, we demonstrate that Lindblad tomography can also be used to identify and quantify sources of crosstalk on quantum processors, such as the presence of always-on qubit-qubit interactions.

arXiv:2105.02338•Physical Review Applied•Dec 19, 2022•57 citations

Predictive Models from Quantum Computer Benchmarks

Daniel Hothem, Jordan Hines, Karthik Nataraj +2 more

Holistic benchmarks for quantum computers are essential for testing and summarizing the performance of quantum hardware. However, holistic benchmarks-such as algorithmic or randomized benchmarks-typically do not predict a processor's performance on circuits outside the benchmark's necessarily very limited set of test circuits. In this paper, we introduce a general framework for building predictive models from benchmarking data using capability models. Capability models can be fit to many kinds of benchmarking data and used for a variety of predictive tasks. We demonstrate this flexibility with two case studies. In the first case study, we predict circuit (i) process fidelities and (ii) success probabilities by fitting error rates models to two kinds of volumetric benchmarking data. Error rates models are simple yet versatile capability models which assign effective error rates to individual gates, or more general circuit components. In the second case study, we construct a capability model for predicting circuit success probabilities by applying transfer learning to ResNet50, a neural network trained for image classification. Our case studies use data from cloud-accessible quantum computers and simulations of noisy quantum computers.

arXiv:2305.08796•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•10 citations
Abstract We present a simple and powerful technique for finding a good error model for a quantum processor. The technique iteratively tests a nested sequence of models against data obtained from the processor, and keeps track of the best-fit model and its wildcard error (a metric of the amount of unmodeled error) at each step. Each best-fit model, along with a quantification of its unmodeled error, constitutes a characterization of the processor. We explain how quantum processor models can be compared with experimental data and to each other. We demonstrate the technique by using it to characterize a simulated noisy two-qubit processor.
Error models for quantum computing processors describe their deviation from ideal behavior and predict the consequences in applications. But those processors' experimental behavior -- the observed outcome statistics of quantum circuits -- are rarely consistent with error models, even in characterization experiments like randomized benchmarking (RB) or gate set tomography (GST), where the error model was specifically extracted from the data in question. We show how to resolve these inconsistencies, and quantify the rate of unmodeled errors, by augmenting error models with a parameterized wildcard error model. Adding wildcard error to an error model relaxes and weakens its predictions in a controlled way. The amount of wildcard error required to restore consistency with data quantifies how much unmodeled error was observed, in a way that facilitates direct comparison to standard gate error rates. Using both simulated and experimental data, we show how to use wildcard error to reconcile error models derived from RB and GST experiments with inconsistent data, to capture non-Markovianity, and to quantify all of a processor's observed error.
If quantum information processors are to fulfill their potential, the diverse errors that affect them must be understood and suppressed. But errors typically fluctuate over time, and the most widely used tools for characterizing them assume static error modes and rates. This mismatch can cause unheralded failures, misidentified error modes, and wasted experimental effort. Here, we demonstrate a spectral analysis technique for resolving time dependence in quantum processors. Our method is fast, simple, and statistically sound. It can be applied to time-series data from any quantum processor experiment. We use data from simulations and trapped-ion qubit experiments to show how our method can resolve time dependence when applied to popular characterization protocols, including randomized benchmarking, gate set tomography, and Ramsey spectroscopy. In the experiments, we detect instability and localize its source, implement drift control techniques to compensate for this instability, and then demonstrate that the instability has been suppressed.
Gates in error-prone quantum information processors are often modeled using sets of one-and two-qubit process matrices, the standard model of quantum errors.However, the results of quantum circuits on real processors often depend on additional external "context" variables.Such contexts may include the state of a spectator qubit, the time of data collection, or the temperature of control electronics.In this article, we demonstrate a suite of simple, widely applicable, and statistically rigorous methods for detecting context dependence in quantum-circuit experiments.They can be used on any data that comprise two or more "pools" of measurement results obtained by repeating the same set of quantum circuits in different contexts.These tools may be integrated seamlessly into standard quantum device characterization techniques, like randomized benchmarking or tomography.We experimentally demonstrate these methods by detecting and quantifying crosstalk and drift on the publicly accessible 16-qubit ibmqx3.
Error-free computation is an unattainable ideal, yet our world now contains many computers that appear error-free to their users. That such things are possible is explained by sophisticated theorems that demonstrate the possibility of efficiently reducing computational errors introduced by reasonably well-behaved noise. My thesis is about the problem of determining whether noise in prototype quantum information processors is sufficiently well-behaved for fault-tolerant quantum computing to be possible. My work is divided into two themes. The first theme is the interpretation of average gate fidelity, a quantity that has become the standard performance metric for assessing progress towards fault tolerance. I have elucidated the connection between average gate fidelity and the requirements of fault-tolerant quantum computing by demonstrating the limits of fidelity as a proxy for error rate, the usual metric in fault-tolerance literature. I thereby conclude that information additional to fidelity is required to assess progress towards fault-tolerance. The second theme is the characterization of two-level defect systems, a particularly deleterious kind of noise that can affect superconducting-integrated-circuit-based quantum computing prototypes. I have designed statistical experimental design algorithms that can rigorously assess the influence of these defect systems, and I helped develop a proposal to mitigate their influence. I thereby demonstrate that existing experimental techniques can become much more powerful by employing advanced data collection procedures. My work has immediate implications for current research efforts towards the first working quantum computer. Theoretical work should be directed at assessing noise sources using metrics other than average gate fidelity, and future experimental characterization techniques should become more modular in order to incorporate advanced statistical inference techniques like the ones I develop herein.
As progress is made towards the first generation of error-corrected quantum computers, robust characterization and validation protocols are required to assess the noise environments of physical quantum processors. While standard coherence metrics and characterization protocols such as T1{T}_{1}T1​ and T2{T}_{2}T2​, process tomography, and randomized benchmarking are now ubiquitous, these techniques provide only partial information about the dynamic multiqubit loss channels responsible for processor errors, which can be described more fully by a Lindblad operator in the master equation formalism. Here, we introduce and experimentally demonstrate Lindblad tomography, a hardware-agnostic characterization protocol for tomographically reconstructing the Hamiltonian and Lindblad operators of a quantum noise environment from an ensemble of time-domain measurements. Performing Lindblad tomography on a small superconducting quantum processor, we show that this technique naturally builds on standard process tomography and T1/T2{T}_{1}/{T}_{2}T1​/T2​ measurement protocols, characterizes and accounts for state-preparation and measurement errors, and allows one to place bounds on the fit to a Markovian model. Comparing the results of single- and two-qubit measurements on a superconducting quantum processor, we demonstrate that Lindblad tomography can also be used to identify and quantify sources of crosstalk on quantum processors, such as the presence of always-on qubit-qubit interactions.
Holistic benchmarks for quantum computers are essential for testing and summarizing the performance of quantum hardware. However, holistic benchmarks-such as algorithmic or randomized benchmarks-typically do not predict a processor's performance on circuits outside the benchmark's necessarily very limited set of test circuits. In this paper, we introduce a general framework for building predictive models from benchmarking data using capability models. Capability models can be fit to many kinds of benchmarking data and used for a variety of predictive tasks. We demonstrate this flexibility with two case studies. In the first case study, we predict circuit (i) process fidelities and (ii) success probabilities by fitting error rates models to two kinds of volumetric benchmarking data. Error rates models are simple yet versatile capability models which assign effective error rates to individual gates, or more general circuit components. In the second case study, we construct a capability model for predicting circuit success probabilities by applying transfer learning to ResNet50, a neural network trained for image classification. Our case studies use data from cloud-accessible quantum computers and simulations of noisy quantum computers.