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:1909.00838 · Linear and Multilinear Algebra

Symplectic analogs of polar decomposition and their applications to bosonic Gaussian channels

Alexander Evgen’evich Teretenkov

Published May 27, 2020• 3 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1080/03081087.2020.1771253

Related papers

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•49 citations

Evaluation of Hamiltonians from Complex Symplectic Matrices

Gianfranco Cariolaro, Alberto Vigato

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.

Symmetry•Apr 28, 2023•0 citations

Symplectic decomposition from submatrix determinants

Jason L. Pereira, Leonardo Banchi, Stefano Pirandola

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.

arXiv:2108.05364•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Nov 1, 2021•9 citations

From Hamiltonians to complex symplectic transformations

Gianfranco Cariolaro, Gianfranco L. Pierobon

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.

arXiv:1704.02008•Apr 6, 2017•3 citations

Quantum polar decomposition algorithm

Seth Lloyd, Samuel Bosch, Giacomo De Palma +5 more

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.

arXiv:2006.00841•Jun 1, 2020•23 citations

Symplectic Optimization on Bosonic Gaussian States

Christopher Willby, Tomohiro Hashizume, Jason Crain +1 more

Computing bosonic Gaussian ground states via variational optimization is challenging because the covariance matrices must satisfy the uncertainty principle, rendering constrained or Riemannian optimization costly, delicate, and thus difficult to scale, particularly in large and inhomogeneous systems. We introduce a symplectic optimization framework that addresses this challenge by parameterizing covariance matrices directly as positive-definite symplectic matrices using unit-triangular factorizations. This approach enforces all physical constraints exactly, yielding a globally unconstrained variational formulation of the bosonic ground-state problem. The unconstrained structure also naturally supports solution reuse across nearby Hamiltonians: warm-starting from previously optimized covariance matrices substantially reduces the number of optimization steps required for convergence in families of related configurations, as encountered in crystal lattices, molecular systems, and fluids. We demonstrate the method on weakly dipole-coupled lattices, recovering ground-state energies, covariance matrices, and spectral gaps accurately. The framework further provides a foundation for large-scale approximate treatments of weakly non-quadratic interactions and offers potential scaling advantages through tensor-network enhancements.

quant-pharXiv:2601.20832•Jan 29, 2026•0 citations
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.
The polar decomposition for a matrix AAA is A=UBA=UBA=UB, where BBB is a positive Hermitian matrix and UUU is unitary (or, if AAA 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−iBte^{-iBt}e−iBt and UUU 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.
Computing bosonic Gaussian ground states via variational optimization is challenging because the covariance matrices must satisfy the uncertainty principle, rendering constrained or Riemannian optimization costly, delicate, and thus difficult to scale, particularly in large and inhomogeneous systems. We introduce a symplectic optimization framework that addresses this challenge by parameterizing covariance matrices directly as positive-definite symplectic matrices using unit-triangular factorizations. This approach enforces all physical constraints exactly, yielding a globally unconstrained variational formulation of the bosonic ground-state problem. The unconstrained structure also naturally supports solution reuse across nearby Hamiltonians: warm-starting from previously optimized covariance matrices substantially reduces the number of optimization steps required for convergence in families of related configurations, as encountered in crystal lattices, molecular systems, and fluids. We demonstrate the method on weakly dipole-coupled lattices, recovering ground-state energies, covariance matrices, and spectral gaps accurately. The framework further provides a foundation for large-scale approximate treatments of weakly non-quadratic interactions and offers potential scaling advantages through tensor-network enhancements.