12. Noise, Error Management, Benchmarking and Resource Estimation

Introduction and Context

Quantum algorithms are usually described as if gates act exactly, qubits remain isolated until deliberately measured, and measurement returns the intended state without ambiguity. Real quantum processors satisfy none of these assumptions perfectly. Quantum information is encoded in physical systems that interact with their environment, and these interactions disturb amplitudes, phases, and correlations. Control electronics introduce imperfections; gates may be over- or under-rotated; readout devices may confuse outcomes; and finite sampling makes every estimated expectation value uncertain.

For quantum artificial intelligence (QAI), these problems are especially important. Many quantum machine-learning algorithms infer a small performance difference from noisy expectation values. A classifier may appear accurate because of a measurement bias, while a variational optimizer may converge to a hardware-dependent artifact rather than a useful minimum. Consequently, a QAI system must be evaluated not only by whether its circuit is mathematically correct, but also by whether its result is statistically reliable, reproducible, scalable, and economically defensible.

This chapter develops a practical and analytical framework for noise, error management, benchmarking, and resource estimation. It distinguishes physical noise from statistical uncertainty, explains mitigation and fault-tolerant correction, introduces benchmarking metrics, and shows how to estimate qubits, gates, measurements, runtime, energy, and cost. The central principle is that a quantum result is meaningful only when its quality is related to the noise model, experimental evidence, and resources required to obtain it.

Learning Objectives

By the end of this chapter, a student should be able to:

1. Distinguish decoherence, gate error, measurement error, crosstalk, leakage, and sampling uncertainty.

2. Model common quantum noise channels and interpret their effects on circuits and QAI workflows.

3. Compare error suppression, error mitigation, and quantum error correction.

4. Explain the logic of zero-noise extrapolation, probabilistic error cancellation, measurement-error mitigation, and symmetry verification.

5. Design a meaningful benchmarking study using accuracy, fidelity, runtime, sample complexity, scalability, energy, and cost.

6. Estimate physical and logical resources for near-term and fault-tolerant applications.

7. Identify methodological, organizational, ethical, and governance risks in reporting quantum performance.

1. The Sources and Meaning of Quantum Error

A useful first distinction is between an error in the quantum state and uncertainty in our estimate of that state. If a circuit ideally produces state $\rho$, but the hardware produces $\tilde{\rho}$, the difference is physical noise. If the hardware produces $\tilde{\rho}$ correctly but the experiment uses only a finite number of shots, the estimate of an observable still fluctuates. The first problem is bias or distortion in the quantum process; the second is statistical variance.

1.1 Decoherence and loss of coherence

Decoherence is the loss of quantum coherence caused by unwanted interaction with the environment. Two time constants are commonly used. The relaxation time, $T_1$, describes energy decay, such as the transition from an excited state $|1\rangle$ to $|0\rangle$. The dephasing time, $T_2$, describes the loss of a stable relative phase between basis states. Usually $T_2\leq 2T_1$, although device-specific noise can make the effective relationship more complicated.

For a qubit initially in a superposition, amplitude damping reduces the excited-state population and dephasing suppresses off-diagonal density-matrix terms. A simple approximation for a gate of duration $t_g$ gives survival factors that decrease with $t_g/T_1$ and $t_g/T_2$. These expressions are not complete device models, but they explain why shorter circuits and longer coherence times generally improve performance.

1.2 Gate and control errors

Gate errors arise when the implemented operation differs from the intended unitary. Systematic errors include calibration drift, pulse-amplitude errors, frequency detuning, phase error, and timing misalignment. Stochastic errors vary from execution to execution. A rotation intended to be $R_x(\theta)$ might instead implement $R_x(\theta+\delta)$; a two-qubit entangling gate may create unwanted residual interactions with neighboring qubits.

The distinction between coherent and incoherent error is operationally important. Coherent errors can accumulate predictably and sometimes produce large biases, even when their average error rate appears small. Incoherent errors randomize information and generally reduce fidelity. Randomized compiling and deliberate Pauli twirling are examples of techniques used to transform some coherent errors into more manageable stochastic errors, although the transformation itself must be experimentally validated.

