Geometric distinguishability measures limit quantum channel estimation and discrimination
April 22, 2020 Β· Declared Dead Β· π Quantum Information Processing
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Vishal Katariya, Mark M. Wilde
arXiv ID
2004.10708
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT,
math-ph,
math.ST
Citations
57
Venue
Quantum Information Processing
Last Checked
5 months ago
Abstract
Quantum channel estimation and discrimination are fundamentally related information processing tasks of interest in quantum information science. In this paper, we analyze these tasks by employing the right logarithmic derivative Fisher information and the geometric RΓ©nyi relative entropy, respectively, and we also identify connections between these distinguishability measures. A key result of our paper is that a chain-rule property holds for the right logarithmic derivative Fisher information and the geometric RΓ©nyi relative entropy for the interval $Ξ±\in(0,1) $ of the RΓ©nyi parameter $Ξ±$. In channel estimation, these results imply a condition for the unattainability of Heisenberg scaling, while in channel discrimination, they lead to improved bounds on error rates in the Chernoff and Hoeffding error exponent settings. More generally, we introduce the amortized quantum Fisher information as a conceptual framework for analyzing general sequential protocols that estimate a parameter encoded in a quantum channel, and we use this framework, beyond the aforementioned application, to show that Heisenberg scaling is not possible when a parameter is encoded in a classical-quantum channel. We then identify a number of other conceptual and technical connections between the tasks of estimation and discrimination and the distinguishability measures involved in analyzing each. As part of this work, we present a detailed overview of the geometric RΓ©nyi relative entropy of quantum states and channels, as well as its properties, which may be of independent interest.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
π»
Ghosted
Quantum Recommendation Systems
R.I.P.
π»
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted