2013/01/31 by Easwar Magesan, Paola Cappellaro · 4 citations
Computer Science · Physics and Astronomy · #Algorithm #Computer science #Data mining #Fidelity #Generality #Measure (data warehouse) #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum mechanics #Scalability #Statistical physics #quant-ph
paper · pdf · doi:10.1103/physreva.88.022127
published in Physical Review A 88(2) (American Physical Society) · 20 pages, 1 figure. Expanded details and typos corrected. Accepted version
arxiv created 2013/08/02 · openalex publication_date 2013/08/29 · arxiv updated 2015/06/12 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/06
Efficient methods for characterizing the performance of quantum measurements are important in the experimental quantum sciences. Ideally, one requires both a physically relevant distinguishability measure between measurement operations and a well-defined experimental procedure for estimating the distinguishability measure. Here, we propose the average measurement fidelity and error between quantum measurements as distinguishability measures. We present protocols for obtaining bounds on these quantities that are both estimable using experimentally accessible quantities and scalable in the size of the quantum system. We also explain why the bounds should be valid in large generality and illustrate the method via numerical examples.