1 October 2017 in Linear Algebra and its Applications
3 October 2023 in Journal of Algebraic Combinatorics
2 March 2020 in Linear and Multilinear Algebra
We consider the convex set of stochastic matrices and the convex set of centrosymmetric stochastic matrices (stochastic matrices that are symmetric under rotation by 180 ). For , we demonstrate a Birkhoff theorem for its extreme points and create a basis from certain -matrices. For , we characterize its extreme points and create bases, whose construction depends on the parity of m, using our basis construction for stochastic matrices. For each of and , we further characterize their extreme points in terms of their associated bipartite graphs, we discuss a graph parameter called the fill and compute it for the various basis elements, and we examine the number of vertices of the faces of these sets. We provide examples illustrating the results throughout.
1 December 2015 in Linear Algebra and its Applications
15 February 2018 in Linear and Multilinear Algebra
A simple method for transmitting quantum states within a quantum computer is via a quantum spin chain – that is, a path on n vertices. Unweighted paths are of limited use, and so a natural generalization is to consider weighted paths; this has been further generalized to allow for loops (potentials in the physics literature). We study the particularly important situation of perfect state transfer with respect to the corresponding adjacency matrix or Laplacian through the use of orthogonal polynomials. Low-dimensional examples are given in detail. Our main result is that PST with respect to the Laplacian matrix cannot occur for weighted paths on vertices nor can it occur for certain symmetric weighted trees. The methods used lead us to a conjecture directly linking the rationality of the weights of weighted paths on vertices, with or without loops, with the capacity for PST between the end vertices with respect to the adjacency matrix.
1 November 2018 in Journal of Mathematical Physics
We consider the tensor product of the completely depolarising channel on d × d matrices with the map of Schur multiplication by a k × k correlation matrix and characterise, via matrix theory methods, when such a map is a mixed (random) unitary channel. When d = 1, this recovers a result of O’Meara and Pereira and for larger d, is equivalent to a result of Haagerup and Musat that was originally obtained via the theory of factorisation through von Neumann algebras. We obtain a bound on the distance between a given correlation matrix for which this tensor product is nearly mixed unitary and a correlation matrix for which such a map is exactly mixed unitary. This bound allows us to give an elementary proof of another result of Haagerup and Musat about the closure of such correlation matrices without appealing to the theory of von Neumann algebras.