Wishart and random density matrices: Analytical results for the mean-square Hilbert-Schmidt distance

• URL: http://arxiv.org/abs/2008.05153v1
• Date: Wed, 12 Aug 2020 07:49:12 GMT
• Title: Wishart and random density matrices: Analytical results for the mean-square Hilbert-Schmidt distance
• Authors: Santosh Kumar
• Abstract summary: We calculate exact and compact results for the mean square Hilbert-Schmidt distance between a random density matrix and a fixed density matrix. We also obtain corresponding exact results for the distance between a Wishart matrix and a fixed Hermitian matrix, and two Wishart matrices.
• Score: 1.2225709246035374
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Hilbert-Schmidt distance is one of the prominent distance measures in quantum information theory which finds applications in diverse problems, such as construction of entanglement witnesses, quantum algorithms in machine learning, and quantum state tomography. In this work, we calculate exact and compact results for the mean square Hilbert-Schmidt distance between a random density matrix and a fixed density matrix, and also between two random density matrices. In the course of derivation, we also obtain corresponding exact results for the distance between a Wishart matrix and a fixed Hermitian matrix, and two Wishart matrices. We verify all our analytical results using Monte Carlo simulations. Finally, we apply our results to investigate the Hilbert-Schmidt distance between reduced density matrices generated using coupled kicked tops.

Related papers

• Large-Scale Quantum Separability Through a Reproducible Machine Learning Lens [5.499796332553708]
  The quantum separability problem consists in deciding whether a bipartite density matrix is entangled or separable. We propose a machine learning pipeline for finding approximate solutions for this NP-hard problem in large-scale scenarios.
  arXiv  Detail & Related papers  (2023-06-15T18:53:26Z)
• Vectorization of the density matrix and quantum simulation of the von Neumann equation of time-dependent Hamiltonians [65.268245109828]
  We develop a general framework to linearize the von-Neumann equation rendering it in a suitable form for quantum simulations. We show that one of these linearizations of the von-Neumann equation corresponds to the standard case in which the state vector becomes the column stacked elements of the density matrix. A quantum algorithm to simulate the dynamics of the density matrix is proposed.
  arXiv  Detail & Related papers  (2023-06-14T23:08:51Z)
• Sliced-Wasserstein on Symmetric Positive Definite Matrices for M/EEG Signals [24.798859309715667]
  We propose a new method to deal with distributions of covariance matrices. We show that it is an efficient surrogate to the Wasserstein distance in domain adaptation for Brain Computer Interface applications.
  arXiv  Detail & Related papers  (2023-03-10T09:08:46Z)
• Random density matrices: Analytical results for mean fidelity and variance of squared Bures distance [1.2225709246035374]
  We derive exact results for the average fidelity and variance of the squared Bures distance between a fixed density matrix and a random density matrix. The analytical results are corroborated using Monte Carlo simulations.
  arXiv  Detail & Related papers  (2022-11-10T13:58:27Z)
• 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)
• Near-optimal estimation of smooth transport maps with kernel sums-of-squares [81.02564078640275]
  Under smoothness conditions, the squared Wasserstein distance between two distributions could be efficiently computed with appealing statistical error upper bounds. The object of interest for applications such as generative modeling is the underlying optimal transport map. We propose the first tractable algorithm for which the statistical $L2$ error on the maps nearly matches the existing minimax lower-bounds for smooth map estimation.
  arXiv  Detail & Related papers  (2021-12-03T13:45:36Z)
• Mean-Square Analysis with An Application to Optimal Dimension Dependence of Langevin Monte Carlo [60.785586069299356]
  This work provides a general framework for the non-asymotic analysis of sampling error in 2-Wasserstein distance. Our theoretical analysis is further validated by numerical experiments.
  arXiv  Detail & Related papers  (2021-09-08T18:00:05Z)
• Random density matrices: Analytical results for mean root fidelity and mean square Bures distance [1.0348777118111825]
  Bures distance holds a special place among various distance measures due to its several distinguished features. It is related to fidelity and, among other things, it serves as a bona fide measure for quantifying the separability of quantum states.
  arXiv  Detail & Related papers  (2021-05-06T15:13:14Z)
• Spectral statistics for the difference of two Wishart matrices [1.2225709246035374]
  We derive the joint probability density function of the corresponding eigenvalues in a finite-dimension scenario using two distinct approaches. We point out the relationship of these results with the corresponding results for difference of two random density matrices and obtain some explicit and closed form expressions for the spectral density and absolute mean.
  arXiv  Detail & Related papers  (2020-11-14T18:43:34Z)
• Hilbert-space geometry of random-matrix eigenstates [55.41644538483948]
  We discuss the Hilbert-space geometry of eigenstates of parameter-dependent random-matrix ensembles. Our results give the exact joint distribution function of the Fubini-Study metric and the Berry curvature. We compare our results to numerical simulations of random-matrix ensembles as well as electrons in a random magnetic field.
  arXiv  Detail & Related papers  (2020-11-06T19:00:07Z)
• 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.