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

Linear and Multilinear Algebra

Research problems on numerical ranges in quantum computing

David W. Kribs, Aron Pasieka, Martin Laforest, Colm A. Ryan, Marcus Palmer Da Silva

Published Jun 22, 2009• 28 citations
Publisher

Abstract

We describe some instances in quantum information processing where numerical range techniques arise. We focus on two basic settings: higher-rank numerical ranges and their relevance in theoretical quantum error correction, and the classical numerical range and its use for comparing quantum information processing operations. We present the basic theory, discuss examples and formulate open problems.

DOI
10.1080/03081080802677441

Related papers

Quantum Error Correction and Higher-Rank Numerical Range

Choi, M D, David W. Kribs, Karol Życzkowski

We solve the fundamental quantum error correction problem for bi-unitary channels on two-qubit Hilbert space. We construct qubit codes for such channels on arbitrary dimension Hilbert space, and identify correctable codes for Pauli-error models not detected by the stabilizer formalism. This is accomplished through an application of a new tool for error correction in quantum computing called the ``higher-rank numerical range''. We describe its basic properties and discuss possible further applications.

•Nov 10, 2005•1 citation

An elementary constructive approach to the higher-rank numerical ranges of unitary matrices and quantum error-correcting codes

Alexander Ya. Kazakov

One of the main ingredients of the quantum error-correcting codes theory is the study of the higher-rank numerical ranges of the operators related to the error operators. We constructively verify a conjecture on the structure of higher-rank numerical ranges for unitary matrices.

arXiv:0707.0170•Journal of Physics A Mathematical and Theoretical•May 23, 2008•1 citation

GENERALIZED JOINT HIGHER-RANK NUMERICAL RANGE

Mohammad Ali Mehrjoofard, Hamid Reza Afshin, Sotoodeh Bagheri

The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For a noisy quantum channel, a quantum error correcting code of dimension k exists, if and only if the associated joint rank-k numerical range is non-empty. In this paper, the no- tion of joint rank-k numerical range is generalized, and some state- ments of (2011, Generalized numerical ranges and quantum error correction, J. Operator Theory, 66: 2, 335-351.) are extended.

Journal of Algebraic Systems•Jun 1, 2015•0 citations

MATRIX TECHNIQUES IN QUANTUM INFORMATION SCIENCE

Chi-Kwong Li

Mathematical techniques in quantum information science will be discussed. The focus will be on two specific topics. The first one concerns the study of quantum operations (channels) using the theory of completely positive linear maps. The second one concerns the study of quantum error correction using the theory of generalized numerical ranges. The discussion includes material from some recent research papers.

•Dec 1, 2012•1 citation

Higher-rank numerical ranges of unitary and normal matrices

Man-Duen Choi, John Holbrook, David W. Kribs +1 more

We verify a conjecture on the structure of higher-rank numerical ranges for a wide class of unitary and normal matrices. Using analytic and geometric techniques, we show precisely how the higher-rank numerical ranges for a generic unitary matrix are given by complex polygons determined by the spectral structure of the matrix. We discuss applications of the results to quantum error correction, specifically to the problem of identification and construction of codes for binary unitary noise models.

arXiv:quant-ph/0608244•Operators and Matrices•Jan 1, 2007•47 citations

Private quantum codes: introduction and connection with higher rank numerical ranges

David W. Kribs, Sarah Plosker

We give a brief introduction to private quantum codes, a basic notion in quantum cryptography and key distribution. Private code states are characterized by indistinguishability of their output states under the action of a quantum channel, and we show that higher rank numerical ranges can be used to describe them. We also show how this description arises naturally via conjugate channels and the bridge between quantum error correction and cryptography.

arXiv:1407.1350•Linear and Multilinear Algebra•Jun 3, 2013•1 citation
We describe some instances in quantum information processing where numerical range techniques arise. We focus on two basic settings: higher-rank numerical ranges and their relevance in theoretical quantum error correction, and the classical numerical range and its use for comparing quantum information processing operations. We present the basic theory, discuss examples and formulate open problems.
We solve the fundamental quantum error correction problem for bi-unitary channels on two-qubit Hilbert space. We construct qubit codes for such channels on arbitrary dimension Hilbert space, and identify correctable codes for Pauli-error models not detected by the stabilizer formalism. This is accomplished through an application of a new tool for error correction in quantum computing called the ``higher-rank numerical range''. We describe its basic properties and discuss possible further applications.
The rank-k numerical range has a close connection to the construction of quantum error correction code for a noisy quantum channel. For a noisy quantum channel, a quantum error correcting code of dimension k exists, if and only if the associated joint rank-k numerical range is non-empty. In this paper, the no- tion of joint rank-k numerical range is generalized, and some state- ments of (2011, Generalized numerical ranges and quantum error correction, J. Operator Theory, 66: 2, 335-351.) are extended.