The efficiency of parameter estimation of quantum channels is studied in this paper. We introduce the concept of programmable parameters to the theory of estimation. It is found that programmable parameters obey the standard quantum limit strictly; hence, no speedup is possible in its estimation. We also construct a class of nonunitary quantum channels whose parameter can be estimated in a way that the standard quantum limit is broken. The study of estimation of general quantum channels also enables an investigation of the effect of noises on quantum estimation.
The efficiency of parameter estimation of quantum channels is studied in this paper. We introduce the concept of programmable parameters to the theory of estimation. It is found that programmable parameters obey the standard quantum limit strictly; hence, no speedup is possible in its estimation. We also construct a class of nonunitary quantum channels whose parameter can be estimated in a way that the standard quantum limit is broken. The study of estimation of general quantum channels also enables an investigation of the effect of noises on quantum estimation.
The aim of this thesis is to develop a theoretical framework to study parameter estimation of quantum channels. We begin by describing the classical task of parameter estimation that we build upon. In its most basic form, parameter estimation is the task of obtaining an estimate of an unknown parameter from some experimental data. This experimental data can be seen as a number of samples of a parameterized probability distribution. In general, the goal of such a task is to obtain an estimate of the unknown parameter while minimizing its error. We study the task of estimating unknown parameters which are encoded in a quantum channel. A quantum channel is a map that describes the evolution of the state of a quantum system. We study this task in the sequential setting. This means that the channel in question is used multiple times, and each channel use happens subsequent to the previous one. A sequential strategy is the most general way to use, or process, a channel multiple times. Our goal is to establish lower bounds on the estimation error in such a task. These bounds are called Cramer--Rao bounds. Quantum channels encompass all possible dynamics allowed by quantum mechanics, and sequential estimation strategies capture the most general way to process multiple uses of a channel. Therefore, the bounds we develop are universally applicable. We consider the use of catalysts to enhance the power of a channel estimation strategy. This is termed amortization. The reason we do so is to investigate if an n-round sequential estimation strategy does better than a simpler parallel strategy. Quantitatively, the power of a channel for a particular estimation task is determined by the channel's Fisher information. Thus, we study how much a catalyst quantum state can enhance the Fisher information of a quantum channel by defining the amortized Fisher information. In the quantum setting, there are many Fisher information quantities that can be defined. We limit our study to two particular ones: the symmetric logarithmic derivative (SLD) Fisher information and the right logarithmic derivative (RLD) Fisher information. We establish our Cramer--Rao bounds by proving that for certain Fisher information quantities, catalyst states do not improve the performance of a sequential estimation protocol. The technical term for this is an amortization collapse. We show how such a collapse leads directly to a corresponding Cramer--Rao bound. We establish bounds both when estimating a single parameter and when
Abstract In this review we discuss how channel simulation can be used to simplify the most general protocols of quantum parameter estimation, where unlimited entanglement and adaptive joint operations may be employed. Whenever the unknown parameter encoded in a quantum channel is completely transferred in an environmental program state simulating the channel, the optimal adaptive estimation cannot beat the standard quantum limit. In this setting, we elucidate the crucial role of quantum teleportation as a primitive operation which allows one to completely reduce adaptive protocols over suitable teleportation-covariant channels and derive matching upper and lower bounds for parameter estimation. For these channels,wemay express the quantum Cramér Rao bound directly in terms of their Choi matrices. Our review considers both discrete- and continuous-variable systems, also presenting some new results for bosonic Gaussian channels using an alternative sub-optimal simulation. It is an open problem to design simulations for quantum channels that achieve the Heisenberg limit.
We examine the conditions under which quantum parameter estimation is compatible with the concept of a ``true'' quantity value: a unique value of the estimated quantity that exists prior to and independently of measurement. While quantum parameter estimation typically assumes that the quantity to be estimated is a parameter, we argue that this assumption can be lifted, opening the way to a more general formulation of estimation that may apply even in situations where the quantity to be estimated is no longer a parameter, but instead a quantum variable susceptible to quantum fluctuations. We identify three assumptions that characterize the way estimation is often presented in the quantum metrology literature, namely, as a procedure for inferring an unknown ``true value", which is assumed to be unique and to exist prior to and independently of measurement. Using our more general framework, we prove a no-go theorem showing that the preceding assumptions are jointly incompatible with two further assumptions: the completeness of the quantum state (no `hidden variables'), and the presence of entanglement between the probe systems and the system under measurement. We note that the presence of such entanglement is a generic prediction of standard quantum theory. Consequently, if one is not willing to accept hidden variables, nor willing to modify standard quantum theory by introducing a new physical mechanism that destroys entanglement at some scale or regime, then a realist account of estimation is ultimately impossible.
We consider the estimation of noise parameters in a quantum channel, assuming the most general strategy allowed by quantum mechanics. This is based on the exploitation of unlimited entanglement and arbitrary quantum operations, so that the channel inputs may be interactively updated. In this general scenario, we draw a novel connection between quantum metrology and teleportation. In fact, for any teleportation-covariant channel (e.g., Pauli, erasure, or Gaussian channel), we find that adaptive noise estimation cannot beat the standard quantum limit, with the quantum Fisher information being determined by the channel's Choi matrix. As an example, we establish the ultimate precision for estimating excess noise in a thermal-loss channel, which is crucial for quantum cryptography. Because our general methodology applies to any functional that is monotonic under trace-preserving maps, it can be applied to simplify other adaptive protocols, including those for quantum channel discrimination. Setting the ultimate limits for noise estimation and discrimination paves the way for exploring the boundaries of quantum sensing, imaging, and tomography.
Abstract Quantum multiparameter estimation involves estimating multiple parameters simultaneously and can be more precise than estimating them individually. Our interest here is to determine fundamental quantum limits to the achievable multiparameter estimation precision in the presence of noise. We first present a lower bound to the estimation error covariance for a noisy initial probe state evolving through a noiseless quantum channel. We then present a lower bound to the estimation error covariance in the most general form for a noisy initial probe state evolving through a noisy quantum channel. We show conditions and accordingly measurements to attain these estimation precision limits for noisy systems. We see that the Heisenberg precision scaling of 1/N can be achieved with a probe comprising N particles even in the presence of noise. In fact, some noise in the initial probe state or the quantum channel can serve as a feature rather than a bug, since the estimation precision scaling achievable in the presence of noise in the initial state or the channel in some situations is impossible in the absence of noise in the initial state or the channel. However, a lot of noise harms the quantum advantage achievable with N parallel resources, and allows for a best precision scaling of 1/N 1 / N . Moreover, the Heisenberg precision limit can be beaten with noise in the channel, and we present a super-Heisenberg precision limit with scaling of 1/N2 for optimal amount of noise in the channel, characterized by one-particle evolution operators. Furthermore, using γ-particle evolution operators for the noisy channel, where γ > 1, the best precision scaling attainable is 1/N2γ, which is otherwise known to be only possible using 2γ-particle evolution operators for a noiseless channel.