Weakly Hadamard diagonalizable graphs and Quantum State Transfer
- URL: http://arxiv.org/abs/2307.01859v2
- Date: Wed, 10 Jul 2024 17:27:03 GMT
- Title: Weakly Hadamard diagonalizable graphs and Quantum State Transfer
- Authors: Darian McLaren, Hermie Monterde, Sarah Plosker,
- Abstract summary: We study Hadamard diagonalizable graphs in the context of quantum state transfer.
We provide numerous properties and constructions of weak Hadamard matrices and weakly Hadamard diagonalizable graphs.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Hadamard diagonalizable graphs are undirected graphs for which the corresponding Laplacian is diagonalizable by a Hadamard matrix. Such graphs have been studied in the context of quantum state transfer. Recently, the concept of a weak Hadamard matrix was introduced: a $\{-1,0, 1\}$-matrix $P$ such that $PP^T$ is tridiagonal, as well as the concept of weakly Hadamard diagonalizable graphs. We therefore naturally explore quantum state transfer in these generalized Hadamards. Given the infancy of the topic, we provide numerous properties and constructions of weak Hadamard matrices and weakly Hadamard diagonalizable graphs in order to better understand them.
Related papers
- 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) - Detection of $d_{1}\otimes d_{2}$ Dimensional Bipartite Entangled State:
A Graph Theoretical Approach [1.5762281194023464]
We show that the constructed unital map $phi$ characterize the quantum state with respect to its purity.
We derive the inequality between the minimum eigenvalue of the density matrix and the weight of the edges of the connected subgraph to detect the entanglement of $d_1 otimes d_2$ dimensional bipartite quantum states.
arXiv Detail & Related papers (2022-02-28T17:13:27Z) - Strong Cospectrality and Twin Vertices in Weighted Graphs [0.0]
We show that a pair of twin vertices in a weighted graph exhibits strong cospectrality with respect to arbitrary Hermitian matrices.
We also generalize known results about equitable and almost equitable partitions, and use these to determine which joins of the form $Xvee H$, where $X$ is either the complete or empty graph, exhibit strong cospectrality.
arXiv Detail & Related papers (2021-11-01T21:18:42Z) - Quantum Information Masking of Hadamard Sets [0.0]
We study quantum information masking of arbitrary dimensional states.
We define the so called Hadamard set of quantum states whose Gram-Schmidt matrix can be diagonalized by Hadamard unitary matrices.
arXiv Detail & Related papers (2021-09-30T02:54:45Z) - Learning Sparse Graph with Minimax Concave Penalty under Gaussian Markov
Random Fields [51.07460861448716]
This paper presents a convex-analytic framework to learn from data.
We show that a triangular convexity decomposition is guaranteed by a transform of the corresponding to its upper part.
arXiv Detail & Related papers (2021-09-17T17:46:12Z) - Symplectic decomposition from submatrix determinants [0.0]
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.
arXiv Detail & Related papers (2021-08-11T18:00:03Z) - 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) - Learning Sparse Graph Laplacian with K Eigenvector Prior via Iterative
GLASSO and Projection [58.5350491065936]
We consider a structural assumption on the graph Laplacian matrix $L$.
The first $K$ eigenvectors of $L$ are pre-selected, e.g., based on domain-specific criteria.
We design an efficient hybrid graphical lasso/projection algorithm to compute the most suitable graph Laplacian matrix $L* in H_u+$ given $barC$.
arXiv Detail & Related papers (2020-10-25T18:12:50Z) - 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) - Graph Metric Learning via Gershgorin Disc Alignment [46.145969174332485]
We propose a fast general projection-free metric learning framework, where the objective $min_textbfM in mathcalS$ is a convex differentiable function of the metric matrix $textbfM$.
We prove that the Gershgorin discs can be aligned perfectly using the first eigenvector $textbfv$ of $textbfM$.
Experiments show that our efficiently computed graph metric matrices outperform metrics learned using competing methods in terms of classification tasks.
arXiv Detail & Related papers (2020-01-28T17:44:01Z) - Complex Hadamard Diagonalisable Graphs [0.0]
We show that a large class of complex Hadamard diagonalisable graphs have sets forming an equitable partition.
We provide examples and constructions of complex Hadamard diagonalisable graphs.
We discuss necessary and sufficient conditions for $(alpha, beta)$--Laplacian fractional revival and perfect state transfer.
arXiv Detail & Related papers (2020-01-01T17:49:25Z)
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.