1.3 Measurement errors

Measurement is not necessarily a faithful conversion of a quantum state into a classical bit. A readout assignment matrix for one qubit can be written as

$M=\begin{pmatrix}P(0|0)&P(0|1)\\P(1|0)&P(1|1)\end{pmatrix}$.

Ideally, the diagonal terms are one. In practice, a prepared zero may be reported as one, or a prepared one may be reported as zero. In multiqubit systems, readout errors can be correlated. Measurement mitigation attempts to estimate and invert, exactly or approximately, this assignment process.

1.4 Crosstalk, leakage, and drift

Crosstalk occurs when operating one qubit changes another qubit's state or error rate. Leakage occurs when a physical qubit leaves the computational subspace, for example by occupying a higher energy level in a system whose physical carrier is not an ideal two-level object. Leakage is particularly troublesome because ordinary computational-basis error models may fail to represent it.

Drift is a change in device behavior over time. Calibration data collected in the morning may not characterize a circuit executed later. Temperature, control electronics, environmental conditions, and maintenance can alter error rates. Reproducibility therefore requires timestamped calibration, device identification, circuit versioning, and repeated measurements.

2. Models for Noise and Error

Noise models are abstractions used to predict, diagnose, and simulate hardware behavior. No single model is universally correct; the appropriate model depends on the device, timescale, circuit, and purpose of the analysis.

2.1 Quantum channels

A general noisy operation is represented by a completely positive trace-preserving map:

$\mathcal{E}(\rho)=\sum_k E_k\rho E_k^\dagger$, where $\sum_k E_k^\dagger E_k=I$.

The operators $E_k$ are Kraus operators. Important channels include:

• Bit flip: $\mathcal{E}(\rho)=(1-p)\rho+pX\rho X$.
• Phase flip: $\mathcal{E}(\rho)=(1-p)\rho+pZ\rho Z$.
• Depolarizing noise: with some probability, the state is replaced by a mixture that reduces directional information on the Bloch sphere.
• Amplitude damping: population decays toward the ground state.
• Phase damping: off-diagonal coherence decays without necessarily changing populations.

These channels help compare algorithms and devices, but independent identically distributed noise is often unrealistic. Noise may be temporally correlated, spatially correlated, non-Markovian, state dependent, or gate dependent. A simulation that assumes independent depolarizing noise can therefore overestimate or underestimate actual performance.

2.2 Error measures

Several measures describe the distance between an ideal and an implemented operation. State fidelity quantifies the overlap of two states. Process fidelity compares quantum channels. Trace distance provides an operational distinguishability bound. Average gate fidelity summarizes performance over input states, whereas worst-case measures are more conservative. No single scalar captures all failure modes: a device can have good average fidelity but poor performance on a particular entangled state or algorithm.

For an observable $O$, the practical quantity is often the estimation error

$\epsilon_O=|\langle O\rangle_{\mathrm{estimated}}-\langle O\rangle_{\mathrm{ideal}}|$.

This incorporates both hardware bias and finite-shot variation. In QAI, observable error should be connected to application-level quantities such as loss, classification accuracy, calibration error, or decision quality.

3. Managing Error: From Circuit Design to Fault Tolerance

Error management is a hierarchy rather than a single technique. It begins with preventing avoidable errors, continues with estimating and reducing the impact of residual errors, and ultimately uses redundancy to protect logical information.

3.1 Error suppression and hardware-aware design

Error suppression changes the experiment so that fewer errors occur. Examples include reducing circuit depth, mapping logical qubits to well-connected physical qubits, choosing native gates, scheduling operations to avoid idle time, dynamical decoupling, pulse shaping, and calibration. Compilation should optimize not merely gate count but a weighted cost reflecting the error rates and durations of specific gates.

A useful workflow is to transpile a circuit for several candidate layouts, estimate their noise-weighted costs, and validate the best candidates experimentally. Approximate compilation may be preferable to exact synthesis when a small change in circuit structure substantially reduces two-qubit operations. In variational algorithms, ansatz design is itself an error-management decision: excessive expressibility can increase depth and create optimization difficulties without improving generalization.

