{"title":"Optimal Fidelity Estimation from Binary Measurements for Discrete and Continuous Variable Systems","authors":"Omar Fawzi, Aadil Oufkir, Robert Salzmann","doi":"arxiv-2409.04189","DOIUrl":null,"url":null,"abstract":"Estimating the fidelity between a desired target quantum state and an actual\nprepared state is essential for assessing the success of experiments. For pure\ntarget states, we use functional representations that can be measured directly\nand determine the number of copies of the prepared state needed for fidelity\nestimation. In continuous variable (CV) systems, we utilise the Wigner\nfunction, which can be measured via displaced parity measurements. We provide\nupper and lower bounds on the sample complexity required for fidelity\nestimation, considering the worst-case scenario across all possible prepared\nstates. For target states of particular interest, such as Fock and Gaussian\nstates, we find that this sample complexity is characterised by the $L^1$-norm\nof the Wigner function, a measure of Wigner negativity widely studied in the\nliterature, in particular in resource theories of quantum computation. For\ndiscrete variable systems consisting of $n$ qubits, we explore fidelity\nestimation protocols using Pauli string measurements. Similarly to the CV\napproach, the sample complexity is shown to be characterised by the $L^1$-norm\nof the characteristic function of the target state for both Haar random states\nand stabiliser states. Furthermore, in a general black box model, we prove\nthat, for any target state, the optimal sample complexity for fidelity\nestimation is characterised by the smoothed $L^1$-norm of the target state. To\nthe best of our knowledge, this is the first time the $L^1$-norm of the Wigner\nfunction provides a lower bound on the cost of some information processing\ntask.","PeriodicalId":501379,"journal":{"name":"arXiv - STAT - Statistics Theory","volume":"58 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - STAT - Statistics Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.04189","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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 $L^1$-norm
of the Wigner function, a measure of Wigner negativity widely studied in the
literature, in particular in resource theories of quantum computation. For
discrete variable systems consisting of $n$ qubits, we explore fidelity
estimation protocols using Pauli string measurements. Similarly to the CV
approach, the sample complexity is shown to be characterised by the $L^1$-norm
of the characteristic function of the target state for both Haar random states
and stabiliser states. Furthermore, 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 $L^1$-norm of the target state. To
the best of our knowledge, this is the first time the $L^1$-norm of the Wigner
function provides a lower bound on the cost of some information processing
task.