arXiv subjects

David W. Kribs

Publications and source records attributed to David W. Kribs.

At least 37 records · Page 2Linked to original sources

arXiv2019

Higher Rank Matricial Ranges and Hybrid Quantum Error Correction

We introduce and initiate the study of a family of higher rank matricial ranges, taking motivation from hybrid classical and quantum error correction coding theory and its operator algebra framework. In particular, for a noisy quantum channel, a hybrid quantum error correcting code exists if and only if a distinguished special case of the joint higher rank matricial range of the error operators of the channel is non-empty. We establish bounds on Hilbert space dimension in terms of properties of a tuple of operators that guarantee a matricial range is non-empty, and hence additionally guarantee the existence of hybrid codes for a given quantum channel. We also discuss when hybrid codes can have advantages over quantum codes and present a number of examples.

quant-ph↗

arXiv2019

Approximate Quasiorthogonality of Operator Algebras and Relative Quantum Privacy

We show that the approximate quasiorthogonality of two operator algebras is equivalent to the algebras being approximately private relative to their conditional expectation quantum channels. Our analysis is based on a characterization of the measure of orthogonality in terms of Choi matrices and Kraus operators for completely positive maps. We present examples drawn from different areas of quantum information.

quant-ph↗

arXiv2017

Quantum Privacy and Schur Product Channels

We investigate the quantum privacy properties of an important class of quantum chan-nels, by making use of a connection with Schur product matrix operations and associated correlationmatrix structures. For channels implemented by mutually commuting unitaries, which cannot priva-tise qubits encoded directly into subspaces, we nevertheless identify private algebras and subsystemsthat can be privatised by the channels. We also obtain further results by combining our analysiswith tools from the theory of quasiorthogonal operator algebras and graph theory.

math-ph↗

arXiv2016

Commutants of weighted shift directed graph operator algebras

We consider non-selfadjoint operator algebras $\mathfrak{L}(G,λ)$ generated by weighted creation operators on the Fock-Hilbert spaces of countable directed graphs $G$. These algebras may be viewed as noncommutative generalizations of weighted Bergman space algebras, or as weighted versions of the free semigroupoid algebras of directed graphs. A complete description of the commutant is obtained together with broad conditions that ensure the double commutant property. It is also shown that the double commutant property may fail for $\mathfrak{L}(G,λ)$ in the case of the single vertex graph with two edges and a suitable choice of left weight function $λ$.

math.OA↗

arXiv2015

Private algebras in quantum information and infinite-dimensional complementarity

We introduce a generalized framework for private quantum codes using von Neumann algebras and the structure of commutants. This leads naturally to a more general notion of complementary channel, which we use to establish a generalized complementarity theorem between private and correctable subalgebras that applies to both the finite and infinite-dimensional settings. Linear bosonic channels are considered and specific examples of Gaussian quantum channels are given to illustrate the new framework together with the complementarity theorem.

quant-ph↗

arXiv2015

Trumping and Power Majorization

Majorization is a basic concept in matrix theory that has found applications in numerous settings over the past century. Power majorization is a more specialized notion that has been studied in the theory of inequalities. On the other hand, the trumping relation has recently been considered in quantum information, specifically in entanglement theory. We explore the connections between trumping and power majorization. We prove an analogue of Rado's theorem for power majorization and consider a number of examples.

math.FA↗

arXiv2014

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.

quant-ph↗

arXiv2013

Duality of Entanglement Norms

We consider four norms on tensor product spaces that have appeared in quantum information theory and demonstrate duality relationships between them. We show that the product numerical radius is dual to the robustness of entanglement, and we similarly show that the S(k)-norm is dual to the projective tensor norm. We show that, analogous to how the product numerical radius and the S(k)-norm characterize k-block positivity of operators, there is a natural version of the projective tensor norm that characterizes Schmidt number. In this way we obtain an elementary new proof of the cross norm criterion for separability, and we also generalize both the cross norm and realignment criteria to the case of arbitrary Schmidt number.

quant-ph↗

arXiv2013

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

quant-ph↗

arXiv2012

Private Quantum Channels, Conditional Expectations, and Trace Vectors

Private quantum channels are the quantum analogue of the classical one-time pad. Conditional expectations and trace vectors are notions that have been part of operator algebra theory for several decades. We show that the theory of conditional expectations and trace vectors is intimately related to that of private quantum channels. Specifically we give a new geometric characterization of single qubit private quantum channels that relies on trace vectors. We further show that trace vectors completely describe the private states for quantum channels that are themselves conditional expectations. We also discuss several examples.

math.OA↗

arXiv2012

Rank Reduction for the Local Consistency Problem

We address the problem of how simple a solution can be for a given quantum local consistency instance. More specifically, we investigate how small the rank of the global density operator can be if the local constraints are known to be compatible. We prove that any compatible local density operators can be satisfied by a low rank global density operator. Then we study both fermionic and bosonic versions of the N-representability problem as applications. After applying the channel-state duality, we prove that any compatible local channels can be obtained through a global quantum channel with small Kraus rank.

quant-ph↗

arXiv2011

Quantum Gate Fidelity in Terms of Choi Matrices