3.2 Error mitigation

Error mitigation estimates the ideal result from noisy executions without encoding every logical qubit into a large error-correcting block. It generally does not restore the quantum state; it attempts to improve selected expectation values. Mitigation is therefore problem dependent and can increase sampling cost.

Measurement-error mitigation characterizes a calibration matrix and corrects observed outcome frequencies. Direct matrix inversion can produce negative quasi-probabilities and amplify statistical noise. Factorized or constrained methods trade some accuracy for computational stability.

Zero-noise extrapolation (ZNE) executes circuits at several effective noise levels, obtained through pulse stretching, gate folding, or other transformations. If the measured observable is $E(\lambda)$ at noise scale $\lambda$, one extrapolates toward $E(0)$. Linear, polynomial, or Richardson extrapolation may be used. The method depends on a sufficiently smooth noise-scaling relationship and can become unstable when extrapolation is far outside the measured range.

Probabilistic error cancellation (PEC) represents noisy operations as a quasiprobabilistic combination of implementable operations. Sampling these operations can cancel error in expectation, but the variance overhead may grow rapidly with circuit size. PEC is therefore valuable for small circuits but difficult to scale.

Symmetry verification and post-selection reject results that violate known properties, such as particle-number parity or a conserved symmetry. This can improve accuracy when valid states are concentrated in a known subspace, but discarding data increases sample requirements and may introduce bias if the assumed symmetry is not exact.

Virtual distillation and related methods use multiple copies or structured measurements to suppress certain errors. They can improve estimates but require additional circuits and measurements. In all mitigation methods, an improvement in bias must be reported together with the variance and resource overhead.

3.3 Quantum error correction

Quantum error correction (QEC) encodes one logical qubit into several physical qubits. Unlike classical copying, which is prohibited for unknown quantum states, QEC distributes information across an entangled code space. Syndrome measurements reveal information about errors without directly revealing the encoded logical state. A decoder maps syndrome data to a correction or a frame update.

A code has parameters describing the number of logical qubits, physical qubits, and distance. The code distance is related to the number of errors that can be detected or corrected. Surface codes are prominent because they use local interactions and have relatively high thresholds under suitable noise assumptions. However, the threshold is not a guarantee of practical efficiency: below-threshold operation may still require substantial physical overhead, and real devices include leakage, correlated errors, measurement faults, and decoder latency.

The fault-tolerant objective is to implement logical gates whose effective error decreases as code distance increases, provided physical error rates and architecture satisfy the assumptions of the fault-tolerance scheme. Logical operations may require transversal gates, lattice surgery, magic-state preparation and distillation, or other specialized procedures. Resource estimation must therefore include not only data qubits but also ancillas, syndrome-extraction circuits, decoding, communication, and factory capacity.

4. Benchmarking Quantum Systems and QAI Workloads

Benchmarking is a controlled process for comparing performance under defined conditions. A single headline metric is inadequate. Benchmarking should specify the task, data, circuit compilation, device, calibration period, number of shots, statistical confidence, and classical baseline.

4.1 Application-level metrics

For a QAI classifier, relevant metrics include accuracy, balanced accuracy, precision, recall, F1 score, area under the ROC curve, calibration error, and loss. For regression, one may use mean absolute error, root mean square error, or uncertainty calibration. For generative or sampling tasks, distributional distances, likelihood proxies, kernel measures, and task-specific utility may be appropriate.

The quantum implementation should be compared with a classical baseline using the same data partition and evaluation protocol. A quantum model that slightly exceeds a weak baseline is not evidence of quantum advantage. Hyperparameter searches, preprocessing, and feature selection must be counted fairly because they can dominate total computation.

4.2 Accuracy, fidelity, and statistical confidence

A reported accuracy is an estimate, not an exact property. Confidence intervals or bootstrap intervals should accompany it. If two models differ by less than the uncertainty caused by test-set size, shot noise, and device variation, the difference should not be interpreted as meaningful.

