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

WORLD SCIENTIFIC eBooks

A Generalization of the Simultaneous Diagonalization of Hermitian Matrices and its Relation to Quantum Estimation Theory

Hiroshi Nagaoka

Published Feb 1, 2005• 20 citations
Publisher

Abstract

We study the problem of minimizing a quadratic quantity defined for given two Hermitian matrices X, Y and a positive-definite Hermitian matrix. This problem is reduced to the simultaneous diagonalization of X, Y when XY = YX. We derive a lower bound for the quantity, and in some special cases solve the problem by showing that the lower bound is achievable. This problem is closely related to a simultaneous measurement of quantum mechanical observables which are not commuting and has an application in the theory of quantum state estimation.

DOI
10.1142/9789812563071_0012

Related papers

Noncommuting observables in quantum detection and estimation theory

Carl W. Helstrom, Robert Kennedy

Basing decisions and estimates on simultaneous approximate measurements of noncommuting observables in a quantum receiver is shown to be equivalent to measuring commuting projection operators on a larger Hilbert space than that of the receiver itself. The quantum-mechanical Cramér-Rao inequalities derived from right logarithmic derivatives and symmetrized logarithmic derivatives of the density operator are compared, and it is shown that the latter give superior lower bounds on the error variances of individual unbiased estimates of arrival time and carrier frequency of a coherent signal. For a suitably weighted sum of the error variances of simultaneous estimates of these, the former yield the superior lower bound under some conditions.

IEEE Transactions on Information Theory•Jan 1, 1974•95 citations

The quantum generalization of optimal statistical estimation and hypothesis testing

Rouslan L. Stratonovich

A review of the fundamental ideas and methods of the optimal reception and processing of quantum signals is given. Estimation via an operator based on the usual and generalized measurements (e.g., quasi-measurements) are discussed. The theory of operator estimation enables one to obtain Bayes limits for the usual estimates. The change from usual measurements to quasi-measurements generally improves performance. We show that some quasi-measurements can be realized as indirect measurements, and introduce an operator measure II(db) which describes the quasi-measurements on the space of measurements. Estimation based on quasi-measurements is described by operator measures Q(du) on the space of estimates. Minimization with respect to Q(du) is minimization simultaneously for all quasi-measurements and all estimates. For the M-ary hypothesis testing problem finding the optimum reduces to finding non-negative definite Hermitian operators Q1,…, Q m satisfying Q1+…+Q m = 1 where 1 is the identity operator, which extremize. Optimal Bayes quantum estimation is discussed. In the case of Gaussian quantum signal and minimum variance estimation, finding the quasi-measurements leads to optimal linear estimation. Further suboptimal methods for finding the operator in more general cases are discussed.

Stochastics•Jan 1, 1973•17 citations

Quantum estimation for non-differentiable models

Yoshiyuki Tsuda, Keiji Matsumoto

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.

arXiv:quant-ph/0207150•Journal of Physics A Mathematical and General•Feb 3, 2005•14 citations

Polynomial Algorithms for Simultaneous Unitary Similarity and Equivalence

Harikrishna V. J, R. Vittal Rao, K. R. Ramakrishnan

We present an algorithm to solve the Simultaneous Unitary Similarity(S.U.S) problem which is to check if there exists a Similarity transformation determined by a Unitary $U$ s.t $UA_lU^*=B_l$, $l \in \{1,...,p\}$, where $A_l$ and $B_l$ are $nxn$ complex matrices. We observe that the problem is simplest when $U$ is diagonal, where we see that the `paths' in the graph defined by non-zero elements of $A_l$ and $B_l$ determine the solution. Inspired by this we generalize this to the case when $U$ is block-diagonal to identify a form refered to as the `Solution-form' using `paths' determined by non-zero sub-matrices of $A_l,B_l$ which are non-zero multiples of Unitary. When not in Solution form we find an equivalent problem to solve by diagonalizing a Hermitian or a Normal matrix related to the sub-matrices. The problem is solved in a maximum of $n$ steps. The same idea can be extended to solve the Simultaneous Unitary Equivalence (S$.$U$.$Eq) problem where we solve for $U,V$ in $UA_lV^*=B_l$, $A_l,B_l$ being $mxn$ Complex rectangular matrices. Here we work with the 'paths' in the related bi-graph to define the Solution-form. The algorithms have a complexity of $O(pn^4)$. This work finds application in Quantum Evolution, Quantum gate design and Simulation. The salient features of each step of the algorithm can be retained as Canonical features to classify a given collection of complex matrices up to Unitary Similarity.

