High-Precision Fidelity Estimation with Common Randomized Measurements
Zhongyi Yang, Datong Chen, Zihao Li, and Huangjun Zhu

TL;DR
This paper presents a resource-efficient protocol for high-precision fidelity estimation of multiqubit quantum states using common randomized measurements and shadow estimation, significantly reducing the number of circuits needed.
Contribution
It introduces a novel fidelity estimation method combining common randomized measurements with shadow estimation, requiring fewer circuits and being effective under practical noise conditions.
Findings
Requires only 1/ε circuits for high-precision estimation
Constant number of circuits needed under certain noise models
Outperforms standard shadow estimation methods
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) different circuits in addition to 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 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum many-body systems
