Searcharxiv⌕ Search

arXiv subjects

Sarah Plosker

Publications and source records attributed to Sarah Plosker.

At least 37 records · Page 2Linked to original sources

Universality of Weyl Unitaries

Weyl's unitary matrices, which were introduced in Weyl's 1927 paper on group theory and quantum mechanics, are $p\times p$ unitary matrices given by the diagonal matrix whose entries are the $p$-th roots of unity and the cyclic shift matrix. Weyl's unitaries, which we denote by $\mathfrak u$ and $\mathfrak v$, satisfy $\mathfrak u^p=\mathfrak v^p=1_p$ (the $p\times p$ identity matrix) and the commutation relation $\mathfrak u\mathfrak v=ζ\mathfrak v\mathfrak u$, where $ζ$ is a primitive $p$-th root of unity. We prove that Weyl's unitary matrices are universal in the following sense: if $u$ and $v$ are any $d\times d$ unitary matrices such that $u^p= v^p=1_d$ and $ u v=ζvu$, then there exists a unital completely positive linear map $ϕ:\mathcal M_p(\mathbb C)\rightarrow\mathcal M_d(\mathbb C)$ such that $ϕ(\mathfrak u)= u$ and $ϕ(\mathfrak v)=v$. We also show, moreover, that any two pairs of $p$-th order unitary matrices that satisfy the Weyl commutation relation are completely order equivalent. When $p=2$, the Weyl matrices are two of the three Pauli matrices from quantum mechanics. It was recently shown that $g$-tuples of Pauli-Weyl-Brauer unitaries are universal for all $g$-tuples of anticommuting selfadjoint unitary matrices; however, we show here that the analogous result fails for positive integers $p>2$. Finally, we show that the Weyl matrices are extremal in their matrix range, using recent ideas from noncommutative convexity theory.

math.OA↗

Achievable multiplicity partitions in the inverse eigenvalue problem of a graph

Associated to a graph $G$ is a set $\mathcal{S}(G)$ of all real-valued symmetric matrices whose off-diagonal entries are nonzero precisely when the corresponding vertices of the graph are adjacent, and the diagonal entries are free to be chosen. If $G$ has $n$ vertices, then the multiplicities of the eigenvalues of any matrix in $\mathcal{S}(G)$ partition $n$; this is called a multiplicity partition. We study graphs for which a multiplicity partition with only two integers is possible. The graphs $G$ for which there is a matrix in $\mathcal{S}(G)$ with partitions $[n-2,2]$ have been characterized. We find families of graphs $G$ for which there is a matrix in $\mathcal{S}(G)$ with multiplicity partition $[n-k,k]$ for $k\geq 2$. We focus on generalizations of the complete multipartite graphs. We provide some methods to construct families of graphs with given multiplicity partitions starting from smaller such graphs. We also give constructions for graphs with matrix in $\mathcal{S}(G)$ with multiplicity partition $[n-k,k]$ to show the complexities of characterizing these graphs.

math.SP↗

Complete Order Equivalence of Spin Unitaries

This paper is a study of linear spaces of matrices and linear maps on matrix algebras that arise from \emph{spin systems}, or \emph{spin unitaries}, which are finite sets $\mathcal S$ of selfadjoint unitary matrices such that any two unitaries in $\mathcal S$ anticommute. We are especially interested in linear isomorphisms between these linear spaces of matrices such that the matricial order within these spaces is preserved; such isomorphisms are called complete order isomorphisms, which might be viewed as weaker notion of unitary similarity. The main result of this paper shows that all $m$-tuples of anticommuting selfadjoint unitary matrices are equivalent in this sense, meaning that there exists a unital complete order isomorphism between the unital linear subspaces that these tuples generate. We also show that the C$^*$-envelope of any operator system generated by a spin system of cardinality $2k$ or $2k+1$ is the simple matrix algebra $\mathcal M_{2^k}(\mathbb C)$. As an application of the main result, we show that the free spectrahedra determined by spin unitaries depend only upon the number of the unitaries, not upon the particular choice of unitaries, and we give a new, direct proof of the fact [Helton-Klep-McCullough-Schweighofer, "Dilations, linear matrix inequalities, the matrix cube problem and beta distributions", Mem. Amer. Math. Soc. 257(2019)] that the spin ball $\mathfrak B_m^{\rm spin}$ and max ball $\mathfrak B_m^{\rm max}$ coincide as matrix convex sets in the cases $m=1,2$. We also derive analogous results for countable spin systems and their C$^*$-envelopes.

