Examples for the Quantum Kippenhahn Theorem
Ben Lawrence

TL;DR
This paper introduces a new family of counterexamples to Kippenhahn's Conjecture and uses them to construct explicit examples supporting the Quantum Kippenhahn Theorem, advancing understanding in matrix theory and spectrahedra.
Contribution
It provides the first concrete counterexamples to Kippenhahn's Conjecture and applies these to explicitly demonstrate the Quantum Kippenhahn Theorem.
Findings
Constructed a novel family of counterexamples to Kippenhahn's Conjecture.
Used these counterexamples to explicitly realize the Quantum Kippenhahn Theorem.
Enhanced understanding of eigenvalue behavior in dimension-free linear pencils.
Abstract
Semidefinite programming optimises a linear objective function over a spectrahedron, and is one of the major advances of mathematical optimisation. Spectrahedra are described by linear pencils, which are linear matrix polynomials with hermitian matrix coefficients. Our focus will be on dimension-free linear pencils where the variables are permitted to be hermitian matrices. A major question on linear pencils, and matrix theory in general, is Kippenhahn's Conjecture. The conjecture states that given a linear pencil if the hermitian matrices and generate the full matrix algebra, then the pencil must have at least one simple eigenvalue for some and . The conjecture is known to be false, via a single counterexample due to Laffey. A dimension-free version of the conjecture, known as the Quantum Kippenhahn Theorem, has recently been proven true non-constructively. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Matrix Theory and Algorithms · Polynomial and algebraic computation