We provide new results for computing and comparing the quantum gate fidelity of quantum channels via their Choi matrices. We extend recent work that showed there exist non-dual pairs of quantum channels with equal gate fidelity by providing an explicit characterization of all such channels. We use our characterization to show that when the dimension is 2 (or 3, under slightly stronger hypotheses), the gate fidelity of two channels is equal if and only if their difference equals the difference of some unital map and its dual -- a fact that has been shown to be false when the dimension is 4 or larger. We also present a formula for the minimum gate fidelity of a channel in terms of a well-studied norm on a compression of its Choi matrix. As a consequence, several new ways of bounding and approximating the minimum gate fidelity follow, including a simple semidefinite program to compute it for qubit channels.

quant-ph↗

arXiv2010

Minimal and Maximal Operator Spaces and Operator Systems in Entanglement Theory

We examine k-minimal and k-maximal operator spaces and operator systems, and investigate their relationships with the separability problem in quantum information theory. We show that the matrix norms that define the k-minimal operator spaces are equal to a family of norms that have been studied independently as a tool for detecting k-positive linear maps and bound entanglement. Similarly, we investigate the k-super minimal and k-super maximal operator systems that were recently introduced and show that their cones of positive elements are exactly the cones of k-block positive operators and (unnormalized) states with Schmidt number no greater than k, respectively. We characterize a class of norms on the k-super minimal operator systems and show that the completely bounded versions of these norms provide a criterion for testing the Schmidt number of a quantum state that generalizes the recently-developed separability criterion based on trace-contractive maps.

math.OA↗

arXiv2010

A Family of Norms With Applications In Quantum Information Theory

We consider a family of vector and operator norms defined by the Schmidt decomposition theorem for quantum states. We use these norms to tackle two fundamental problems in quantum information theory: the classification problem for k-positive linear maps and entanglement witnesses, and the existence problem for non-positive partial transpose bound entangled states. We begin with an analysis of the norms, showing that the vector norms can be explicitly calculated, and we derive several inequalities in order to bound the operator norms and compute them in special cases. We then use the norms to establish what appears to be the most general spectral test for k-positivity currently available, showing how it implies several other known tests as well as some new ones. Building on this work, we frame the NPPT bound entangled problem as a concrete problem on a specific limit, specifically that a particular entangled Werner state is bound entangled if and only if a certain norm inequality holds on a given family of projections.

quant-ph↗

arXiv2010

A Family of Norms With Applications In Quantum Information Theory II

We consider the problem of computing the family of operator norms recently introduced in arXiv:0909.3907. We develop a family of semidefinite programs that can be used to exactly compute them in small dimensions and bound them in general. Some theoretical consequences follow from the duality theory of semidefinite programming, including a new constructive proof that there are non-positive partial transpose Werner states that are r-undistillable for arbitrary r. Several examples are considered via a MATLAB implementation of the semidefinite program, including the case of Werner states and randomly generated states via the Bures measure, and approximate distributions of the norms are provided. We extend these norms to arbitrary convex mapping cones and explore their implications with positive partial transpose states.

quant-ph↗

arXiv2010

Generalized Multiplicative Domains and Quantum Error Correction

Given a completely positive map, we introduce a set of algebras that we refer to as its generalized multiplicative domains. These algebras are generalizations of the traditional multiplicative domain of a completely positive map and we derive a characterization of them in the unital, trace-preserving case, in other words the case of unital quantum channels, that extends Choi's characterization of the multiplicative domains of unital maps. We also derive a characterization that is in the same flavour as a well-known characterization of bimodules, and we use these algebras to provide a new representation-theoretic description of quantum error-correcting codes that extends previous results for unitarily-correctable codes, noiseless subsystems and decoherence-free subspaces.

quant-ph↗

arXiv2009

Optical implementation of a unitarily correctable code

Noise poses a challenge for any real-world implementation in quantum information science. The theory of quantum error correction deals with this problem via methods to encode and recover quantum information in a way that is resilient against that noise. Unitarily correctable codes are an error correction technique wherein a single unitary recovery operation is applied without the need for an ancilla Hilbert space. Here, we present the first optical implementation of a non-trivial unitarily correctable code for a noisy quantum channel with no decoherence-free subspaces or noiseless subsystems. We show that recovery of our initial states is achieved with high fidelity (>=0.97), quantitatively proving the efficacy of this unitarily correctable code.

quant-ph↗

arXiv2008

Entropy of a quantum error correction code

We define and investigate a notion of entropy for quantum error correcting codes. The entropy of a code for a given quantum channel has a number of equivalent realisations, such as through the coefficients associated with the Knill-Laflamme conditions and the entropy exchange computed with respect to any initial state supported on the code. In general the entropy of a code can be viewed as a measure of how close it is to the minimal entropy case, which is given by unitarily correctable codes (including decoherence-free subspaces), or the maximal entropy case, which from dynamical Choi matrix considerations corresponds to non-degenerate codes. We consider several examples, including a detailed analysis in the case of binary unitary channels, and we discuss an extension of the entropy to operator quantum error correcting subsystem codes.

quant-ph↗