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

arXiv:1510.00939 · Journal of Physics A Mathematical and Theoretical

Private quantum subsystems and quasiorthogonal operator algebras

Jeremy Levick, Tomas Jochym-O’Connor, David W. Kribs, Raymond Laflamme, Rajesh Pereira

Published Feb 9, 2016• 5 citations
arXivHTMLPDF

Abstract

Abstract We generalize a recently discovered example of a private quantum subsystem to find private subsystems for Abelian subgroups of the n -qubit Pauli group, which exist in the absence of private subspaces. In doing so, we also connect these quantum privacy investigations with the theory of quasiorthogonal operator algebras through the use of tools from group theory and operator theory.

DOI
10.1088/1751-8113/49/12/125302

Related papers

Private Quantum Subsystems

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

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.

arXiv:1208.2246•Physical Review Letters•Jul 15, 2013•13 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

Complementarity of private and correctable subsystems in quantum cryptography and error correction

Dennis Kretschmann, David W. Kribs, Robert W. Spekkens

We make an explicit connection between fundamental notions in quantum cryptography and quantum error correction. Error-correcting subsystems (and subspaces) for quantum channels are the key vehicles for contending with noise in physical implementations of quantum information processing. Private subsystems (and subspaces) for quantum channels play a central role in cryptographic schemes such as quantum secret sharing and private quantum communication. We show that a subsystem is private for a channel precisely when it is correctable for a complementary channel. This result is shown to hold even for approximate notions of private and correctable defined in terms of the diamond norm for superoperators.

arXiv:0711.3438•Physical Review A•Sep 24, 2008•35 citations

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

The Hidden Subgroup Problem and Eigenvalue Estimation on a Quantum Computer

Michele Mosca, ARTUR K. EKERT

A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to phrase the first four problems as the estimation of eigenvalues of certain unitary operators. Here we show how the solution to the more general Abelian `hidden subgroup problem' can also be described and analysed as such. We then point out how certain instances of these problems can be solved with only one control qubit, or `flying qubits', instead of entire registers of control qubits.

arXiv:quant-ph/9903071•Mar 20, 1999•33 citations

Quasiorthogonality of commutative algebras, complex Hadamard matrices, and mutually unbiased measurements

Sooyeong Kim, David W. Kribs, Edison Lozano +2 more

We deepen the theory of quasiorthogonal and approximately quasiorthogonal operator algebras through an analysis of the commutative algebra case. We give a new approach to calculate the measure of orthogonality between two such subalgebras of matrices, based on a matrix-theoretic notion we introduce that has a connection to complex Hadamard matrices. We also show how this new tool can yield significant information on the general non-commutative case. We finish by considering quasiorthogonality for the important subclass of commutative algebras that arise from mutually unbiased bases (MUBs) and mutually unbiased measurements (MUMs) in quantum information theory. We present a number of examples throughout the work, including a subclass that arises from group algebras and Latin squares.

arXiv:2504.18741•Linear Algebra and its Applications•Sep 16, 2025•0 citations
Abstract We generalize a recently discovered example of a private quantum subsystem to find private subsystems for Abelian subgroups of the n -qubit Pauli group, which exist in the absence of private subspaces. In doing so, we also connect these quantum privacy investigations with the theory of quasiorthogonal operator algebras through the use of tools from group theory and operator theory.
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.
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 make an explicit connection between fundamental notions in quantum cryptography and quantum error correction. Error-correcting subsystems (and subspaces) for quantum channels are the key vehicles for contending with noise in physical implementations of quantum information processing. Private subsystems (and subspaces) for quantum channels play a central role in cryptographic schemes such as quantum secret sharing and private quantum communication. We show that a subsystem is private for a channel precisely when it is correctable for a complementary channel. This result is shown to hold even for approximate notions of private and correctable defined in terms of the diamond norm for superoperators.
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.
A quantum computer can efficiently find the order of an element in a group, factors of composite integers, discrete logarithms, stabilisers in Abelian groups, and `hidden' or `unknown' subgroups of Abelian groups. It is already known how to phrase the first four problems as the estimation of eigenvalues of certain unitary operators. Here we show how the solution to the more general Abelian `hidden subgroup problem' can also be described and analysed as such. We then point out how certain instances of these problems can be solved with only one control qubit, or `flying qubits', instead of entire registers of control qubits.
We deepen the theory of quasiorthogonal and approximately quasiorthogonal operator algebras through an analysis of the commutative algebra case. We give a new approach to calculate the measure of orthogonality between two such subalgebras of matrices, based on a matrix-theoretic notion we introduce that has a connection to complex Hadamard matrices. We also show how this new tool can yield significant information on the general non-commutative case. We finish by considering quasiorthogonality for the important subclass of commutative algebras that arise from mutually unbiased bases (MUBs) and mutually unbiased measurements (MUMs) in quantum information theory. We present a number of examples throughout the work, including a subclass that arises from group algebras and Latin squares.