math.RACross-listedarXiv:2511.19439•Nov 11, 2025•0 citations

Computing eigenvalues of diagonalizable matrices in a quantum computer

Changpeng Shao

Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient quantum algorithms for Hermitian and unitary matrices. However, the general case is far from fully understood. Combining quantum phase estimation, quantum algorithm to solve linear differential equations and quantum singular value estimation, we propose two quantum algorithms to compute the eigenvalues of diagonalizable matrices that only have real eigenvalues and normal matrices. The output of the quantum algorithms is a superposition of the eigenvalues and the corresponding eigenvectors. The complexities are dominated by solving a linear system of ODEs and performing quantum singular value estimation, which usually can be solved efficiently in a quantum computer. In the special case when the matrix $M$ is $s$-sparse, the complexity is $\widetilde{O}(sρ^2 κ^2/ε^2)$ for diagonalizable matrices that only have real eigenvalues, and $\widetilde{O}(sρ\|M\|_{\max} /ε^2)$ for normal matrices. Here $ρ$ is an upper bound of the eigenvalues, $κ$ is the conditioning of the eigenvalue problem, and $ε$ is the precision to approximate the eigenvalues. We also extend the quantum algorithm to diagonalizable matrices with complex eigenvalues under an extra assumption.

arXiv:1912.08015•Dec 17, 2019•12 citations

Simultaneous Estimation of Dimension, States and Measurements: Computation of representative density matrices and POVMs

Cyril Stark

This investigation continues a program aiming at obtaining effective quantum models to describe measurement statistics. In [Stark, arXiv:1209.5737 (2012)], we have described how the Gram matrix associated to the prepared states and the performed POVM elements can be estimated via convex relaxation of a rank minimization problem. This Gram matrix determines the density matrices and the POVM elements uniquely up to simultaneous rotations (with respect to the Hilbert-Schmidt inner product) in the vector space of Hermitian matrices. However, when the description of the experiment needs to be connected to textbook quantum mechanics, explicit expressions for the states and the POVM elements in terms of positive semidefinite matrices are required. In this paper, we describe a heuristic algorithm that takes the state-meaurement Gram matrix as input and searches explicit realizations of this Gram matrix in terms of quantum mechanically valid density matrices and POVM elements.

