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:2410.18254 · Annales Henri Poincaré

Refining Ky Fan’s Majorization Relation with Linear Programming

Mohammad A. Alhejji

Published Jun 16, 2025• 3 citations
arXivHTMLPDF

Abstract

Abstract A separable version of Ky Fan’s majorization relation is proven for a sum of two operators that are each a tensor product of two positive semi-definite operators. In order to prove it, upper bounds are established on the relevant largest eigenvalue sums in terms of the optimal values of certain linear programs. The objective function of these linear programs is the dual of the direct sum of the spectra of the summands. The feasible sets are bounded polyhedra determined by positive numbers, called alignment terms, that quantify the overlaps between pairs of largest eigenvalue spaces of the summands. By appealing to geometric considerations, tight upper bounds are established on the alignment terms of tensor products of positive semi-definite operators. As an application, the spin alignment conjecture in quantum information theory is affirmatively resolved to the 2-letter level. Consequently, the coherent information of platypus channels is additive to the 2-letter level.

DOI
10.1007/s00023-025-01592-w

Related papers

A majorization relation for a sum of two tensor products of positive semidefinite operators

Mohammad A. Alhejji, Cole Kelson-Packer

We use linear programming to prove a separable version of Ky Fan's majorization relation for a sum of two operators that are each a tensor product of $n$ positive semidefinite operators. We give an example showing that such a relation does not hold in general for sums of three or more tensor products of three or more positive semidefinite operators.

math.RACross-listedarXiv:2607.07913•Jul 10, 2026

Poset-refined majorization relations

Alexander E. Guterman, Michael M. Wolf

Several classical majorization relations for sums or products of matrices involve a majorizing vector of perfectly aligned eigenvalues or singular values. By relaxing the order of alignment to a partial order, we show that the majorization can be strengthened, provided the change-of-basis matrices admit an LU-approximation with respect to this partial order. In this way, we obtain refined versions of Ky Fan's majorization relations, Horn's log-majorization relation, and von Neumann's trace inequality. As an application, we give a short proof of the separable Ky Fan majorization relation for an arbitrary number of tensor factors and extend it to a sum of tensor products of arbitrary matrices. Further applications concern majorization relations for sums of (anti-)symmetric powers and for products of Kronecker sums.

math.FACross-listedarXiv:2607.28061•Jul 31, 2026

Ky Fan majorization for binary tensor products

Michael M. Wolf, Yuanheng Zhou

We provide a short proof of a Ky Fan-type majorization relation for the singular values of a sum of binary tensor products of matrices. This generalizes Alhejji's result (arXiv:2410.18254) from two summands to arbitrary sums and from positive matrices to arbitrary matrices. As an application, we show a majorization relation between the singular values of a completely positive map and those of its Kraus operators.

quant-pharXiv:2607.27116•Jul 30, 2026•0 citations

A counterexample to the strong spin alignment conjecture

Zhiwei Song, Lin Chen

The spin alignment conjecture was originally formulated in connection with the additivity of coherent information for a class of quantum channels known as platypus channels. Recently, a stronger majorization-based version was proposed by M. A. Alhejji and E. Knill [Commun. Math. Phys. 405, 119, 2024], asserting that the spectrum of the alignment operator is always majorized by that of the perfectly aligned configuration. In this letter, we show that this strong spin alignment conjecture is false in general by constructing an explicit counterexample in the smallest unresolved case, namely three qubits. The example uses two-body states that are not jointly compatible with any single three-qubit global state, which naturally leads to a compatibility-constrained variant of the conjecture.

quant-pharXiv:2603.25410•Journal of Mathematical Physics•Mar 27, 2026•1 citation

Approximate majorization and high-order capacity of quantum depolarizing channels

Zhiwei Song, Xin Wang, Marco Tomamichel +1 more

A central challenge in quantum information theory is to determine whether entanglement provides an advantage for information processing when coherent operations across multiple channel uses are allowed. For depolarizing channels, King's proof of the additivity of the minimum output entropy rules out such an advantage for classical communication at leading asymptotic order, while leaving open the possibility of an advantage for higher orders. In this work, we conjecture a majorization relation for the outputs of depolarizing channels and prove an approximate version of this conjecture. Our proof combines an exact ordering of shifted log-determinants with an anti-concentration bound for the spectrum of the product-state output, refining King's analysis based on Schatten norms. As a direct application, we obtain a tight third-order expansion for the classical capacity of quantum depolarizing channels. Consequently, entangled codewords and collective decoding can improve the message size over the product-coding strategy by at most $O(\log \log n)$ bits, sharpening our understanding of the role of entanglement in the finite-blocklength regime.

quant-pharXiv:2609.37240•Sep 30, 2026•1 citation

Compatible-Marginal Spin Alignment for Three Qubits

Haoran Wang

