Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Hybrid Quantum Systems: Complementarity of Quantum Privacy and Error-Correction, and Higher Rank Matricial Ranges

Mike I. Nelson

Published Apr 1, 2021• 0 citations
OpenAlex

Abstract

We establish operator structure identities for quantum channels and their error-correcting and private codes, emphasizing the complementarity relationship between the two perspectives. Relevant structures include correctable and private operator algebras, and operator spaces such as multiplicative domains and nullspaces of quantum channels and their complementary maps. For the case of privatizing to quantum states, we also derive dimension inequalities on the associated operator algebras that further quantify the trade-off between correction and privacy.

Related papers

Quantum complementarity and operator structures

David W. Kribs, Jeremy Livick, Mike I. Nelson +2 more

We establish operator structure identities for quantum channels and their error-correcting and private codes, emphasizing the complementarity relationship between the two perspectives. Relevant structures include correctable and private operator algebras, and operator spaces such as multiplicative domains and nullspaces of quantum channels and their complementary maps. For the case of privatizing to quantum states, we also derive dimension inequalities on the associated operator algebras that further quantify the trade-off between correction and privacy.

arXiv:1811.10425•Quantum Information and Computation•Feb 1, 2019•5 citations

Higher rank matricial ranges and hybrid quantum error correction

Ningping Cao, David W. Kribs, Chi-Kwong Li +3 more

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.

Linear and Multilinear Algebra•Apr 7, 2020•6 citations

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

Tomas Jochym-O’Connor, David W. Kribs, Raymond Laflamme +1 more

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 analog 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 a private quantum subsystem.

arXiv:1405.1798•Physical Review A•Sep 3, 2014•11 citations

Higher Rank Matricial Ranges and Hybrid Quantum Error Correction

David W. Kribs, Ningping Cao, Chi-Kwong Li +3 more

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.

arXiv:1911.12744•Nov 28, 2019•0 citations

Private algebras in quantum information and infinite-dimensional complementarity

Jason Crann, David W. Kribs, Rupert H. Levene +1 more

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.

arXiv:1510.06672•Journal of Mathematical Physics•Nov 16, 2015•22 citations

Protected Subspaces in Quantum Information

Krzysztof Majgier, Hans Maassen, Karol Życzkowski

In certain situations the state of a quantum system, after transmission through a quantum channel, can be perfectly restored. This can be done by 'coding' the state space of the system before transmission into a 'protected' part of a larger state space, and by applying a proper 'decoding' map afterwards. We investigate two kinds of protected subspaces: the error correction subspaces and the dark subspaces. In neither case information leaks out of the system, but in the second it is more difficult to restore the state. Recent results on higher rank numerical ranges of operators are used to construct examples. In particular, dark spaces are constructed for any map of rank 2, for a biased permutations channel and for certain separable maps acting on multipartite systems. Furthermore, error correction subspaces are provided for a class of three unitary noise models.

arXiv:0902.4126•Feb 24, 2009•2 citations
We establish operator structure identities for quantum channels and their error-correcting and private codes, emphasizing the complementarity relationship between the two perspectives. Relevant structures include correctable and private operator algebras, and operator spaces such as multiplicative domains and nullspaces of quantum channels and their complementary maps. For the case of privatizing to quantum states, we also derive dimension inequalities on the associated operator algebras that further quantify the trade-off between correction and privacy.
We establish operator structure identities for quantum channels and their error-correcting and private codes, emphasizing the complementarity relationship between the two perspectives. Relevant structures include correctable and private operator algebras, and operator spaces such as multiplicative domains and nullspaces of quantum channels and their complementary maps. For the case of privatizing to quantum states, we also derive dimension inequalities on the associated operator algebras that further quantify the trade-off between correction and privacy.
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.
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 analog 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 a private quantum subsystem.
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.
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.
In certain situations the state of a quantum system, after transmission through a quantum channel, can be perfectly restored. This can be done by 'coding' the state space of the system before transmission into a 'protected' part of a larger state space, and by applying a proper 'decoding' map afterwards. We investigate two kinds of protected subspaces: the error correction subspaces and the dark subspaces. In neither case information leaks out of the system, but in the second it is more difficult to restore the state. Recent results on higher rank numerical ranges of operators are used to construct examples. In particular, dark spaces are constructed for any map of rank 2, for a biased permutations channel and for certain separable maps acting on multipartite systems. Furthermore, error correction subspaces are provided for a class of three unitary noise models.