Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

1 Parameter estimation of quantum channels

Zhengfeng Ji, Guoming Wang, Runyao Duan, Yuan Feng, Mingsheng Ying

Published Jan 1, 2006• 72 citations
OpenAlex

Abstract

Abstract — 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 non-unitary quantum channels whose parameter can be estimated in a way the standard quantum limit is broken. I.

Related papers

Parameter Estimation of Quantum Channels

Zhengfeng Ji, Guoming Wang, Runyao Duan +2 more

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.

arXiv:quant-ph/0610060•IEEE Transactions on Information Theory•Oct 22, 2008•120 citations

Topics in Estimation of Quantum Channels

Caleb J O'Loan

A quantum channel is a mapping which sends density matrices to density matrices. The estimation of quantum channels is of great importance to the field of quantum information. In this thesis two topics related to estimation of quantum channels are investigated. The first of these is the upper bound of Sarovar and Milburn (2006) on the Fisher information obtainable by measuring the output of a channel. Two questions raised by Sarovar and Milburn about their bound are answered. A Riemannian metric on the space of quantum states is introduced, related to the construction of the Sarovar and Milburn bound. Its properties are characterized. The second topic investigated is the estimation of unitary channels. The situation is considered in which an experimenter has several non-identical unitary channels that have the same parameter. It is shown that it is possible to improve estimation using the channels together, analogous to the case of identical unitary channels. Also, a new method of phase estimation is given based on a method sketched by Kitaev (1996). Unlike other phase estimation procedures which perform similarly, this procedure requires only very basic experimental resources.

arXiv:1001.3971•Jan 22, 2010•2 citations

Limits on Parameter Estimation of Quantum Channels

Vishal Katariya

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

arXiv:2201.01738•Civil War Book Review•Dec 15, 2021•0 citations

Channel Simulation in Quantum Metrology

Riccardo Laurenza, Cosmo Lupo, Gaetana Spedalieri +2 more

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.

arXiv:1712.06603•Quantum Measurements and Quantum Metrology•Mar 1, 2018•43 citations

Spectrum measurement of quantum channels and application to Hamiltonian parameter estimation

Yuan-De Jin, Wen-Long Ma

Quantum channels describe the most general dynamics of open quantum systems. A quantum channel, as a linear map on vectorized quantum states, can be represented by a single matrix, whose spectrum is called the channel spectrum. Here we propose a general method to measure the channel spectrum and apply this method to Hamiltonian parameter estimation. We first demonstrate that the channel spectrum can be measured by tracking the probability of a specific outcome in repeated application of the same channel. Then we construct and analyze {a class of concatenated channels, with each one being a unitary channel followed by a weak-measurement channel induced by a Ramsey sequence of a probe qubit}. We show that the spectrum measurement of such concatenated channels can be utilized for estimating the parameters in the free Hamiltonians generating the unitary channels of the target system. As practical examples, we numerically demonstrate that a probe spin qubit can accurately sense nuclear spin clusters for nanoscale nuclear magnetic resonance.

arXiv:2509.11074•Physical Review A•Jan 12, 2026•0 citations

Fundamental Limits of Quantum Metrology Beyond Fixed Causal Order

Wenjie Wei, Yutong Li, Shengshi Pang

Quantum metrology with indefinite causal order (ICO) has attracted intense interest due to its potential to surpass the limitations of conventional fixed-order strategies. A key open question is whether ICO can fundamentally enhance asymptotic precision scaling. In this work, we bridge this gap for the estimation of a single parameter encoded in $N$ identical uses of a finite-dimensional quantum channel. We first establish a universal Heisenberg-scaling upper bound for the full general ICO process-matrix class and show that for unitary channels its optimal quantum Fisher information (QFI) coincides exactly with that of parallel strategies. For noisy channels, a structurally refined bound shows that channels restricted to the standard quantum limit (SQL) under parallel strategies remain SQL-limited under general ICO strategies. Most significantly, an asymptotically tight (AT) bound is derived to close the remaining possibility of an asymptotic ICO advantage by showing that general ICO and optimal parallel strategies have exactly the same leading QFI coefficient in both the SQL and Heisenberg regimes. For the operationally motivated class of quantum circuits with quantum control of causal order, we further obtain an iterative constraint on finite-query precision whose asymptotic limit agrees with that of the AT bound. Our results clarify the ultimate role of indefinite causality as a metrological resource for quantum channel estimation.

quant-pharXiv:2609.05355•Sep 7, 2026•0 citations
Abstract — 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 non-unitary quantum channels whose parameter can be estimated in a way the standard quantum limit is broken. I.
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.
A quantum channel is a mapping which sends density matrices to density matrices. The estimation of quantum channels is of great importance to the field of quantum information. In this thesis two topics related to estimation of quantum channels are investigated. The first of these is the upper bound of Sarovar and Milburn (2006) on the Fisher information obtainable by measuring the output of a channel. Two questions raised by Sarovar and Milburn about their bound are answered. A Riemannian metric on the space of quantum states is introduced, related to the construction of the Sarovar and Milburn bound. Its properties are characterized. The second topic investigated is the estimation of unitary channels. The situation is considered in which an experimenter has several non-identical unitary channels that have the same parameter. It is shown that it is possible to improve estimation using the channels together, analogous to the case of identical unitary channels. Also, a new method of phase estimation is given based on a method sketched by Kitaev (1996). Unlike other phase estimation procedures which perform similarly, this procedure requires only very basic experimental resources.
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.
Quantum channels describe the most general dynamics of open quantum systems. A quantum channel, as a linear map on vectorized quantum states, can be represented by a single matrix, whose spectrum is called the channel spectrum. Here we propose a general method to measure the channel spectrum and apply this method to Hamiltonian parameter estimation. We first demonstrate that the channel spectrum can be measured by tracking the probability of a specific outcome in repeated application of the same channel. Then we construct and analyze {a class of concatenated channels, with each one being a unitary channel followed by a weak-measurement channel induced by a Ramsey sequence of a probe qubit}. We show that the spectrum measurement of such concatenated channels can be utilized for estimating the parameters in the free Hamiltonians generating the unitary channels of the target system. As practical examples, we numerically demonstrate that a probe spin qubit can accurately sense nuclear spin clusters for nanoscale nuclear magnetic resonance.
Quantum metrology with indefinite causal order (ICO) has attracted intense interest due to its potential to surpass the limitations of conventional fixed-order strategies. A key open question is whether ICO can fundamentally enhance asymptotic precision scaling. In this work, we bridge this gap for the estimation of a single parameter encoded in NNN identical uses of a finite-dimensional quantum channel. We first establish a universal Heisenberg-scaling upper bound for the full general ICO process-matrix class and show that for unitary channels its optimal quantum Fisher information (QFI) coincides exactly with that of parallel strategies. For noisy channels, a structurally refined bound shows that channels restricted to the standard quantum limit (SQL) under parallel strategies remain SQL-limited under general ICO strategies. Most significantly, an asymptotically tight (AT) bound is derived to close the remaining possibility of an asymptotic ICO advantage by showing that general ICO and optimal parallel strategies have exactly the same leading QFI coefficient in both the SQL and Heisenberg regimes. For the operationally motivated class of quantum circuits with quantum control of causal order, we further obtain an iterative constraint on finite-query precision whose asymptotic limit agrees with that of the AT bound. Our results clarify the ultimate role of indefinite causality as a metrological resource for quantum channel estimation.