Higher-Rank Numerical Ranges and Compression Problems

David W. Kribs; Karol Zyczkowski; Man-Duen Choi

REVIEW

Higher-Rank Numerical Ranges and Compression Problems

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv math/0511278 v2 pith:TOJWLSO2 submitted 2005-11-10 math.FA math.OAquant-ph

Higher-Rank Numerical Ranges and Compression Problems

Man-Duen Choi , David W. Kribs , Karol Zyczkowski This is my paper

classification math.FA math.OAquant-ph

keywords higher-ranknumericalcompressionconsiderproblemsrangesassociatedbasic

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

read the original abstract

We consider higher-rank versions of the standard numerical range for matrices. A central motivation for this investigation comes from quantum error correction. We develop the basic structure theory for the higher-rank numerical ranges, and give a complete description in the Hermitian case. We also consider associated projection compression problems.

Higher-Rank Numerical Ranges and Compression Problems

discussion (0)