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

arXiv:quant-ph/0207150 · Journal of Physics A Mathematical and General

Quantum estimation for non-differentiable models

Yoshiyuki Tsuda, Keiji Matsumoto

Published Feb 3, 2005• 14 citations
arXivHTMLPDF

Abstract

State estimation is a classical problem in quantum information. In optimization of an estimation scheme, to find a lower bound to the error of the estimator is a very important step. So far, all the proposed tractable lower bounds use a derivative of the density matrix. However, sometimes, we are interested in quantities with singularity, e.g. concurrence etc. In this paper, lower bounds to a mean square error of an estimator are derived for a quantum estimation problem without smoothness assumptions. Our main idea is to replace the derivative by difference, as is done in classical estimation theory. We applied the inequalities to several examples, and derived an optimal estimator for some of them.

DOI
10.1088/0305-4470/38/7/014

Related papers

Quantum estimation for quantum technology

Matteo G. A. Paris

Several quantities of interest in quantum information, including entanglement and purity, are nonlinear functions of the density matrix and cannot, even in principle, correspond to proper quantum observables. Any method aimed to determine the value of these quantities should resort to indirect measurements and thus corresponds to a parameter estimation problem whose solution, i.e the determination of the most precise estimator, unavoidably involves an optimization procedure. We review local quantum estimation theory and present explicit formulas for the symmetric logarithmic derivative and the quantum Fisher information of relevant families of quantum states. Estimability of a parameter is defined in terms of the quantum signal-to-noise ratio and the number of measurements needed to achieve a given relative error. The connections between the optmization procedure and the geometry of quantum statistical models are discussed. Our analysis allows to quantify quantum noise in the measurements of non observable quantities and provides a tools for the characterization of signals and devices in quantum technology. 1.

•Apr 18, 2008•0 citations

QUANTUM ESTIMATION FOR QUANTUM TECHNOLOGY

Matteo G. A. Paris

Several quantities of interest in quantum information, including entanglement and purity, are nonlinear functions of the density matrix and cannot, even in principle, correspond to proper quantum observables. Any method aimed to determine the value of these quantities should resort to indirect measurements and thus corresponds to a parameter estimation problem whose solution, i.e. the determination of the most precise estimator, unavoidably involves an optimization procedure. We review local quantum estimation theory and present explicit formulas for the symmetric logarithmic derivative and the quantum Fisher information of relevant families of quantum states. Estimability of a parameter is defined in terms of the quantum signal-to-noise ratio and the number of measurements needed to achieve a given relative error. The connections between the optmization procedure and the geometry of quantum statistical models are discussed. Our analysis allows to quantify quantum noise in the measurements of non observable quantities and provides a tools for the characterization of signals and devices in quantum technology.

arXiv:0804.2981•International Journal of Quantum Information•Jan 1, 2009•1,737 citations

Quantum estimation by local observables

Masahiro Hotta, Masanao Ozawa

Quantum estimation theory provides optimal observations for various estimation problems for unknown parameters in the state of the system under investigation. However, the theory has been developed under the assumption that every observable is available for experimenters. Here, we generalize the theory to problems in which the experimenter can use only locally accessible observables. For such problems, we establish a Cram\'er-Rao-type inequality by obtaining an explicit form of the Fisher information as a reciprocal lower bound for the mean-square errors of estimations by locally accessible observables. Furthermore, we explore various local quantum estimation problems for composite systems, where nontrivial combinatorics is needed for obtaining the Fisher information.

arXiv:quant-ph/0401187•Physical Review A•Aug 30, 2004•32 citations

Bhattacharyya inequality for quantum state estimation

Yoshiyuki Tsuda

Using a higher order derivative with respect to the parameter, we will give lower bounds for variance of unbiased estimators in quantum estimation problems. This is a quantum version of the Bhattacharyya inequality in the classical statistical estimation. Because of the non-commutativity of operator multiplication, we obtain three different types of lower bounds: Type S, Type R and Type L. If the parameter is a real number, the Type S bound is useful. If the parameter is complex, the Type R and L bounds are useful. As an application, we will consider estimation of polynomials of the complex amplitude of the quantum Gaussian state. For the case where the amplitude lies in the real axis, a uniformly optimum estimator for the square of the amplitude will be derived using the Type S bound. It will be shown that there is no unbiased estimator uniformly optimum as a polynomial of annihilation and/or creation operators for the cube of the amplitude. For the case where the amplitude does not necessarily lie in the real axis, uniformly optimum estimators for holomorphic, antiholomorphic and real-valued polynomials of the amplitude will be derived. Those estimators for the holomorphic and real-valued cases attain the Type R bound, and those for the antiholomorphic and real-valued cases attain the Type L bound. This paper clarifies what is the best method to measure the energy of a laser.

arXiv:quant-ph/0611182•Journal of Physics A Mathematical and Theoretical•Jan 9, 2007•5 citations

Quantum estimation of Chernoff bound and Hoeffding bound

Honglin Chen, Jicun Li, Wei Xie +1 more

