Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 144 tok/s
Gemini 2.5 Pro 46 tok/s Pro
GPT-5 Medium 22 tok/s Pro
GPT-5 High 24 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 200 tok/s Pro
GPT OSS 120B 432 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
2000 character limit reached

Criteria for unbiased estimation: applications to noise-agnostic sensing and learnability of quantum channel (2503.17362v1)

Published 21 Mar 2025 in quant-ph

Abstract: We establish the necessary and sufficient conditions for unbiased estimation in multi-parameter estimation tasks. More specifically, we first consider quantum state estimation, where multiple parameters are encoded in a quantum state, and derive two equivalent necessary and sufficient conditions for an unbiased estimation: one formulated in terms of the quantum Fisher information matrix (QFIM) and the other based on the derivatives of the encoded state. Furthermore, we introduce a generalized quantum Cram\'er-Rao bound, which provides a fundamental achievable lower bound on the estimation error even when the QFIM is non-invertible. To demonstrate the utility of our framework, we consider phase estimation under unknown Pauli noise. We show that while unbiased phase estimation is infeasible with a naive scheme, employing an entangled probe with a noiseless ancilla enables unbiased estimation. Next, we extend our analysis to quantum channel estimation (equivalently, quantum channel learning), where the goal is to estimate parameters characterizing an unknown quantum channel. We establish the necessary and sufficient condition for unbiased estimation of these parameters. Notably, by interpreting unbiased estimation as learnability, our result applies to the fundamental learnability of parameters in general quantum channels. As a concrete application, we investigate the learnability of noise affecting non-Clifford gates via cycle benchmarking.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Questions

We haven't generated a list of open questions mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.