The strong spin-alignment conjecture fails for three qubits when the subset states are chosen independently. We prove that it holds when they are marginals of one global state: for every three-qubit state, every positive semidefinite qubit operator Q, and every nonnegative set of subset weights, the aligned output majorizes the corresponding marginal mixture. The proof classifies the extreme rays of cones on which a fixed set of aligned eigenvalues is largest. This reduces arbitrary weights to two-term sums and the complete one- and two-body layers. For arbitrary numbers of subsystems, we also characterize when one unital quantum channel simultaneously realizes all marginal replacements. This criterion proves alignment for fully PPT states. A separate argument proves alignment for locally rotated stabilizer states in every prime local dimension, at maximally mixed background. These results determine the minimum output Rényi entropies of the associated three-qubit replacement channels. Under either of the two input restrictions above, they also determine the many-use classical capacity and the exact strong-converse exponent for correlated replacement channels of arbitrary size.

•Oct 9, 2026•0 citations
Abstract A separable version of Ky Fan’s majorization relation is proven for a sum of two operators that are each a tensor product of two positive semi-definite operators. In order to prove it, upper bounds are established on the relevant largest eigenvalue sums in terms of the optimal values of certain linear programs. The objective function of these linear programs is the dual of the direct sum of the spectra of the summands. The feasible sets are bounded polyhedra determined by positive numbers, called alignment terms, that quantify the overlaps between pairs of largest eigenvalue spaces of the summands. By appealing to geometric considerations, tight upper bounds are established on the alignment terms of tensor products of positive semi-definite operators. As an application, the spin alignment conjecture in quantum information theory is affirmatively resolved to the 2-letter level. Consequently, the coherent information of platypus channels is additive to the 2-letter level.
We use linear programming to prove a separable version of Ky Fan's majorization relation for a sum of two operators that are each a tensor product of nnn positive semidefinite operators. We give an example showing that such a relation does not hold in general for sums of three or more tensor products of three or more positive semidefinite operators.
Several classical majorization relations for sums or products of matrices involve a majorizing vector of perfectly aligned eigenvalues or singular values. By relaxing the order of alignment to a partial order, we show that the majorization can be strengthened, provided the change-of-basis matrices admit an LU-approximation with respect to this partial order. In this way, we obtain refined versions of Ky Fan's majorization relations, Horn's log-majorization relation, and von Neumann's trace inequality. As an application, we give a short proof of the separable Ky Fan majorization relation for an arbitrary number of tensor factors and extend it to a sum of tensor products of arbitrary matrices. Further applications concern majorization relations for sums of (anti-)symmetric powers and for products of Kronecker sums.
The spin alignment conjecture was originally formulated in connection with the additivity of coherent information for a class of quantum channels known as platypus channels. Recently, a stronger majorization-based version was proposed by M. A. Alhejji and E. Knill [Commun. Math. Phys. 405, 119, 2024], asserting that the spectrum of the alignment operator is always majorized by that of the perfectly aligned configuration. In this letter, we show that this strong spin alignment conjecture is false in general by constructing an explicit counterexample in the smallest unresolved case, namely three qubits. The example uses two-body states that are not jointly compatible with any single three-qubit global state, which naturally leads to a compatibility-constrained variant of the conjecture.
A central challenge in quantum information theory is to determine whether entanglement provides an advantage for information processing when coherent operations across multiple channel uses are allowed. For depolarizing channels, King's proof of the additivity of the minimum output entropy rules out such an advantage for classical communication at leading asymptotic order, while leaving open the possibility of an advantage for higher orders. In this work, we conjecture a majorization relation for the outputs of depolarizing channels and prove an approximate version of this conjecture. Our proof combines an exact ordering of shifted log-determinants with an anti-concentration bound for the spectrum of the product-state output, refining King's analysis based on Schatten norms. As a direct application, we obtain a tight third-order expansion for the classical capacity of quantum depolarizing channels. Consequently, entangled codewords and collective decoding can improve the message size over the product-coding strategy by at most O(log⁡log⁡n)O(\log \log n)O(loglogn) bits, sharpening our understanding of the role of entanglement in the finite-blocklength regime.
The strong spin-alignment conjecture fails for three qubits when the subset states are chosen independently. We prove that it holds when they are marginals of one global state: for every three-qubit state, every positive semidefinite qubit operator Q, and every nonnegative set of subset weights, the aligned output majorizes the corresponding marginal mixture. The proof classifies the extreme rays of cones on which a fixed set of aligned eigenvalues is largest. This reduces arbitrary weights to two-term sums and the complete one- and two-body layers. For arbitrary numbers of subsystems, we also characterize when one unital quantum channel simultaneously realizes all marginal replacements. This criterion proves alignment for fully PPT states. A separate argument proves alignment for locally rotated stabilizer states in every prime local dimension, at maximally mixed background. These results determine the minimum output Rényi entropies of the associated three-qubit replacement channels. Under either of the two input restrictions above, they also determine the many-use classical capacity and the exact strong-converse exponent for correlated replacement channels of arbitrary size.