Multi-Unitary Complex Hadamard Matrices
- URL: http://arxiv.org/abs/2306.00999v2
- Date: Fri, 14 Jun 2024 18:45:37 GMT
- Title: Multi-Unitary Complex Hadamard Matrices
- Authors: Wojciech Bruzda, Grzegorz Rajchel-Mieldzioć, Karol Życzkowski,
- Abstract summary: We analyze the set of real and complex Hadamard matrices with additional symmetry constrains.
Such matrices find several applications in quantum many-body theory, tensor networks and classification of multipartite quantum entanglement.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- Abstract: We analyze the set of real and complex Hadamard matrices with additional symmetry constrains. In particular, we link the problem of existence of maximally entangled multipartite states of $2k$ subsystems with $d$ levels each to the set of complex Hadamard matrices of order $N=d^k$. To this end, we investigate possible subsets of such matrices which are, dual, strongly dual ($H=H^{\rm R}$ or $H=H^{\rm\Gamma}$), two-unitary ($H^R$ and $H^{\Gamma}$ are unitary), or $k$-unitary. Here $X^{\rm R}$ denotes reshuffling of a matrix $X$ describing a bipartite system, and $X^{\rm \Gamma}$ its partial transpose. Such matrices find several applications in quantum many-body theory, tensor networks and classification of multipartite quantum entanglement and imply a broad class of analytically solvable quantum models in $1+1$ dimensions.
Related papers
- The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$.
As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
arXiv Detail & Related papers (2024-10-26T06:21:42Z) - Efficient Unitary T-designs from Random Sums [0.6640968473398456]
Unitary $T$-designs play an important role in quantum information, with diverse applications in quantum algorithms, benchmarking, tomography, and communication.
We provide a new construction of $T$-designs via random matrix theory using $tildeO(T2 n2)$ quantum gates.
arXiv Detail & Related papers (2024-02-14T17:32:30Z) - One-sided Matrix Completion from Two Observations Per Row [95.87811229292056]
We propose a natural algorithm that involves imputing the missing values of the matrix $XTX$.
We evaluate our algorithm on one-sided recovery of synthetic data and low-coverage genome sequencing.
arXiv Detail & Related papers (2023-06-06T22:35:16Z) - Two-body Coulomb problem and $g^{(2)}$ algebra (once again about the
Hydrogen atom) [77.34726150561087]
It is shown that if the symmetry of the three-dimensional system is $(r, rho, varphi)$, the variables $(r, rho, varphi)$ allow a separation of variable $varphi$ and eigenfunctions.
Thoses occur in the study of the Zeeman effect on Hydrogen atom.
arXiv Detail & Related papers (2022-12-02T20:11:17Z) - Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk.
The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra.
As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
arXiv Detail & Related papers (2022-08-12T15:05:07Z) - Spectral properties of sample covariance matrices arising from random
matrices with independent non identically distributed columns [50.053491972003656]
It was previously shown that the functionals $texttr(AR(z))$, for $R(z) = (frac1nXXT- zI_p)-1$ and $Ain mathcal M_p$ deterministic, have a standard deviation of order $O(|A|_* / sqrt n)$.
Here, we show that $|mathbb E[R(z)] - tilde R(z)|_F
arXiv Detail & Related papers (2021-09-06T14:21:43Z) - 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) - Algebraic and geometric structures inside the Birkhoff polytope [0.0]
Birkhoff polytope $mathcalB_d$ consists of all bistochastic matrices of order $d$.
We prove that $mathcalL_d$ and $mathcalF_d$ are star-shaped with respect to the flat matrix.
arXiv Detail & Related papers (2021-01-27T09:51:24Z) - Emergent universality in critical quantum spin chains: entanglement
Virasoro algebra [1.9336815376402714]
Entanglement entropy and entanglement spectrum have been widely used to characterize quantum entanglement in extended many-body systems.
We show that the Schmidt vectors $|v_alpharangle$ display an emergent universal structure, corresponding to a realization of the Virasoro algebra of a boundary CFT.
arXiv Detail & Related papers (2020-09-23T21:22:51Z) - The decomposition of an arbitrary $2^w\times 2^w$ unitary matrix into
signed permutation matrices [0.0]
Birkhoff's theorem tells that any doubly matrix can be decomposed as a weighted sum of permutation matrices.
A similar theorem reveals that any unitary matrix can be decomposed as a weighted sum of complex permutation matrices.
arXiv Detail & Related papers (2020-05-26T18:26:05Z) - A computable multipartite multimode Gaussian correlation measure and the
monogamy relation for continuous-variable systems [4.205209248693658]
A computable multipartite multimode Gaussian quantum correlation measure is proposed.
$mathcal M(k)$ satisfies the hierarchy condition that a multipartite quantum correlation measure should obey.
arXiv Detail & Related papers (2020-01-05T14:25:09Z)
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.