Towards a resolution of the spin alignment problem
Mohammad A. Alhejji, Emanuel Knill

TL;DR
This paper investigates a class of optimization problems related to minimizing entropy in quantum state mixtures, generalizing the spin alignment conjecture and exploring conditions for maximal alignment using majorization theory.
Contribution
It generalizes the spin alignment conjecture to broader functions and settings, providing proofs for Schatten norms and classical states, and introduces a dual formulation.
Findings
Proved the conjecture for Schatten norms of integer order.
Established conditions for maximal alignment in specific cases.
Extended the problem to unitarily invariant convex functions and dual formulations.
Abstract
Consider minimizing the entropy of a mixture of states by choosing each state subject to constraints. If the spectrum of each state is fixed, we expect that in order to reduce the entropy of the mixture, we should make the states less distinguishable in some sense. Here, we study a class of optimization problems that are inspired by this situation and shed light on the relevant notions of distinguishability. The motivation for our study is the recently introduced spin alignment conjecture. In the original version of the underlying problem, each state in the mixture is constrained to be a freely chosen state on a subset of qubits tensored with a fixed state on each of the qubits in the complement. According to the conjecture, the entropy of the mixture is minimized by choosing the freely chosen state in each term to be a tensor product of projectors onto a fixed maximal…
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
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Quantum Information and Cryptography
