Higher-order covariance matrices for non-Gaussian quantum states

• URL: http://arxiv.org/abs/2607.11759v1
• Date: Mon, 13 Jul 2026 16:22:04 GMT
• Title: Higher-order covariance matrices for non-Gaussian quantum states
• Abstract summary: We define higher-order covariance matrices for non-Gaussian quantum states.<n>They can be used to evaluate the effect of Gaussian transformations on non-Gaussian states and can be used to address nonlinear squeezing or non-Gaussian nullifiers.<n>The dimension of a higher-order covariance matrix does not depend on the span of the quantum states in Fock basis.
• Score: 0.30586855806896035
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Covariance matrices lie at the heart of the powerful and well-established symplectic framework for describing continuous-variable Gaussian quantum states. However, since this framework only relies on first- and second-order moments, it is not sufficient for the analysis of non-Gaussian states because their higher-order moments are essential to capture some of their key properties. Here, we define higher-order covariance matrices -- more precisely, covariance matrices built from higher-order quadrature monomials -- which provide a simple way to evaluate the effect of Gaussian transformations on non-Gaussian states and can be used, for example, to address nonlinear squeezing or non-Gaussian nullifiers. Higher-order covariance matrices can be estimated from homodyne measurement data using only a limited number of quadrature angles, which involves matrices of moderate dimension compared with a full simulation in the Fock basis. The dimension of a higher-order covariance matrix does not depend on the span of the quantum states in Fock basis and, furthermore, scales only polynomially with the number of modes.

Related papers

• Conditional Independence Estimates for the Generalized Nonparanormal [0.0]
  This paper builds on previous work to show that for a class of non-Gaussian distributions, information about the conditional independence structure can still be inferred from the precision matrix.<n>We provide a simple and computationally efficient algorithm that leverages this theory to recover conditional independence structure from the generalized nonparanormal data.
  arXiv  Detail & Related papers  (2025-08-14T20:19:30Z)
• The symplectic rank of non-Gaussian quantum states [0.0]
  Non-Gaussianity is a key resource for achieving quantum advantages in bosonic platforms.<n>Here, we investigate the symplectic rank: a novel non-Gaussianity monotone that satisfies remarkable operational and resource-theoretic properties.<n>We show that the symplectic rank is a robust non-Gaussian measure, explaining how to witness it in experiments and how to exploit it to meaningfully benchmark different bosonic platforms.
  arXiv  Detail & Related papers  (2025-04-27T18:00:31Z)
• Efficient conversion from fermionic Gaussian states to matrix product states [48.225436651971805]
  We propose a highly efficient algorithm that converts fermionic Gaussian states to matrix product states.<n>It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems.<n>The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• Approximate orthogonality of permutation operators, with application to quantum information [0.9790236766474201]
  Consider the $n!$ different unitary matrices that permute $n$ $d$-dimensional quantum systems. If $dgeq n$ then they are linearly independent. This simple point has several applications in quantum information and random matrix theory.
  arXiv  Detail & Related papers  (2023-09-01T19:45:30Z)
• Deterministic Gaussian conversion protocols for non-Gaussian single-mode resources [58.720142291102135]
  We show that cat and binomial states are approximately equivalent for finite energy, while this equivalence was previously known only in the infinite-energy limit. We also consider the generation of cat states from photon-added and photon-subtracted squeezed states, improving over known schemes by introducing additional squeezing operations.
  arXiv  Detail & Related papers  (2022-04-07T11:49:54Z)
• Riemannian statistics meets random matrix theory: towards learning from high-dimensional covariance matrices [2.352645870795664]
  This paper shows that there seems to exist no practical method of computing the normalising factors associated with Riemannian Gaussian distributions on spaces of high-dimensional covariance matrices. It is shown that this missing method comes from an unexpected new connection with random matrix theory. Numerical experiments are conducted which demonstrate how this new approximation can unlock the difficulties which have impeded applications to real-world datasets.
  arXiv  Detail & Related papers  (2022-03-01T03:16:50Z)
• Spectral clustering under degree heterogeneity: a case for the random walk Laplacian [83.79286663107845]
  This paper shows that graph spectral embedding using the random walk Laplacian produces vector representations which are completely corrected for node degree. In the special case of a degree-corrected block model, the embedding concentrates about K distinct points, representing communities.
  arXiv  Detail & Related papers  (2021-05-03T16:36:27Z)
• Can Single-Shuffle SGD be Better than Reshuffling SGD and GD? [77.82009268160053]
  We conjecture that the means of matrix products corresponding to with- and without-replacement variants of SGD satisfy a series of spectral norm inequalities. We present theorems that support our conjecture by proving several special cases.
  arXiv  Detail & Related papers  (2021-03-12T04:34:45Z)
• Multi-Objective Matrix Normalization for Fine-grained Visual Recognition [153.49014114484424]
  Bilinear pooling achieves great success in fine-grained visual recognition (FGVC) Recent methods have shown that the matrix power normalization can stabilize the second-order information in bilinear features. We propose an efficient Multi-Objective Matrix Normalization (MOMN) method that can simultaneously normalize a bilinear representation.
  arXiv  Detail & Related papers  (2020-03-30T08:40:35Z)
• 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)

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.