Repeated runs on different days or devices reveal robustness. It is useful to separate three sources of variation: variation across shots, variation across repeated executions under the same calibration, and variation across calibrations or hardware instances.

4.3 Runtime and sample complexity

Quantum runtime includes compilation, queueing, initialization, circuit execution, measurement, classical post-processing, and possibly error-mitigation overhead. Wall-clock time can be much greater than circuit duration. For an observable with variance $\operatorname{Var}(O)$, the number of independent shots required to estimate its mean to additive precision $\epsilon$ with fixed confidence generally scales on the order of $\operatorname{Var}(O)/\epsilon^2$. Mitigation can increase the effective variance, sometimes substantially.

Sample complexity is especially important in variational QAI. A circuit may be shallow but require thousands of expectation estimates per optimization step. The total measurement budget is approximately

$N_{\mathrm{total}}=N_{\mathrm{steps}}\times N_{\mathrm{parameters\ or\ terms}}\times N_{\mathrm{shots}}$.

This simple expression exposes why optimizer choice, parameter grouping, stopping criteria, and observable structure matter.

4.4 Scalability and reproducibility

Scalability concerns how resource requirements grow with qubit count, feature dimension, data size, precision, and circuit depth. A useful benchmark reports scaling curves rather than one data point. Reproducibility requires publishing circuits, seeds where relevant, preprocessing, transpiler settings, hardware metadata, mitigation settings, and raw or sufficiently detailed measurement data.

Randomized benchmarking, cross-entropy-style tests, cycle benchmarking, and gate-set tomography serve different purposes. Randomized benchmarking estimates average error behavior under a prescribed random sequence; it should not be treated as a direct prediction of application performance. Tomographic methods can be more informative but are expensive and sensitive to model assumptions.

5. Resource Estimation for Quantum Applications

Resource estimation translates an algorithm into physical requirements. It is a design activity, not a final accounting exercise.

5.1 Layers of resources

At the algorithmic level, estimate logical qubits, logical gate counts, circuit depth, number of repetitions, precision, and classical optimization work. At the fault-tolerant level, translate these into code distance, physical qubits per logical qubit, logical gate duration, syndrome cycles, ancillas, and magic-state factories. At the system level, include control electronics, cryogenic infrastructure, memory, networking, decoding hardware, and facility power.

For a simple execution, total time can be decomposed as

$T_{\mathrm{total}}=T_{\mathrm{queue}}+T_{\mathrm{compile}}+N_{\mathrm{shots}}(T_{\mathrm{reset}}+T_{\mathrm{circuit}}+T_{\mathrm{readout}})+T_{\mathrm{postprocess}}$.

For repeated optimization, this quantity is multiplied by the number of iterations and objective evaluations. Error mitigation adds calibration and repeated scaled circuits. Fault tolerance adds syndrome extraction and decoding overhead.

5.2 Precision and algorithmic requirements

Resource estimates must begin with a target output precision and failure probability. A chemical-energy estimate, a classifier probability, and a search decision have different accuracy requirements. Overly precise targets can inflate resources without changing the decision. Conversely, an estimate that ignores precision may be unusable.

A practical estimation procedure is:

1. Define the application output and acceptable error.

2. Express the algorithm in logical operations and measurements.

3. Determine shot requirements and repetition structure.

4. Select an error-management strategy.

5. Map logical requirements to a hardware architecture.

6. Estimate time, qubits, energy, cost, and uncertainty.

7. Perform sensitivity analysis on physical error rate, coherence, queueing, and decoder assumptions.

5.3 Energy and economic cost

Quantum energy accounting is broader than the energy of a gate pulse. It may include control electronics, refrigeration, lasers or microwave systems, classical optimization, data storage, and facility overhead. A fair comparison with classical computing should use the same functional objective and include preprocessing and postprocessing.

Cost may be estimated from cloud execution charges, machine time, engineering labor, calibration, facility operation, and opportunity cost. Since hardware and pricing change rapidly, estimates should be presented as assumptions and ranges rather than false precision. The relevant question is often not whether a quantum processor is inexpensive in isolation, but whether it delivers sufficient value per unit cost compared with a classical or hybrid alternative.

