Optimal Fidelity Estimation from Binary Measurements for Discrete and Continuous Variable Systems
Omar Fawzi, Aadil Oufkir, Robert Salzmann

TL;DR
This paper develops optimal methods for estimating quantum state fidelity using binary measurements in both discrete and continuous variable systems, providing bounds based on the $L^1$-norm of relevant functions.
Contribution
It introduces new fidelity estimation protocols with sample complexity bounds characterized by the $L^1$-norm of the Wigner function and characteristic functions, including in black box models.
Findings
Sample complexity linked to the $L^1$-norm of the Wigner function for CV states.
Sample complexity linked to the $L^1$-norm of the characteristic function for qubit states.
First lower bounds on information processing costs based on the $L^1$-norm of the Wigner function.
Abstract
Estimating the fidelity between a desired target quantum state and an actual prepared state is essential for assessing the success of experiments. For pure target states, we use functional representations that can be measured directly and determine the number of copies of the prepared state needed for fidelity estimation. In continuous variable (CV) systems, we utilise the Wigner function, which can be measured via displaced parity measurements. We provide upper and lower bounds on the sample complexity required for fidelity estimation, considering the worst-case scenario across all possible prepared states. For target states of particular interest, such as Fock and Gaussian states, we find that this sample complexity is characterised by the -norm of the Wigner function, a measure of Wigner negativity widely studied in the literature, in particular in resource theories of quantum…
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 Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
