Characterization of preorders induced by positive maps in the set of Hermitian matrices

• URL: http://arxiv.org/abs/2105.08778v1
• Date: Tue, 18 May 2021 18:52:43 GMT
• Title: Characterization of preorders induced by positive maps in the set of Hermitian matrices
• Authors: Julio I. de Vicente
• Abstract summary: Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. I argue how this can be used to construct measures quantifying the lack of positive semidefiniteness of any given Hermitian matrix with relevant monotonicity properties.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Uhlmann showed that there exists a positive, unital and trace-preserving map transforming a Hermitian matrix $A$ into another $B$ if and only if the vector of eigenvalues of $A$ majorizes that of $B$. In this work I characterize the existence of such a transformation when one of the conditions of unitality or trace preservation is dropped. This induces two possible preorders in the set of Hermitian matrices and I argue how this can be used to construct measures quantifying the lack of positive semidefiniteness of any given Hermitian matrix with relevant monotonicity properties. It turns out that the measures in each of the two formalisms are essentially unique.

Related papers

• Complex Eigenvalues in a pseudo-Hermitian \{eta}-Laguerre ensemble [0.0]
  We investigate an ensemble of unstable matrices iso to the beta-Laguerre ensemble.<n> Introducing a small non-Hermitian perturbation breaks the symmetry and drives the eigenvalues into the complex plane.<n>The behavior of these eigenvalues is analyzed in the large matrix-size limit, and our theoretical predictions are supported by numerical simulations.
  arXiv  Detail & Related papers  (2025-11-12T00:27:49Z)
• Efficient Adaptation of Pre-trained Vision Transformer underpinned by Approximately Orthogonal Fine-Tuning Strategy [57.54306942529943]
  We propose an Approximately Orthogonal Fine-Tuning (AOFT) strategy for representing the low-rank weight matrices.<n>Our method achieves competitive performance across a range of downstream image classification tasks.
  arXiv  Detail & Related papers  (2025-07-17T16:09:05Z)
• Partial order and topology of Hermitian matrices and quantum Choquet integrals for density matrices with given expectation values [0.0]
  The set $M$ of $dtimes d$ Hermitian matrices (observables) is studied as a partially ordered set with the L"owner partial order.<n>Upper and lower sets in it, define the concept of cumulativeness in the context of Hermitian matrices.<n>An application of the formalism is to find a density matrix, with given expectation values with respect to $n$ (non-commuting observables)
  arXiv  Detail & Related papers  (2025-06-07T13:32:27Z)
• Quantum Hermitian conjugate and encoding unnormalized matrices [49.494595696663524]
  We develop the family of matrix-manipulation algorithms based on the encoding the matrix elements into the probability amplitudes of the pure superposition state of a certain quantum system. We introduce two extensions to these algorithms which allow (i) to perform Hermitian conjugation of matrices under consideration and (ii) to weaken the restriction to the absolute values of matrix elements unavoidably imposed by the normalization condition for a pure quantum state.
  arXiv  Detail & Related papers  (2025-03-27T08:49:59Z)
• Matrix encoding method in variational quantum singular value decomposition [49.494595696663524]
  We propose the variational quantum singular value decomposition based on encoding the elements of the considered $Ntimes N$ matrix into the state of a quantum system of appropriate dimension.<n> Controlled measurement is involved to avoid small success in ancilla measurement.
  arXiv  Detail & Related papers  (2025-03-19T07:01:38Z)
• 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. It can be formulated for finite-size systems without translation invariance, but becomes particularly appealing when applied to infinite systems. The potential of our method is demonstrated by numerical calculations in two chiral spin liquids.
  arXiv  Detail & Related papers  (2024-08-02T10:15:26Z)
• A note on MDS Property of Circulant Matrices [3.069335774032178]
  In $2014$, Gupta and Ray proved that the circulant involutory matrices over the finite field $mathbbF_2m$ can not be maximum distance separable (MDS) This article delves into circulant matrices possessing these characteristics over the finite field $mathbbF_2m$.
  arXiv  Detail & Related papers  (2024-06-22T16:00:00Z)