6. Applied Case: Evaluating a Noisy Quantum Kernel Classifier

The following is an illustrative case, not a report of a particular commercial experiment.

Background

A financial-technology research group investigates a quantum kernel classifier for a binary credit-risk screening task. The dataset contains a modest number of normalized features, and a classical support-vector machine is already available. The team hopes that a quantum feature map will improve classification with a small number of qubits.

Situation and problem

On a simulator without noise, the quantum model achieves higher validation accuracy than the classical baseline. On a superconducting processor, however, accuracy varies considerably across runs. The circuit contains several entangling layers, and the measured kernel values are affected by readout errors. A preliminary report compares only the best hardware run with the classical average, creating a misleading impression of advantage.

Analysis

The team first separates sources of uncertainty. Repeated shots show substantial sampling variation for individual kernel entries. Calibration experiments reveal asymmetric readout assignment errors. Device data also indicate that two-qubit gates have considerably higher error than single-qubit gates. The compiled circuit has unnecessary entangling operations because the initial mapping ignored hardware connectivity.

The group defines an evaluation protocol: fixed training and test partitions, five independent hardware sessions, equal hyperparameter-search budgets, confidence intervals, and a cost accounting that includes circuit repetitions. It records accuracy, balanced accuracy, kernel-estimation error, shots per example, wall-clock time, and cloud execution cost.

Approach

The circuit is recompiled using a connectivity-aware layout and a shallower feature map. Readout calibration is performed before each session, and measurement-error mitigation is applied with a constrained correction method. The team also evaluates a symmetry check available in the circuit, but retains it only if the reduction in bias exceeds the increase in variance. Rather than reporting a single result, it compares noisy, mitigated, and ideal-simulator results.

Outcome

The mitigated classifier performs better than the unmitigated implementation on average, but the confidence interval overlaps the classical baseline. The optimized circuit reduces execution time and cost, while the main remaining limitation is shot demand. The study therefore concludes that the experiment demonstrates a technically credible QAI workflow, not a production-level quantum advantage.

Learning points

The case illustrates five principles. First, simulator accuracy is not hardware accuracy. Second, mitigation must be evaluated by total error and variance, not bias alone. Third, fair benchmarking requires equal data and tuning protocols. Fourth, reproducibility depends on repeated sessions and hardware metadata. Finally, a negative or inconclusive result can still guide architecture and resource decisions.

7. Challenges, Risks, and Professional Judgement

The most common error is to report a favorable metric without defining its denominator, uncertainty, or baseline. Other mistakes include comparing different train-test splits, ignoring queue time, treating calibration data as permanent, counting only quantum circuit duration, and claiming scalability from a small instance.

Noise models can also create false confidence. If a simulator omits correlated errors or leakage, an algorithm may appear robust while failing on hardware. Mitigation may amplify variance, generate nonphysical intermediate probabilities, or conceal instability through selective post-processing. Error correction estimates can be equally fragile when they assume ideal decoders, independent noise, or unlimited communication.

Professional reporting should distinguish measured facts, modeled projections, and speculative assumptions. A resource estimate should include uncertainty ranges and sensitivity analysis. Governance teams should ask whether data preprocessing leaks labels, whether sensitive data are sent to an external quantum service, and whether a noisy model is being used in a high-impact decision without adequate validation.

Quantum benchmarking also has an ethical dimension. Marketing claims based on cherry-picked circuits can misallocate research funds and distort public understanding. In regulated domains, auditability, traceability, model-risk management, and human oversight remain necessary even when the underlying model is quantum. Quantum computation does not remove duties of fairness, privacy, security, or accountability.

8. Emerging Directions and Best Practices

Current research is moving toward hardware-efficient error mitigation, tailored noise learning, better decoders, leakage reduction, correlated-noise characterization, and co-design of algorithms, compilers, control systems, and codes. Logical qubit demonstrations are increasing in importance, but logical performance must still be connected to application-level utility and system-level resources.

A disciplined QAI project should adopt the following practices:

