High-Precision Fidelity Estimation with Common Randomized Measurements

• URL: http://arxiv.org/abs/2511.22509v1
• Date: Thu, 27 Nov 2025 14:39:10 GMT
• Title: High-Precision Fidelity Estimation with Common Randomized Measurements
• Authors: Zhongyi Yang, Datong Chen, Zihao Li, Huangjun Zhu,
• Abstract summary: We introduce an efficient estimation protocol by virtue of common randomized measurements integrated with shadow estimation based on the Clifford group.<n>Our protocol only requires a constant number of circuits, irrespective of the infidelity $$ and the qubit number.<n>For large and intermediate quantum systems, quite often one circuit is already sufficient.
• Score: 5.793424120906323
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Efficient fidelity estimation of multiqubit quantum states is crucial to many applications in quantum information processing. However, to estimate the infidelity $ε$ with multiplicative precision, conventional estimation protocols require (order) $1/ε^2$ different circuits in addition to $1/ε^2$ samples, which is quite resource-intensive for high-precision fidelity estimation. Here we introduce an efficient estimation protocol by virtue of common randomized measurements (CRM) integrated with shadow estimation based on the Clifford group, which only requires $1/ε$ circuits. Moreover, in many scenarios of practical interest, in the presence of depolarizing or Pauli noise for example, our protocol only requires a constant number of circuits, irrespective of the infidelity $ε$ and the qubit number. For large and intermediate quantum systems, quite often one circuit is already sufficient. In the course of study, we clarify the performance of CRM shadow estimation based on the Clifford group and 4-designs and highlight its advantages over standard and thrifty shadow estimation.

Related papers

• Sample- and Hardware-Efficient Fidelity Estimation by Stripping Phase-Dominated Magic [0.2796197251957245]
  This work proposes a sample- and gate-efficient fidelity estimation algorithm that is affordable within feasible quantum devices.<n>We show that the fidelity estimation with pure states close to the structure of phase states, for which sample-efficient DFE is limited by their strong entanglement and magic, can be done by using $mathcalO(mathrmpoly(n))$ sampling copies, with a single $n$-qubit fan-out gate.
  arXiv  Detail & Related papers  (2026-02-10T12:13:25Z)
• Optimal Fidelity Estimation from Binary Measurements for Discrete and Continuous Variable Systems [6.253919624802852]
  In continuous variable (CV) systems, we utilise the Wigner function, which can be measured via displaced parity measurements. For target states of particular interest, such as Fock and Gaussian states, we find that this sample complexity is characterised by the $L1$-norm of the Wigner function. In a general black box model, we prove that, for any target state, the optimal sample complexity for fidelity estimation is characterised by the smoothed $L1$-norm of the target state.
  arXiv  Detail & Related papers  (2024-09-06T11:07:55Z)
• Minimal Clifford Shadow Estimation by Mutually Unbiased Bases [5.002981581926959]
  We introduce the minimal Clifford measurement (MCM) to reduce the number of possible random circuits to the minimum. Compared to the original Clifford measurements, our MCM significantly reduces the circuit complexity and the compilation costs.
  arXiv  Detail & Related papers  (2023-10-28T16:22:04Z)
• Comparisons among the Performances of Randomized-framed Benchmarking Protocols under T1, T2 and Coherent Error Models [11.286152850251684]
  The current quantum computer, i.e. noisy intermediate-scale quantum (NISQ) computer encounters a bottleneck in how to deal with the noisy situation of the quantum machine. It is still urgently required to construct more efficient and reliable benchmarking protocols.
  arXiv  Detail & Related papers  (2023-09-27T08:25:00Z)
• Thrifty shadow estimation: re-using quantum circuits and bounding tails [1.6814343144960449]
  We propose a more practical variant of the protocol, thrifty shadow estimation, in which quantum circuits are reused many times. We show that reuse is maximally effective when sampling Haar random unitaries, and maximally ineffective when sampling from the Clifford group.
  arXiv  Detail & Related papers  (2022-12-12T20:50:41Z)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Quantum-enhanced mean value estimation via adaptive measurement [0.39102514525861415]
  Mean value estimation of observables is an essential subroutine in quantum computing algorithms. The quantum estimation theory identifies the ultimate precision of such an estimator, which is referred to as the quantum Cram'er-Rao (QCR) lower bound or equivalently the inverse of the quantum Fisher information. We propose a quantum-enhanced mean value estimation method in a depolarizing noisy environment that saturates the QCR bound in the limit of a large number of qubits.
  arXiv  Detail & Related papers  (2022-10-27T17:13:07Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Dual-Frequency Quantum Phase Estimation Mitigates the Spectral Leakage of Quantum Algorithms [76.15799379604898]
  Quantum phase estimation suffers from spectral leakage when the reciprocal of the record length is not an integer multiple of the unknown phase. We propose a dual-frequency estimator, which approaches the Cramer-Rao bound, when multiple samples are available.
  arXiv  Detail & Related papers  (2022-01-23T17:20:34Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)
• Direct estimation of minimum gate fidelity [18.98854210281999]
  A key measure of the performance of a quantum gate is the minimum gate fidelity, i.e., the fidelity of the gate, minimized over all input states. We propose a hybrid numerical-experimental scheme that employs a numerical gradient-free minimization (GFM) and an experimental target-fidelity estimation procedure.
  arXiv  Detail & Related papers  (2020-04-06T06:36:31Z)

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.