• Entrywise error bounds for low-rank approximations of kernel matrices [55.524284152242096]
  We derive entrywise error bounds for low-rank approximations of kernel matrices obtained using the truncated eigen-decomposition. A key technical innovation is a delocalisation result for the eigenvectors of the kernel matrix corresponding to small eigenvalues. We validate our theory with an empirical study of a collection of synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2024-05-23T12:26:25Z)
• Discrete dynamics in the set of quantum measurements [0.0]
  A quantum measurement, often referred to as positive operator-valued measurement (POVM), is a set of positive operators $P_j=P_jdaggeq 0$ summing to identity. We describe discrete transformations in the set of quantum measurements by em blockwise matrices. We formulate our main result: a quantum analog of the Ostrowski description of the classical Birkhoff polytope.
  arXiv  Detail & Related papers  (2023-08-10T19:34:04Z)
• A Result About the Classification of Quantum Covariance Matrices Based on Their Eigenspectra [0.0]
  We find a non-trivial class of eigenspectra with the property that the set of quantum covariance matrices corresponding to any eigenspectrum in this class are related by symplectic transformations. We show that all non-degenerate eigenspectra with this property must belong to this class, and that the set of such eigenspectra coincides with the class of non-degenerate eigenspectra.
  arXiv  Detail & Related papers  (2023-08-07T09:40:09Z)
• 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)
• $h(1) \oplus su(2)$ vector algebra eigenstates with eigenvalues in the matrix domain [0.0]
  We find a subset of generalized vector coherent states in the matrix domain. For a special choice of the matrix eigenvalue parameters we found the so-called vector coherent states with matrices associated to the Heisenberg-Weyl group.
  arXiv  Detail & Related papers  (2023-01-25T18:10:01Z)
• Degeneracies and symmetry breaking in pseudo-Hermitian matrices [0.0]
  We classify the eigenspace of pseudo-Hermitian matrices. We show that symmetry breaking occurs if and only if eigenvalues of opposite kinds on the real axis of the complex eigenvalue plane.
  arXiv  Detail & Related papers  (2022-09-14T19:18:53Z)
• Deep Two-way Matrix Reordering for Relational Data Analysis [41.60125423028092]
  Matrix reordering is a task to permute rows and columns of a given observed matrix. We propose a new matrix reordering method, Deep Two-way Matrix Reordering (DeepTMR), using a neural network model. We demonstrate the effectiveness of proposed DeepTMR by applying it to both synthetic and practical data sets.
  arXiv  Detail & Related papers  (2021-03-26T01:31:24Z)
• Hermitian Matrix Definiteness from Quantum Phase Estimation [3.04585143845864]
  An algorithm to classify a general Hermitian matrix according to its signature is presented. It builds on the Quantum Phase Estimation algorithm, which stores the sign of the eigenvalues of a Hermitian matrix in one ancillary qubit. The algorithm is probabilistic, but it shows good performance, achieving 97% of correct classifications with few qubits.
  arXiv  Detail & Related papers  (2020-09-09T06:08:47Z)
• Joint measurability meets Birkhoff-von Neumann's theorem [77.34726150561087]
  We prove that joint measurability arises as a mathematical feature of DNTs in this context, needed to establish a characterisation similar to Birkhoff-von Neumann's. We also show that DNTs emerge naturally from a particular instance of a joint measurability problem, remarking its relevance in general operator theory.
  arXiv  Detail & Related papers  (2018-09-19T18:57:45Z)
• Relative Error Bound Analysis for Nuclear Norm Regularized Matrix Completion [101.83262280224729]
  We develop a relative error bound for nuclear norm regularized matrix completion. We derive a relative upper bound for recovering the best low-rank approximation of the unknown matrix.
  arXiv  Detail & Related papers  (2015-04-26T13:12:16Z)

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.