arXiv:1210.1105•Oct 3, 2012•10 citations
We study the problem of minimizing a quadratic quantity defined for given two Hermitian matrices X, Y and a positive-definite Hermitian matrix. This problem is reduced to the simultaneous diagonalization of X, Y when XY = YX. We derive a lower bound for the quantity, and in some special cases solve the problem by showing that the lower bound is achievable. This problem is closely related to a simultaneous measurement of quantum mechanical observables which are not commuting and has an application in the theory of quantum state estimation.
Basing decisions and estimates on simultaneous approximate measurements of noncommuting observables in a quantum receiver is shown to be equivalent to measuring commuting projection operators on a larger Hilbert space than that of the receiver itself. The quantum-mechanical Cramér-Rao inequalities derived from right logarithmic derivatives and symmetrized logarithmic derivatives of the density operator are compared, and it is shown that the latter give superior lower bounds on the error variances of individual unbiased estimates of arrival time and carrier frequency of a coherent signal. For a suitably weighted sum of the error variances of simultaneous estimates of these, the former yield the superior lower bound under some conditions.
A review of the fundamental ideas and methods of the optimal reception and processing of quantum signals is given. Estimation via an operator based on the usual and generalized measurements (e.g., quasi-measurements) are discussed. The theory of operator estimation enables one to obtain Bayes limits for the usual estimates. The change from usual measurements to quasi-measurements generally improves performance. We show that some quasi-measurements can be realized as indirect measurements, and introduce an operator measure II(db) which describes the quasi-measurements on the space of measurements. Estimation based on quasi-measurements is described by operator measures Q(du) on the space of estimates. Minimization with respect to Q(du) is minimization simultaneously for all quasi-measurements and all estimates. For the M-ary hypothesis testing problem finding the optimum reduces to finding non-negative definite Hermitian operators Q1,…, Q m satisfying Q1+…+Q m = 1 where 1 is the identity operator, which extremize. Optimal Bayes quantum estimation is discussed. In the case of Gaussian quantum signal and minimum variance estimation, finding the quasi-measurements leads to optimal linear estimation. Further suboptimal methods for finding the operator in more general cases are discussed.
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.
We present an algorithm to solve the Simultaneous Unitary Similarity(S.U.S) problem which is to check if there exists a Similarity transformation determined by a Unitary UUU s.t UAlU∗=BlUA_lU^*=B_lUAl​U∗=Bl​, l∈{1,...,p}l \in \{1,...,p\}l∈{1,...,p}, where AlA_lAl​ and BlB_lBl​ are nxnnxnnxn complex matrices. We observe that the problem is simplest when UUU is diagonal, where we see that the `paths' in the graph defined by non-zero elements of AlA_lAl​ and BlB_lBl​ determine the solution. Inspired by this we generalize this to the case when UUU is block-diagonal to identify a form refered to as the `Solution-form' using `paths' determined by non-zero sub-matrices of Al,BlA_l,B_lAl​,Bl​ which are non-zero multiples of Unitary. When not in Solution form we find an equivalent problem to solve by diagonalizing a Hermitian or a Normal matrix related to the sub-matrices. The problem is solved in a maximum of nnn steps. The same idea can be extended to solve the Simultaneous Unitary Equivalence (S...U...Eq) problem where we solve for U,VU,VU,V in UAlV∗=BlUA_lV^*=B_lUAl​V∗=Bl​, Al,BlA_l,B_lAl​,Bl​ being mxnmxnmxn Complex rectangular matrices. Here we work with the 'paths' in the related bi-graph to define the Solution-form. The algorithms have a complexity of O(pn4)O(pn^4)O(pn4). This work finds application in Quantum Evolution, Quantum gate design and Simulation. The salient features of each step of the algorithm can be retained as Canonical features to classify a given collection of complex matrices up to Unitary Similarity.
Solving linear systems and computing eigenvalues are two fundamental problems in linear algebra. For solving linear systems, many efficient quantum algorithms have been discovered. For computing eigenvalues, currently, we have efficient quantum algorithms for Hermitian and unitary matrices. However, the general case is far from fully understood. Combining quantum phase estimation, quantum algorithm to solve linear differential equations and quantum singular value estimation, we propose two quantum algorithms to compute the eigenvalues of diagonalizable matrices that only have real eigenvalues and normal matrices. The output of the quantum algorithms is a superposition of the eigenvalues and the corresponding eigenvectors. The complexities are dominated by solving a linear system of ODEs and performing quantum singular value estimation, which usually can be solved efficiently in a quantum computer. In the special case when the matrix MMM is sss-sparse, the complexity is O~(sρ2κ2/ε2)\widetilde{O}(sρ^2 κ^2/ε^2)O(sρ2κ2/ε2) for diagonalizable matrices that only have real eigenvalues, and O~(sρ∥M∥max⁡/ε2)\widetilde{O}(sρ\|M\|_{\max} /ε^2)O(sρ∥M∥max​/ε2) for normal matrices. Here ρρρ is an upper bound of the eigenvalues, κκκ is the conditioning of the eigenvalue problem, and εεε is the precision to approximate the eigenvalues. We also extend the quantum algorithm to diagonalizable matrices with complex eigenvalues under an extra assumption.
This investigation continues a program aiming at obtaining effective quantum models to describe measurement statistics. In [Stark, arXiv:1209.5737 (2012)], we have described how the Gram matrix associated to the prepared states and the performed POVM elements can be estimated via convex relaxation of a rank minimization problem. This Gram matrix determines the density matrices and the POVM elements uniquely up to simultaneous rotations (with respect to the Hilbert-Schmidt inner product) in the vector space of Hermitian matrices. However, when the description of the experiment needs to be connected to textbook quantum mechanics, explicit expressions for the states and the POVM elements in terms of positive semidefinite matrices are required. In this paper, we describe a heuristic algorithm that takes the state-meaurement Gram matrix as input and searches explicit realizations of this Gram matrix in terms of quantum mechanically valid density matrices and POVM elements.