Symplectic decomposition from submatrix determinants

• URL: http://arxiv.org/abs/2108.05364v2
• Date: Fri, 12 Nov 2021 19:00:01 GMT
• Title: Symplectic decomposition from submatrix determinants
• Authors: Jason L. Pereira, Leonardo Banchi, Stefano Pirandola
• Abstract summary: An important theorem in Gaussian quantum information tells us that we can diagonalise the covariance matrix of any Gaussian state via a symplectic transformation. 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 diagonalising symplectic from certain submatrix determinants.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An important theorem in Gaussian quantum information tells us that we can diagonalise the covariance matrix of any Gaussian state via a symplectic transformation. Whilst the diagonal form is easy to find, the process for finding the diagonalising 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 diagonalising symplectic from certain submatrix determinants, which could prove useful in Gaussian quantum information.

Related papers

• Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
  Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations.
  arXiv  Detail & Related papers  (2024-07-15T07:11:44Z)
• Towards Faster Matrix Diagonalization with Graph Isomorphism Networks and the AlphaZero Framework [1.0051474951635875]
  We introduce innovative approaches for accelerating the Jacobi method for matrix diagonalization. We examine the potential of utilizing scalable architecture between different-sized matrices.
  arXiv  Detail & Related papers  (2024-06-30T17:45:01Z)
• Polynomial-depth quantum algorithm for computing matrix determinant [46.13392585104221]
  We propose an algorithm for calculating the determinant of a square matrix, and construct a quantum circuit realizing it. Each row of the matrix is encoded as a pure state of some quantum system. The admitted matrix is therefore arbitrary up to the normalization of quantum states of those systems.
  arXiv  Detail & Related papers  (2024-01-29T23:23:27Z)
• Unitarization of Pseudo-Unitary Quantum Circuits in the S-matrix Framework [0.0]
  We show a family of pseudo-unitary and inter-pseudo-unitary circuits with full diagrammatic representation in three dimensions. The outcomes of our study expand the methodological toolbox needed to build a family of pseudo-unitary and inter-pseudo-unitary circuits.
  arXiv  Detail & Related papers  (2023-02-09T14:55:20Z)
• Detection of tripartite entanglement based on principal basis matrix representations [1.3319340093980596]
  We study the entanglement in tripartite quantum systems by using the principal basis matrix representations of density matrices. Detailed examples show that our method can detect more entangled states than previous ones.
  arXiv  Detail & Related papers  (2022-02-13T01:25:37Z)
• Quantum algorithms for matrix operations and linear systems of equations [65.62256987706128]
  We propose quantum algorithms for matrix operations using the "Sender-Receiver" model. These quantum protocols can be used as subroutines in other quantum schemes.
  arXiv  Detail & Related papers  (2022-02-10T08:12:20Z)
• Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors [54.936314353063494]
  We provide recovery guarantees for a correlation-based optimization algorithm for robust 1-bit compressive sensing. We make use of a practical iterative algorithm, and perform numerical experiments on image datasets to corroborate our results.
  arXiv  Detail & Related papers  (2021-08-08T05:28:06Z)
• Non-PSD Matrix Sketching with Applications to Regression and Optimization [56.730993511802865]
  We present dimensionality reduction methods for non-PSD and square-roots" matrices. We show how these techniques can be used for multiple downstream tasks.
  arXiv  Detail & Related papers  (2021-06-16T04:07:48Z)
• General expressions for the quantum Fisher information matrix with applications to discrete quantum imaging [0.28675177318965034]
  We derive general expressions for the quantum Fisher information matrix which bypass matrix diagonalization and do not require the expansion of operators on an orthonormal set of states. We demonstrate the power of our approach by deriving novel results in the timely field of discrete quantum imaging.
  arXiv  Detail & Related papers  (2020-12-02T22:18:22Z)
• Optimal Iterative Sketching with the Subsampled Randomized Hadamard Transform [64.90148466525754]
  We study the performance of iterative sketching for least-squares problems. We show that the convergence rate for Haar and randomized Hadamard matrices are identical, andally improve upon random projections. These techniques may be applied to other algorithms that employ randomized dimension reduction.
  arXiv  Detail & Related papers  (2020-02-03T16:17:50Z)
• J-matrix method of scattering in one dimension: The relativistic theory [0.0]
  We make a relativistic extension of the one-dimensional J-matrix method of scattering. The relativistic potential matrix is a combination of vector, scalar, and pseudo-scalar components.
  arXiv  Detail & Related papers  (2020-01-14T19:02:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.