math.OA↗

Complex Hadamard Diagonalisable Graphs

In light of recent interest in Hadamard diagonalisable graphs (graphs whose Laplacian matrix is diagonalisable by a Hadamard matrix), we generalise this notion from real to complex Hadamard matrices. We give some basic properties and methods of constructing such graphs. We show that a large class of complex Hadamard diagonalisable graphs have vertex sets forming an equitable partition, and that the Laplacian eigenvalues must be even integers. We provide a number of examples and constructions of complex Hadamard diagonalisable graphs, including two special classes of graphs: the Cayley graphs over $\mathbb{Z}_r^d$, and the non--complete extended $p$--sum (NEPS). We discuss necessary and sufficient conditions for $(α, β)$--Laplacian fractional revival and perfect state transfer on continuous--time quantum walks described by complex Hadamard diagonalisable graphs and provide examples of such quantum state transfer.

math.CO↗

On Operator Valued Measures

We consider positive operator valued measures whose image is the bounded operators acting on an infinite-dimensional Hilbert space, and we relax, when possible, the usual assumption of positivity of the operator valued measure seen in the quantum information theory literature. We define the Radon-Nikodym derivative of a positive operator valued measure with respect to a complex measure induced by a given quantum state; this derivative does not always exist when the Hilbert space is infinite dimensional in so much as its range may include unbounded operators. We define integrability of a positive quantum random variable with respect to a positive operator valued measure. Emphasis is put on the structure of operator valued measures, and we develop positive operator valued versions of the Lebesque decomposition theorem and Johnson's atomic and nonatomic decomposition theorem. Beyond these generalizations, we make connections between absolute continuity and the "cleanness" relation defined on positive operator valued measures as well as to the notion of atomic and nonatomic measures.

math.FA↗

Centrosymmetric Stochastic Matrices

We consider the convex set $Γ_{m,n}$ of $m\times n$ stochastic matrices and the convex set $Γ_{m,n}^π\subset Γ_{m,n}$ of $m\times n$ centrosymmetric stochastic matrices (stochastic matrices that are symmetric under rotation by 180 degrees). 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.

math.CO↗

Quantum Majorization on Semifinite von Neumann Algebras

We extend Gour et al's characterization of quantum majorization via conditional min-entropy to the context of semifinite von Neumann algebras. Our method relies on a connection between conditional min-entropy and operator space projective tensor norm for injective von Neumann algebras. This approach also connects the tracial Hahn-Banach theorem of Helton, Klep and McCullough to noncommutative vector-valued $L_1$-space.

math.OA↗

Switching and partially switching the hypercube while maintaining perfect state transfer

A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with respect to inter-qubit interactions of a quantum system. We perform various perturbations to the hypercube graph---a graph that is known to exhibit PST---to create graphs that maintain many of the same properties of the hypercube, including PST as well as the distance for which PST occurs. We show that the sensitivity with respect to readout time errors remains unaffected for the vertices involved in PST. We give motivation for when these perturbations may be physically desirable or even necessary.

math.CO↗

A simplified and unified generalization of some majorization results

We consider positive, integral-preserving linear operators acting on $L^1$ space, known as stochastic operators or Markov operators. We show that, on finite-dimensional spaces, any stochastic operator can be approximated by a sequence of stochastic integral operators (such operators arise naturally when considering matrix majorization in $L^1$). We collect a number of results for vector-valued functions on $L^1$, simplifying some proofs found in the literature. In particular, matrix majorization and multivariate majorization are related in $\mathbb{R}^n$. In $\mathbb{R}$, these are also equivalent to convex function inequalities.

math.FA↗