Determining the closeness of two quantum states with minimal error probability is a central problem in quantum information theory. The optimal exponents characterizing the error probability in the symmetric and asymmetric settings are given by the quantum Chernoff bound (QCB) and the quantum Hoeffding bound (QHB), respectively. In this work, we introduce the first algorithms for estimating the QCB and QHB of two unknown states. We propose a unitary encoding for diagonal density matrix based on the copy matrix, which enables unbiased estimation of nonlinear matrix functions via quantum singular value transformation (QSVT). For general density matrices, we combine QSVT with the Hadamard test to estimate both QCB and QHB. Numerical simulations demonstrate that the algorithm converges to the optimal value within a limited number of iterations. Furthermore, we establish the first integration of QSVT with convex optimization, yielding a hybrid quantum-classical framework for quantum estimation.

Physical Review Research•Aug 27, 2025•0 citations

Estimation of Quantum States and Operations

Ballester Sánchez, Manuel Alberto

The subject of this thesis, quantum estimation theory, is inspired by recent developments, both practical and theoretical, in the new field of quantum information and computation. The main task of quantum estimation theory, the subject of this thesis, is that given many identical copies of an unknown quantum system one wants to "guess" or estimate what the system is. This is done by performing an "optimal" measurement and analyzing the data obtained from it. A quantum state is represented by a density matrix. In some cases one does not need to know the whole density matrix, sometimes a partial characterization is enough. Chapter 2 of this thesis is about optimally estimating the spectrum, i.e. the eigenvalues, of a density matrix. This is useful, for example, for estimating the entanglement of a bipartite pure state. The results of chapter 2 tell us that one can optimally estimate bipartite entanglement with LOCC measurements on one of the two parties. Unitary operations transform density matrices to density matrices. They are the gates of quantum information processing. Suppose one has one such unitary operation but one does not know what it does. In order to characterize it one needs to know how it transforms any input state. In order to know how a particular state is transformed, one can prepare that state, feed it to the unitary many times, and measure the output. One state is, of course, not enough. It turns out that the unitary can be completely characterized with a finite set of states, this is known as quantum process tomography. Unfortunately, in many cases it is difficult to have available in the lab all the input states needed to perform quantum process tomography. It is here where entanglement comes to the rescue. One pair of maximally entangled qubits, where one of them is used as input for the unitary gate and the other is left untouched, is sufficient. All the information about the unknown gate is contained in the joint output state. This is the problem treated in chapter 3. Now the output state needs to be measured. Again, one could measure the two qubits separately (LOCC) or jointly (collective measurement). Is there anything to gain by performing joint measurements? The answer is yes, optimal collective measurements are at least 3 times more accurate than any LOCC measurement. Chapter 4 treats the problem of estimating commuting unitary gates. There it is shown that this extra information makes it unnecessary to use an entangled input state and to use collective measurements at the output. In chapters 3 and 4 it is assumed that only one copy of the unitary gate is available. If, however, more than one copy (say N ) are available at the same time one could use an N-fold entangled state as input. If no entanglement is used, classical statistics tells us that the error of the estimation is proportional to 1/√N. In the literature, it has been shown that by using an entangled state in the input one can achieve an error proportional to 1/N. However, this has been shown only for qubit gates. In chapter 5 important steps are taken in the direction of showing the same thing for a general unitary gate, but this remains an open problem.