• Define the application metric and required precision before selecting a circuit.
• Characterize the target hardware near the time of execution.
• Report both raw and mitigated results, including variance and overhead.
• Use classical baselines with matched data, tuning, and computational budgets.
• Track circuit depth, two-qubit count, shots, queue time, and post-processing.
• Repeat experiments across sessions and disclose failed or excluded runs.
• Treat resource estimates as parameterized models with sensitivity analysis.
• Separate near-term noisy claims from fault-tolerant projections.
• Preserve experiment metadata sufficiently for independent reproduction.

Chapter Summary

Quantum computation is affected by decoherence, imperfect gates, measurement error, crosstalk, leakage, drift, and finite-shot uncertainty. Quantum channels provide formal models, while fidelity, trace distance, observable error, and application metrics provide different views of performance. Error management ranges from hardware-aware circuit design and calibration to mitigation methods such as measurement correction, zero-noise extrapolation, probabilistic error cancellation, and symmetry verification. These methods improve estimates rather than creating a protected logical state and may impose substantial sampling overhead.

Quantum error correction uses encoded logical states, syndrome extraction, decoding, and fault-tolerant operations to reduce logical error under suitable physical and architectural conditions. Benchmarking must combine accuracy, confidence intervals, runtime, sample complexity, scalability, reproducibility, and fair classical comparison. Resource estimation begins with precision and failure requirements, then accounts for logical operations, shots, physical qubits, control, decoding, energy, and cost. Sound professional practice distinguishes measured results from projections and avoids claims unsupported by uncertainty analysis.

Key Terms

Decoherence: Loss of quantum coherence caused by unwanted environmental interaction.

$T_1$: Relaxation time describing energy decay toward the ground state.

$T_2$: Dephasing time describing decay of relative phase coherence.

Quantum channel: A completely positive trace-preserving map representing a noisy quantum operation.

Kraus operator: An operator used to represent the components of a quantum channel.

Crosstalk: Unwanted influence of one qubit or operation on another.

Leakage: Departure of a physical qubit from the intended computational subspace.

Readout error: Incorrect assignment of a measured quantum state to a classical outcome.

Sampling uncertainty: Statistical variation caused by estimating probabilities or observables from finite shots.

Error suppression: Circuit, hardware, or control techniques that reduce errors before execution.

Error mitigation: Estimation techniques that reduce the effect of errors without fully encoding logical information.

Zero-noise extrapolation: Estimation of a zero-noise result from executions at several increased noise levels.

Probabilistic error cancellation: Quasiprobabilistic reconstruction of ideal operations from noisy implementable operations.

Symmetry verification: Rejection or correction of results that violate a known conserved property.

Quantum error correction: Encoding and syndrome-based processing used to protect logical quantum information.

Logical qubit: An error-protected qubit encoded across multiple physical qubits.

Code distance: A code parameter related to the number of errors detectable or correctable.

Sample complexity: Number of observations or circuit shots required to achieve a specified estimation precision.

Resource estimation: Structured prediction of qubits, operations, time, energy, cost, and supporting infrastructure.

Randomized benchmarking: Experimental method for estimating average error behavior using randomized gate sequences.

Review Questions

Short Answer Questions

1. Distinguish physical noise from sampling uncertainty in a quantum experiment.

2. What do $T_1$ and $T_2$ measure?

3. Why can measurement-error mitigation increase statistical variance?

4. State the main purpose of syndrome measurement in quantum error correction.

5. Name four components that should be included in a realistic quantum runtime estimate.

Long Answer Questions

1. Explain the major sources of error in a quantum processor and relate each to a suitable characterization method.

2. Compare error suppression, error mitigation, and quantum error correction in terms of mechanism, benefits, and resource requirements.

3. Explain zero-noise extrapolation and probabilistic error cancellation, including their assumptions and limitations.

4. Develop a benchmarking framework for a quantum machine-learning classifier that includes accuracy, uncertainty, runtime, sample complexity, and a classical baseline.

5. Describe the stages of a fault-tolerant resource-estimation workflow from application precision to physical-system requirements.

Analytical / Application Questions