Perfect quantum state transfer in weighted paths with potentials (loops) using orthogonal polynomials

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 (\emph{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\geq 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.

quant-ph↗

Approximately Clean Quantum Probability Measures

A quantum probability measure--or quantum measurement--is said to be clean if it cannot be irreversibly connected to any other quantum probability measure via a quantum channel. The notion of a clean quantum measure was introduced by Buscemi et al (2005) for finite-dimensional Hilbert space, and was studied subsequently by Kahn (2007) and Pellonpää (2011). The present paper provides new descriptions of clean quantum probability measures in the case of finite-dimensional Hilbert space. For Hilbert spaces of infinite dimension, we introduce the notion of `approximately clean quantum probability measures' and characterise this property for measures whose range determines a finite-dimensional operator system.

quant-ph↗

Schur multipliers and mixed unitary maps

We consider the tensor product of the completely depolarising channel on $d\times d$ matrices with the map of Schur multiplication by a $k \times 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.

quant-ph↗

An operator-valued Lyapunov theorem

We generalize Lyapunov's convexity theorem for classical (scalar-valued) measures to quantum (operator-valued) measures. In particular, we show that the range of a nonatomic quantum probability measure is a weak*-closed convex set of quantum effects (positive operators bounded above by the identity operator) under a sufficient condition on the non-injectivity of integration. To prove the operator-valued version of Lyapunov's theorem, we must first define the notions of essentially bounded, essential support, and essential range for quantum random variables (Borel measurable functions from a set to the bounded linear operators acting on a Hilbert space).

math.FA↗

Some notes on the robustness of k-coherence and k-entanglement

We show that two related measures of k-coherence, called the standard and generalized robustness of k-coherence, are equal to each other when restricted to pure states. As a direct application of the result, we establish an equivalence between two analogous measures of Schmidt rank k-entanglement for all pure states. This answers conjectures raised in the literature regarding the evaluation of the quantifiers, and facilitates an efficient quantification of pure-state resources by introducing computable closed-form expressions for the two measures.

quant-ph↗

The modified trace distance of coherence is constant on most pure states

Recently, the much-used trace distance of coherence was shown to not be a proper measure of coherence, so a modification of it was proposed. We derive an explicit formula for this modified trace distance of coherence on pure states. Our formula shows that, despite satisfying the axioms of proper coherence measures, it is likely not a good measure to use, since it is maximal (equal to 1) on all except for an exponentially-small (in the dimension of the space) fraction of pure states.

quant-ph↗

Perfect quantum state transfer using Hadamard diagonalizable graphs

Quantum state transfer within a quantum computer can be achieved by using a network of qubits, and such a network can be modelled mathematically by a graph. Here, we focus on the corresponding Laplacian matrix, and those graphs for which the Laplacian can be diagonalized by a Hadamard matrix. We give a simple eigenvalue characterization for when such a graph has perfect state transfer at time $π/2$; this characterization allows one to choose the correct eigenvalues to build graphs having perfect state transfer. We characterize the graphs that are diagonalizable by the standard Hadamard matrix, showing a direct relationship to cubelike graphs. We then give a number of constructions producing a wide variety of new graphs that exhibit perfect state transfer, and we consider several corollaries in the settings of both weighted and unweighted graphs, as well as how our results relate to the notion of pretty good state transfer. Finally, we give an optimality result, showing that among regular graphs of degree at most $4$, the hypercube is the sparsest Hadamard diagonalizable connected unweighted graph with perfect state transfer.

quant-ph↗

Quantifying the coherence of pure quantum states

In recent years, several measures have been proposed for characterizing the coherence of a given quantum state. We derive several results that illuminate how these measures behave when restricted to pure states. Notably, we present an explicit characterization of the closest incoherent state to a given pure state under the trace distance measure of coherence. We then use this result to show that the states maximizing the trace distance of coherence are exactly the maximally coherent states. We define the trace distance of entanglement and show that it coincides with the trace distance of coherence for pure states. Finally, we give an alternate proof to a recent result that the $\ell_1$ measure of coherence of a pure state is never smaller than its relative entropy of coherence.

quant-ph↗

Bounds on probability of state transfer with respect to readout time and edge weight

We analyse the sensitivity of a spin chain modelled by an undirected weighted connected graph exhibiting perfect state transfer to small perturbations in readout time and edge weight in order to obtain physically relevant bounds on the probability of state transfer. At the heart of our analysis is the concept of the numerical range of a matrix; our analysis of edge weight errors additionally makes use of the spectral and Frobenius norms.

quant-ph↗