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:2009.03990 · International Journal of Modern Physics A

A tale of three diagonalizations

Howard E. Haber

Published Feb 10, 2021• 8 citations
arXivHTMLPDF

Abstract

In addition to the diagonalization of a normal matrix by a unitary similarity transformation, there are two other types of diagonalization procedures that sometimes arise in quantum theory applications — the singular value decomposition and the Autonne–Takagi factorization. In this pedagogical review, each of these diagonalization procedures is performed for the most general [Formula: see text] matrices for which the corresponding diagonalization is possible, and explicit analytical results are provided in each of the three cases.

DOI
10.1142/s0217751x21300027

Related papers

Singular value decomposition for skew-Takagi factorization with quantum applications

Alexander Evgen’evich Teretenkov

We obtain an algorithm for the skew-Takagi factorization based on the singular value decomposition. As an example application of such an algorithm, we consider the computation of Heisenberg evolution of the fermionic creation and annihilation operators in the case of the quadratic Hamiltonian of a special form

Linear and Multilinear Algebra•Dec 2, 2021•3 citations

Matrix decompositions in quantum optics: Takagi/Autonne, Bloch–Messiah/Euler, Iwasawa, and Williamson

Martin Houde, Will McCutcheon, Nicolás Quesada

In this tutorial, we summarize four important matrix decompositions commonly used in quantum optics, namely the Takagi/Autonne, Bloch–Messiah/Euler, Iwasawa, and Williamson decompositions. The first two of these decompositions are specialized versions of the singular-value decomposition when applied to symmetric or symplectic matrices. The third factors any symplectic matrix in a unique way in terms of matrices that belong to different subgroups of the symplectic group. The last one instead gives the symplectic diagonalization of real, positive definite matrices of even size. While proofs of the existence of these decompositions exist in the literature, we review explicit constructions to implement these decompositions using standard linear algebra packages and functionalities such as singular-value, polar, Schur, and QR decompositions, and matrix square roots and inverses.

arXiv:2403.04596•Canadian Journal of Physics•Jul 17, 2024•40 citations

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

Hiroshi Nagaoka

WORLD SCIENTIFIC eBooks•Feb 1, 2005•19 citations

Eigenvalues II, Matrix Diagonalization and Unitary Matrix

Hiu Yung Wong

Springer eBooks•Jun 21, 2023•0 citations

Bloch-Messiah reduction of Gaussian unitaries by Takagi factorization

Gianfranco Cariolaro, Gianfranco L. Pierobon

The Bloch-Messiah (BM) reduction allows the decomposition of an arbitrarily complicated Gaussian unitary into a very simple scheme in which linear optical components are separated from nonlinear ones. The nonlinear part is due to the squeezing possibly present in the Gaussian unitary. The reduction is usually obtained by exploiting the singular value decomposition (SVD) of the matrices appearing in the Bogoliubov transformation of the given Gaussian unitary. This paper discusses a different approach, where the BM reduction is obtained in a straightforward way. It is based on the Takagi factorization of the (complex and symmetric) squeeze matrix and has the advantage of avoiding several matrix operations of the previous approach (polar decomposition, eigendecomposition, SVD, and Takagi factorization). The theory is illustrated with an application example in which the previous and present approaches are compared.

Physical Review A•Dec 12, 2016•48 citations

Entanglement in Bipartite Quantum Systems with Fast Local Unitary Control

Emanuel Malvetti

The well-known Schmidt decomposition, or equivalently, the complex singular value decomposition, states that a pure quantum state of a bipartite system can always be brought into a "diagonal" form using local unitary transformations. In this work we consider a finite-dimensional closed bipartite system with fast local unitary control. In this setting one can define a reduced control system on the singular values of the state which is equivalent to the original control system. We explicitly describe this reduced control system and prove equivalence to the original system. Moreover, using the reduced control system, we prove that the original system is controllable and stabilizable and we deduce quantum speed limits. We also treat the fermionic and bosonic cases in parallel, which are related to the Autonne-Takagi and Hua factorization respectively.

arXiv:2401.07024•Jan 13, 2024•0 citations
In addition to the diagonalization of a normal matrix by a unitary similarity transformation, there are two other types of diagonalization procedures that sometimes arise in quantum theory applications — the singular value decomposition and the Autonne–Takagi factorization. In this pedagogical review, each of these diagonalization procedures is performed for the most general [Formula: see text] matrices for which the corresponding diagonalization is possible, and explicit analytical results are provided in each of the three cases.
In this tutorial, we summarize four important matrix decompositions commonly used in quantum optics, namely the Takagi/Autonne, Bloch–Messiah/Euler, Iwasawa, and Williamson decompositions. The first two of these decompositions are specialized versions of the singular-value decomposition when applied to symmetric or symplectic matrices. The third factors any symplectic matrix in a unique way in terms of matrices that belong to different subgroups of the symplectic group. The last one instead gives the symplectic diagonalization of real, positive definite matrices of even size. While proofs of the existence of these decompositions exist in the literature, we review explicit constructions to implement these decompositions using standard linear algebra packages and functionalities such as singular-value, polar, Schur, and QR decompositions, and matrix square roots and inverses.
The Bloch-Messiah (BM) reduction allows the decomposition of an arbitrarily complicated Gaussian unitary into a very simple scheme in which linear optical components are separated from nonlinear ones. The nonlinear part is due to the squeezing possibly present in the Gaussian unitary. The reduction is usually obtained by exploiting the singular value decomposition (SVD) of the matrices appearing in the Bogoliubov transformation of the given Gaussian unitary. This paper discusses a different approach, where the BM reduction is obtained in a straightforward way. It is based on the Takagi factorization of the (complex and symmetric) squeeze matrix and has the advantage of avoiding several matrix operations of the previous approach (polar decomposition, eigendecomposition, SVD, and Takagi factorization). The theory is illustrated with an application example in which the previous and present approaches are compared.
The well-known Schmidt decomposition, or equivalently, the complex singular value decomposition, states that a pure quantum state of a bipartite system can always be brought into a "diagonal" form using local unitary transformations. In this work we consider a finite-dimensional closed bipartite system with fast local unitary control. In this setting one can define a reduced control system on the singular values of the state which is equivalent to the original control system. We explicitly describe this reduced control system and prove equivalence to the original system. Moreover, using the reduced control system, we prove that the original system is controllable and stabilizable and we deduce quantum speed limits. We also treat the fermionic and bosonic cases in parallel, which are related to the Autonne-Takagi and Hua factorization respectively.