arXiv:2610.28015
Optimal Approximate Quantum Conversion from a Taut-String Principle in Majorization-Based Resource Theories
Franco Meroi, Cesar Massri, Marcelo Losada, Guido Bellomo, Gustavo Martin Bosyk
Abstract
Optimal approximate state conversion is a fundamental task in quantum resource theories, yet existing solutions are largely tailored to specific distinguishability measures and resource theories. We show that every optimal approximate-conversion problem in the three paradigmatic majorization-based quantum resource theories of non-uniformity, bipartite pure-state entanglement, and pure-state coherence reduces exactly to one of only four elementary taut-string constructions. This holds for problems generated by Schur-convex spectral distances and by a broad family of quantum divergences satisfying a natural reduction property with respect to the corresponding equivalence group. The resulting framework encompasses a broad class of physically relevant distinguishability measures, including the trace distance, all unitarily invariant norms, quantum relative entropy, maximal quantum $f$-divergences, and the $α$-$z$ Rényi relative entropies. The increment vector of the corresponding taut string completely determines both the optimal approximation error and a canonical optimal state. Our results establish a common geometric framework for approximate quantum resource conversion, revealing that a broad class of seemingly different optimization problems is governed by the same taut-string geometric principle.
AI Summary
The paper asks whether optimal approximate state conversion under majorization constraints admits a common solution across different resource theories and error measures. It treats non-uniformity, bipartite pure-state entanglement, and pure-state coherence, considering both the closest state reachable from a given input and the closest state from which that input can be obtained. The main result reduces these problems to four one-dimensional taut-string constructions. Two solve Schur-convex functions of probability-vector differences over lower and upper majorization polytopes; two solve classical Csiszár $f$-divergence objectives over those polytopes. A taut string is the shortest piecewise-linear curve between fixed endpoints constrained by a floor and roof. Its increments determine a canonical optimal state and the minimum error. Within each classical objective class, the construction supplies an optimizer simultaneously for all admissible functions. The reduction covers spectral distances generated by Schur-convex functions, including all unitarily invariant norms. For non-uniformity, it also covers quantum divergences whose unitary-orbit minimization reduces to a strictly increasing function of a classical $f$-divergence, including relative entropy and the stated Rényi families. For pure-state entanglement and coherence, spectral-distance optimization reduces to maximizing classical fidelity, handled through the Hellinger $f$-divergence. The proof combines reduction to representative probability vectors with classical taut-string optimization propositions; their detailed proofs are deferred to supplementary material. Entanglement and coherence are restricted to pure states, and divergence coverage requires the specified reduction property. Thermo-majorization and catalytic transformations are proposed extensions, not established results.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.