1. A variational QAI circuit has low gate depth but requires 200 parameter evaluations per optimization step, each using 5,000 shots for 100 steps. Estimate the total number of shots and discuss two ways to reduce the measurement burden.

2. A mitigated experiment has lower systematic bias but four times the variance of the unmitigated experiment. Explain how the researcher should decide whether mitigation is beneficial.

3. A quantum classifier outperforms a classical baseline by one percentage point, but the difference is smaller than the confidence interval and the quantum method costs twenty times more to run. Evaluate whether a claim of practical advantage is justified.

22. Multiple Choice Questions with Answers

Question 1

Which statement best distinguishes decoherence from sampling uncertainty?

A. Decoherence is caused by finite shots, whereas sampling uncertainty is caused by environmental interaction.

B. Decoherence changes the physical quantum state, whereas sampling uncertainty arises when estimating results from finite measurements.

C. Both terms describe exactly the same phenomenon.

D. Sampling uncertainty occurs only in fault-tolerant quantum computers.

Correct Answer: B. Decoherence changes the physical quantum state, whereas sampling uncertainty arises when estimating results from finite measurements.

Question 2

A circuit's measured observable is evaluated at several deliberately increased noise levels and extrapolated toward zero noise. Which technique is being used?

A. Quantum error correction

B. Randomized benchmarking

C. Zero-noise extrapolation

D. Syndrome decoding

Correct Answer: C. Zero-noise extrapolation

Question 3

Why can probabilistic error cancellation become impractical for large circuits?

A. It cannot be applied to expectation values.

B. It requires the quantum state to be copied exactly.

C. Its sampling variance and resource overhead can grow substantially with circuit size.

D. It eliminates the need for calibration.

Correct Answer: C. Its sampling variance and resource overhead can grow substantially with circuit size.

Question 4

Which resource is most directly increased when a variational algorithm uses more shots per expectation estimate?

A. Sampling cost and execution time

B. The code distance automatically

C. The physical energy gap of the qubits

D. The number of training labels

Correct Answer: A. Sampling cost and execution time

Question 5

A prepared state is often reported as 1 even when the intended state is 0. This is primarily an example of:

A. Readout assignment error

B. Logical under-rotation

C. Magic-state distillation

D. Classical overfitting

Correct Answer: A. Readout assignment error

Question 6

Which statement about quantum error mitigation is correct?

A. It always creates a protected logical qubit.

B. It estimates improved results and may increase measurement variance or sampling cost.

C. It removes the need for a noise model or calibration.

D. It guarantees fault-tolerant computation at any physical error rate.

Correct Answer: B. It estimates improved results and may increase measurement variance or sampling cost.

Question 7

Why is comparing the best quantum run with the average classical run methodologically weak?

A. Quantum results cannot be measured statistically.

B. It uses unequal and potentially biased evaluation procedures.

C. Classical models cannot be used as baselines.

D. The quantum circuit must always be deeper than the classical model.

Correct Answer: B. It uses unequal and potentially biased evaluation procedures.

Question 8

Which item is usually part of a fault-tolerant resource estimate but not a minimal ideal-circuit gate count?

A. Input feature labels

B. Syndrome extraction and decoding overhead

C. The name of the optimizer

D. The training-set class names

Correct Answer: B. Syndrome extraction and decoding overhead

Question 9

A device has excellent average gate fidelity but performs poorly on a particular entangled QAI circuit. What is the most appropriate interpretation?

A. Average fidelity always predicts every application exactly.

B. The circuit must contain no errors.

C. A scalar average metric may fail to capture application-specific or correlated errors.

D. The entangled circuit is automatically fault tolerant.

Correct Answer: C. A scalar average metric may fail to capture application-specific or correlated errors.

Question 10

Which practice most improves the credibility of a benchmarking result?

A. Reporting only the most favorable calibration period

B. Omitting queue and post-processing time

C. Repeating experiments across sessions and reporting uncertainty and metadata

D. Using a weaker classical baseline to simplify comparison

Correct Answer: C. Repeating experiments across sessions and reporting uncertainty and metadata