Decay Rates in Interleaved Benchmarking with Single-Qubit References
- URL: http://arxiv.org/abs/2603.05422v1
- Date: Thu, 05 Mar 2026 17:43:30 GMT
- Title: Decay Rates in Interleaved Benchmarking with Single-Qubit References
- Authors: Ilya A. Simakov, Arina V. Zotova, Tatyana A. Chudakova, Alena S. Kazmina, Artyom M. Polyanskiy, Nikolay N. Abramov, Mikhail A. Tarkhov, Alexander M. Mumlyakov, Igor V. Trofimov, Nikita Yu. Rudenko, Maxim V. Chichkov, Vladimir I. Chichkov, Grigoriy S. Mazhorin,
- Abstract summary: Cross-entropy benchmarking (XEB) with single-qubit reference sequences is widely used to characterize multi-qubit gates in large-scale quantum processors.<n>We show that the commonly employed additive single-qubit errors approximation underlying this approach breaks down and leads to a systematic overestimation of gate fidelities.
- Score: 28.404018926483985
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Cross-entropy benchmarking (XEB) with single-qubit reference sequences is widely used to characterize multi-qubit gates in large-scale quantum processors, despite the lack of a rigorous theoretical justification. Here we show that the commonly employed additive single-qubit errors approximation underlying this approach breaks down and leads to a systematic overestimation of gate fidelities. We derive an analytical expression for the joint decay of simultaneous single-qubit reference sequences and introduce a refined expression for the interleaved gate fidelity estimation. Experiments on a superconducting quantum processor validate the theory and demonstrate that fidelities obtained using XEB with single-qubit references agree with those extracted from standard interleaved randomized benchmarking (IRB), while achieving higher precision due to reduced reference-sequence errors. Our results establish theoretical foundation for the single-qubit-based XEB and show that, with appropriate post-processing, it enables a reliable and robust approach for entangling gates benchmarking without the need for multi-qubit Clifford reference sequences.
Related papers
- Sharp Convergence Rates for Masked Diffusion Models [53.117058231393834]
We develop a total-variation based analysis for the Euler method that overcomes limitations.<n>Our results relax assumptions on score estimation, improve parameter dependencies, and establish convergence guarantees.<n>Overall, our analysis introduces a direct TV-based error decomposition along the CTMC trajectory and a decoupling-based path-wise analysis for FHS.
arXiv Detail & Related papers (2026-02-26T00:47:51Z) - Learnable Chernoff Baselines for Inference-Time Alignment [64.81256817158851]
We introduce Learnable Chernoff Baselines as a method for efficiently and approximately sampling from exponentially tilted kernels.<n>We establish total-variation guarantees to the ideal aligned model, and demonstrate in both continuous and discrete diffusion settings that LCB sampling closely matches ideal rejection sampling.
arXiv Detail & Related papers (2026-02-08T00:09:40Z) - Easier randomizing gates provide more accurate fidelity estimation [0.1759008116536278]
We show that the standard approach of interleaved randomized benchmarking (IRB) can produce highly inaccurate and even physically impossible estimates for the error on the interleaved gate.<n>We also show that interleaved benchmarking performed with cycle benchmarking, which randomizes with single qubit Pauli gates, provides dramatically reduced systematic uncertainty.
arXiv Detail & Related papers (2025-12-31T09:32:19Z) - Experimental characterization of the Toffoli gate via channel spectrum benchmarking [0.0]
Channel spectrum benchmarking (CSB) provides a robust framework for characterizing quantum gate fidelities.<n>We introduce an extended CSB model together with a fidelity estimate interval (FEI) -- an interval-valued estimate of the target gate fidelity.<n>We further validate the protocol on a trapped-ion quantum processor by benchmarking two implementations of the three-qubit Toffoli gate.
arXiv Detail & Related papers (2025-12-23T17:38:57Z) - Benchmarking quantum gates and circuits [1.6163129903911515]
This paper reviews a variety of key benchmarking techniques, including Randomized Benchmarking, Quantum Process Tomography, Gate Set Tomography, Process Fidelity Estimation, Direct Fidelity Estimation, and Cross-Entropy Benchmarking.<n>We introduce deterministic benchmarking (DB), a novel protocol that minimizes the number of experimental runs, exhibits resilience to SPAM errors, and effectively characterizes both coherent and incoherent errors.
arXiv Detail & Related papers (2024-07-13T16:36:02Z) - General bounds on the quality of Bayesian coresets [13.497835690074151]
This work presents general upper and lower bounds on the Kullback-Leibler (KL)
Lower bounds are applied to obtain fundamental limitations on the quality of coreset approximations.
The upper bounds are used to analyze the performance of recent subsample-optimize methods.
arXiv Detail & Related papers (2024-05-20T04:46:14Z) - Context Aware Fidelity Estimation [0.6534705345202519]
We present Context Aware Fidelity Estimation (CAFE), a framework for benchmarking quantum operations.
CAFE produces fidelity estimates at least as accurate as Interleaved RB in numerical simulations.
We also introduce a compact formulation for preparing an arbitrary two-qubit state with a single entangling operation.
arXiv Detail & Related papers (2023-03-30T17:30:41Z) - Regularized Vector Quantization for Tokenized Image Synthesis [126.96880843754066]
Quantizing images into discrete representations has been a fundamental problem in unified generative modeling.
deterministic quantization suffers from severe codebook collapse and misalignment with inference stage while quantization suffers from low codebook utilization and reconstruction objective.
This paper presents a regularized vector quantization framework that allows to mitigate perturbed above issues effectively by applying regularization from two perspectives.
arXiv Detail & Related papers (2023-03-11T15:20:54Z) - Partial randomized benchmarking [0.0]
In randomized benchmarking of quantum logical gates, partial twirling can be used for simpler implementation, better scaling, and higher accuracy and reliability.
We analyze such simplified, partial twirling and demonstrate that, unlike for the standard randomized benchmarking, the measured decay of fidelity is a linear combination of exponentials with different decay rates.
arXiv Detail & Related papers (2021-11-07T22:15:11Z) - Information-Theoretic Generalization Bounds for Iterative
Semi-Supervised Learning [81.1071978288003]
In particular, we seek to understand the behaviour of the em generalization error of iterative SSL algorithms using information-theoretic principles.
Our theoretical results suggest that when the class conditional variances are not too large, the upper bound on the generalization error decreases monotonically with the number of iterations, but quickly saturates.
arXiv Detail & Related papers (2021-10-03T05:38:49Z) - Exact Recovery in the General Hypergraph Stochastic Block Model [92.28929858529679]
This paper investigates fundamental limits of exact recovery in the general d-uniform hypergraph block model (d-HSBM)
We show that there exists a sharp threshold such that exact recovery is achievable above the threshold and impossible below it.
arXiv Detail & Related papers (2021-05-11T03:39:08Z) - Lower bounds in multiple testing: A framework based on derandomized
proxies [107.69746750639584]
This paper introduces an analysis strategy based on derandomization, illustrated by applications to various concrete models.
We provide numerical simulations of some of these lower bounds, and show a close relation to the actual performance of the Benjamini-Hochberg (BH) algorithm.
arXiv Detail & Related papers (2020-05-07T19:59:51Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.