•Jan 1, 2001•4 citations
State estimation is a classical problem in quantum information. In optimization of an estimation scheme, to find a lower bound to the error of the estimator is a very important step. So far, all the proposed tractable lower bounds use a derivative of the density matrix. However, sometimes, we are interested in quantities with singularity, e.g. concurrence etc. In this paper, lower bounds to a mean square error of an estimator are derived for a quantum estimation problem without smoothness assumptions. Our main idea is to replace the derivative by difference, as is done in classical estimation theory. We applied the inequalities to several examples, and derived an optimal estimator for some of them.
Several quantities of interest in quantum information, including entanglement and purity, are nonlinear functions of the density matrix and cannot, even in principle, correspond to proper quantum observables. Any method aimed to determine the value of these quantities should resort to indirect measurements and thus corresponds to a parameter estimation problem whose solution, i.e the determination of the most precise estimator, unavoidably involves an optimization procedure. We review local quantum estimation theory and present explicit formulas for the symmetric logarithmic derivative and the quantum Fisher information of relevant families of quantum states. Estimability of a parameter is defined in terms of the quantum signal-to-noise ratio and the number of measurements needed to achieve a given relative error. The connections between the optmization procedure and the geometry of quantum statistical models are discussed. Our analysis allows to quantify quantum noise in the measurements of non observable quantities and provides a tools for the characterization of signals and devices in quantum technology. 1.
Several quantities of interest in quantum information, including entanglement and purity, are nonlinear functions of the density matrix and cannot, even in principle, correspond to proper quantum observables. Any method aimed to determine the value of these quantities should resort to indirect measurements and thus corresponds to a parameter estimation problem whose solution, i.e. the determination of the most precise estimator, unavoidably involves an optimization procedure. We review local quantum estimation theory and present explicit formulas for the symmetric logarithmic derivative and the quantum Fisher information of relevant families of quantum states. Estimability of a parameter is defined in terms of the quantum signal-to-noise ratio and the number of measurements needed to achieve a given relative error. The connections between the optmization procedure and the geometry of quantum statistical models are discussed. Our analysis allows to quantify quantum noise in the measurements of non observable quantities and provides a tools for the characterization of signals and devices in quantum technology.
Quantum estimation theory provides optimal observations for various estimation problems for unknown parameters in the state of the system under investigation. However, the theory has been developed under the assumption that every observable is available for experimenters. Here, we generalize the theory to problems in which the experimenter can use only locally accessible observables. For such problems, we establish a Cram\'er-Rao-type inequality by obtaining an explicit form of the Fisher information as a reciprocal lower bound for the mean-square errors of estimations by locally accessible observables. Furthermore, we explore various local quantum estimation problems for composite systems, where nontrivial combinatorics is needed for obtaining the Fisher information.
Using a higher order derivative with respect to the parameter, we will give lower bounds for variance of unbiased estimators in quantum estimation problems. This is a quantum version of the Bhattacharyya inequality in the classical statistical estimation. Because of the non-commutativity of operator multiplication, we obtain three different types of lower bounds: Type S, Type R and Type L. If the parameter is a real number, the Type S bound is useful. If the parameter is complex, the Type R and L bounds are useful. As an application, we will consider estimation of polynomials of the complex amplitude of the quantum Gaussian state. For the case where the amplitude lies in the real axis, a uniformly optimum estimator for the square of the amplitude will be derived using the Type S bound. It will be shown that there is no unbiased estimator uniformly optimum as a polynomial of annihilation and/or creation operators for the cube of the amplitude. For the case where the amplitude does not necessarily lie in the real axis, uniformly optimum estimators for holomorphic, antiholomorphic and real-valued polynomials of the amplitude will be derived. Those estimators for the holomorphic and real-valued cases attain the Type R bound, and those for the antiholomorphic and real-valued cases attain the Type L bound. This paper clarifies what is the best method to measure the energy of a laser.
Determining the closeness of two quantum states with minimal error probability is a central problem in quantum information theory. The optimal exponents characterizing the error probability in the symmetric and asymmetric settings are given by the quantum Chernoff bound (QCB) and the quantum Hoeffding bound (QHB), respectively. In this work, we introduce the first algorithms for estimating the QCB and QHB of two unknown states. We propose a unitary encoding for diagonal density matrix based on the copy matrix, which enables unbiased estimation of nonlinear matrix functions via quantum singular value transformation (QSVT). For general density matrices, we combine QSVT with the Hadamard test to estimate both QCB and QHB. Numerical simulations demonstrate that the algorithm converges to the optimal value within a limited number of iterations. Furthermore, we establish the first integration of QSVT with convex optimization, yielding a hybrid quantum-classical framework for quantum estimation.
The subject of this thesis, quantum estimation theory, is inspired by recent developments, both practical and theoretical, in the new field of quantum information and computation. The main task of quantum estimation theory, the subject of this thesis, is that given many identical copies of an unknown quantum system one wants to "guess" or estimate what the system is. This is done by performing an "optimal" measurement and analyzing the data obtained from it. A quantum state is represented by a density matrix. In some cases one does not need to know the whole density matrix, sometimes a partial characterization is enough. Chapter 2 of this thesis is about optimally estimating the spectrum, i.e. the eigenvalues, of a density matrix. This is useful, for example, for estimating the entanglement of a bipartite pure state. The results of chapter 2 tell us that one can optimally estimate bipartite entanglement with LOCC measurements on one of the two parties. Unitary operations transform density matrices to density matrices. They are the gates of quantum information processing. Suppose one has one such unitary operation but one does not know what it does. In order to characterize it one needs to know how it transforms any input state. In order to know how a particular state is transformed, one can prepare that state, feed it to the unitary many times, and measure the output. One state is, of course, not enough. It turns out that the unitary can be completely characterized with a finite set of states, this is known as quantum process tomography. Unfortunately, in many cases it is difficult to have available in the lab all the input states needed to perform quantum process tomography. It is here where entanglement comes to the rescue. One pair of maximally entangled qubits, where one of them is used as input for the unitary gate and the other is left untouched, is sufficient. All the information about the unknown gate is contained in the joint output state. This is the problem treated in chapter 3. Now the output state needs to be measured. Again, one could measure the two qubits separately (LOCC) or jointly (collective measurement). Is there anything to gain by performing joint measurements? The answer is yes, optimal collective measurements are at least 3 times more accurate than any LOCC measurement. Chapter 4 treats the problem of estimating commuting unitary gates. There it is shown that this extra information makes it unnecessary to use an entangled input state and to use collective measurements at the output. In chapters 3 and 4 it is assumed that only one copy of the unitary gate is available. If, however, more than one copy (say N ) are available at the same time one could use an N-fold entangled state as input. If no entanglement is used, classical statistics tells us that the error of the estimation is proportional to 1/√N. In the literature, it has been shown that by using an entangled state in the input one can achieve an error proportional to 1/N. However, this has been shown only for qubit gates. In chapter 5 important steps are taken in the direction of showing the same thing for a general unitary gate, but this remains an open problem.