Identification and Distance Measures of Measurement Apparatus

2006/01/31 by Zhengfeng Ji, Yuan Feng, Runyao Duan +1 · 5 citations
Computer Science · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #quant-ph

paper · pdf · doi:10.1103/physrevlett.96.200401

published as Phys. Rev. Lett. 96, 200401 (2006) · 5 pages, RevTeX, 1 figure. Revised version with more examples and a reorganization of the contents

arxiv created 2006/04/05 · openalex publication_date 2006/05/22 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We propose simple schemes that can perfectly identify projective measurement apparatuses secretly chosen from a finite set. Entanglement is used in these schemes both to make possible the perfect identification and to improve the efficiency significantly. Based on these results, a brief discussion on the problem of how to appropriately define distance measures of measurements is also provided.

Citations

• Distinguishability, classical information of quantum operations
• Distance measures to compare real and ideal quantum processes
• Quantum computations: algorithms and error correction

Cited by

• Discrimination of quantum observables using limited resources
• Local unambiguous discrimination with remaining entanglement
• Local Distinguishability of Multipartite Unitary Operations
• Optimal two-copy discrimination of quantum measurements
• When is the Chernoff Exponent for Quantum Operations Finite?