2021/09/20 by Karl Mayer, Mayer, Karl
Computer Science · Decision Sciences · #Advanced Bandit Algorithms Research #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.2109.09629
openalex publication_date 2021/09/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A recent article introduced a hierarchy of quantities called k-fidelities that approximate the quantum process fidelity with increasing accuracy. The lowest approximation in this hiearchy is the 0-fidelity. The authors gave a protocol for estimating the 0-fidelity and showed numerical evidence that it approximates the process fidelity. In this note, we prove lower and upper bounds on the process fidelity as linear functions of the 0-fidelity. By solving a semidefinite program, we provide evidence that the lower bound is tight.