We obtain several analogs of real polar decomposition for even dimensional matrices. In particular, we decompose a non-degenerate matrix as a product of a Hamiltonian and an anti-symplectic matrix and under additional requirements we decompose a matrix as a skew-Hamiltonian and a symplectic matrix. We apply our results to study bosonic Gaussian channels up to inhomogeneous symplectic transforms.
We obtain several analogs of real polar decomposition for even dimensional matrices. In particular, we decompose a non-degenerate matrix as a product of a Hamiltonian and an anti-symplectic matrix and under additional requirements we decompose a matrix as a skew-Hamiltonian and a symplectic matrix. We apply our results to study bosonic Gaussian channels up to inhomogeneous symplectic transforms.
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.
Gaussian unitaries play a fundamental role in the field of continuous variables. In the general n mode, they may formulated by a second-order polynomial in the bosonic operators. Another important role related to Gaussian unitaries is played by the symplectic transformations in the phase space. The paper investigates the links between the two representations: the link from Hamiltonian to symplectic, governed by an exponential, and the link from symplectic to Hamiltonian, governed by a logarithm. Thus, an answer is given to the non-trivial question: which Hamiltonian produces a given symplectic representation? The complex instead of the traditional real symplectic representation is considered, with the advantage of getting compact and elegant relations. The application to the single, two, and three modes illustrates the theory.
An important theorem in Gaussian quantum information tells us that we can diagonalize the covariance matrix of any Gaussian state via a symplectic transformation. While the diagonal form is easy to find, the process for finding the diagonalizing symplectic can be more difficult, and a common, existing method requires taking matrix powers, which can be demanding analytically. Inspired by a recently presented technique for finding the eigenvectors of a Hermitian matrix from certain submatrix eigenvalues, we derive a similar method for finding the diagonalizing symplectic from certain submatrix determinants, which could prove useful in Gaussian quantum information.
Gaussian unitaries are specified by a second order polynomial in the bosonic operators, that is, by a quadratic polynomial and a linear term. From the Hamiltonian other equivalent representations of the Gaussian unitaries are obtained, such as Bogoliubov and real symplectic transformations. The paper develops an alternative representation, called complex symplectic transformation, which is more compact and is comprehensive of both Bogoliubov and real symplectic transformations. Moreover, it has other advantages. One of the main results of the theory, not available in the literature, is that the final displacement is not simply given by the linear part of the Hamiltonian, but depends also on the quadratic part. In particular, it is shown that by combining squeezing and rotation, it is possible to achieve a final displacement with an arbitrary amount.
A complete analysis of multi-mode bosonic Gaussian channels is proposed. We clarify the structure of unitary dilations of general Gaussian channels involving any number of bosonic modes and present a normal form. The maximum number of auxiliary modes that is needed is identified, including all rank deficient cases, and the specific role of additive classical noise is highlighted. By using this analysis, we derive a canonical matrix form of the noisy evolution of n-mode bosonic Gaussian channels and of their weak complementary counterparts, based on a recent generalization of the normal mode decomposition for non-symmetric or locality constrained situations. It allows us to simplify the weak-degradability classification. Moreover, we investigate the structure of some singular multi-mode channels, like the additive classical noise channel that can be used to decompose a noisy channel in terms of a less noisy one in order to find new sets of maps with zero quantum capacity. Finally, the two-mode case is analyzed in detail. By exploiting the composition rules of
The polar decomposition for a matrix A is A=UB, where B is a positive Hermitian matrix and U is unitary (or, if A is not square, an isometry). This paper shows that the ability to apply a Hamiltonian $\pmatrix{ 0 & A^\dagger \cr A & 0 \cr} $ translates into the ability to perform the transformations e−iBt and U in a deterministic fashion. We show how to use the quantum polar decomposition algorithm to solve the quantum Procrustes problem, to perform pretty good measurements, to find the positive Hamiltonian closest to any Hamiltonian, and to perform a Hamiltonian version of the quantum singular value transformation.