Sample- and Hardware-Efficient Fidelity Estimation by Stripping Phase-Dominated Magic
Guedong Park, Jaekwon Chang, Yosep Kim, Yong Siah Teo, Hyunseok Jeong

TL;DR
This paper introduces a novel fidelity estimation method that drastically reduces sampling complexity for phase states by employing phase stripping and nonlinear classical post-processing, making it more feasible for near-term quantum devices.
Contribution
The work presents a sample- and gate-efficient fidelity estimation algorithm that significantly reduces resource requirements for phase states, utilizing phase stripping and nonlinear post-processing techniques.
Findings
Fidelity estimation complexity reaches O(1) for phase states.
Uses a single fan-out gate and nonlinear classical post-processing.
Reduces sampling overhead compared to traditional direct fidelity estimation.
Abstract
Direct fidelity estimation (DFE) is a famous tool for estimating the fidelity with a target pure state. However, such a method generally requires exponentially many sampling copies due to the large magic of the target state. This work proposes a sample- and gate-efficient fidelity estimation algorithm that is affordable within feasible quantum devices. 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 sampling copies, with a single -qubit fan-out gate. As the target state becomes a phase state, the sampling complexity reaches . Such a drastic improvement stems from a crucial step in our scheme, the so-called phase stripping, which can significantly reduce the target-state magic. Furthermore, we…
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.
