Sarah Plosker

Sarah Plosker

Auto-generated profile, based on publicly available information

Sarah Plosker

Department of Mathematics and Computer Science Brandon University MB R7A 6A9 Brandon Canada

Research Focus & Metrics

Academic Career Length

13Years (2014-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2017 in Linear Algebra and its Applications
Verified
Journal Article
Closed access
NJNathaniel Johnston
Nathaniel Johnston
SKSteve Kirkland
Steve Kirkland
SPSarah Plosker
Sarah Plosker
RSRebecca Storey
Rebecca Storey
XZXiaohong Zhang
Xiaohong Zhang

3 October 2023 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
SKSteve Kirkland
Steve Kirkland
HMHermie Monterde
Hermie Monterde
SPSarah Plosker
Sarah Plosker

2 March 2020 in Linear and Multilinear Algebra
Verified
Journal Article
Closed access
LCLei Cao
Lei Cao
DMDarian McLaren
Darian McLaren
SPSarah Plosker
Sarah Plosker
We consider the convex set Γm,n of m×n stochastic matrices and the convex set Γm,nπ⊂Γm,n of m×n centrosymmetric stochastic matrices (stochastic matrices that are symmetric under rotation by 180 ∘). For Γm,n, we demonstrate a Birkhoff theorem for its extreme points and create a basis from certain (0,1)-matrices. For Γm,nπ, 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 Γm,n and Γm,nπ, 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
Verified
Journal Article
Closed access
JLJin Li
Jin Li
RPRajesh Pereira
Rajesh Pereira
SPSarah Plosker
Sarah Plosker

15 February 2018 in Linear and Multilinear Algebra
Verified
Journal Article
Closed access
SKSteve Kirkland
Steve Kirkland
DMDarian McLaren
Darian McLaren
RPRajesh Pereira
Rajesh Pereira
SPSarah Plosker
Sarah Plosker
XZXiaohong Zhang
Xiaohong Zhang
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 n≥3 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 n>3 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
Verified
Journal Article
Closed access
PDF file
SHSamuel J. Harris
Samuel J. Harris
RLRupert H. Levene
Rupert H. Levene
VPVern I. Paulsen
Vern I. Paulsen
SPSarah Plosker
Sarah Plosker
MRMizanur Rahaman
Mizanur Rahaman
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.