Sarah Plosker

Classical and nonclassical randomness in quantum measurements

The space POVM H(X) of positive operator-valued probability measures on the Borel sets of a compact (or even locally compact) Hausdorff space X with values in B(H), the algebra of linear operators acting on a d-dimensional Hilbert space H, is studied from the perspectives of classical and nonclassical convexity through a transform Γ that associates any positive operator-valued measure ν with a certain completely positive linear map Γ(ν) of the homogeneous C*-algebra C(X)⊗B(H) into B(H). This association is achieved by using an operator-valued integral in which nonclassical random variables (that is, operator-valued functions) are integrated with respect to positive operator-valued measures and which has the feature that the integral of a random quantum effect is itself a quantum effect. A left inverse Ω for Γ yields an integral representation, along the lines of the classical Riesz representation theorem for linear functionals on C(X), of certain (but not all) unital completely positive linear maps φ:C(X)...

Extending a characterization of majorization to infinite dimensions

Abstract We consider recent work linking majorization and trumping, two partial orders that have proven useful with respect to the entanglement transformation problem in quantum information, with general Dirichlet polynomials, Mellin transforms, and completely monotone sequences. We extend a basic majorization result to the more physically realistic infinite-dimensional setting through the use of generalized Dirichlet series and Riemann–Stieltjes integrals.

Quantum subsystems: Exploring the complementarity of quantum privacy and error correction

This paper addresses and expands on the contents of the recent Letter [Phys. Rev. Lett. 111, 030502 (2013)] discussing private quantum subsystems. Here we prove several previously presented results, including a condition for a given random unitary channel to not have a private subspace (although this does not mean that private communication cannot occur, as was previously demonstrated via private subsystems) and algebraic conditions that characterize when a general quantum subsystem or subspace code is private for a quantum channel. These conditions can be regarded as the private analogue of the Knill-Laflamme conditions for quantum error correction, and we explore how the conditions simplify in some special cases. The bridge between quantum cryptography and quantum error correction provided by complementary quantum channels motivates the study of a new, more general definition of quantum error correcting code, and we initiate this study here. We also consider the concept of complementarity for the general notion of private quantum subsystem.

Private quantum subsystems.

We investigate the most general notion of a private quantum code, which involves the encoding of qubits into quantum subsystems and subspaces. We contribute to the structure theory for private quantum codes by deriving testable conditions for private quantum subsystems in terms of Kraus operators for channels, establishing an analogue of the Knill-Laflamme conditions in this setting. For a large class of naturally arising quantum channels, we show that private subsystems can exist even in the absence of private subspaces. In doing so, we also discover the first examples of private subsystems that are not complemented by operator quantum error correcting codes, implying that the complementarity of private codes and quantum error correcting codes fails for the general notion of private quantum subsystems.

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

Perfect quantum state transfer using Hadamard-diagonalizable graphs

\ell_1

Dirichlet polynomials, majorization, and trumping

measure of coherence of a pure state is never smaller than its relative entropy of coherence.

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

Abstract 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.

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

Majorization and trumping are two partial orders which have proved useful in quantum information theory. We show some relations between these two partial orders and generalized Dirichlet polynomials, Mellin transforms, and completely monotone functions. These relations are used to prove a succinct generalization of Turgut’s characterization of trumping.

Trumping and Power Majorization

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.