Polytope conjecture for achievable derivatives in the spin-spin system

Let Δ3\Delta^3 denote the probability simplex, let derv(λ)\mathsf{derv}(\lambda) be the set of achievable derivatives at λ\lambda, let S4S_4 be the permutation group on four elements, and let LPL_P denote the operator associated with PS4P\in S_4. For a set of vectors, write conv\operatorname{conv} for its convex hull. Spin-spin polytope conjecture. For every λΔ3\lambda\in\Delta^3 it holds that

conv(derv(λ))=conv({LPλ:PS4})=:P(λ).\operatorname{conv}(\mathsf{derv}(\lambda))=\operatorname{conv}(\{-L_P\lambda:P\in S_4\})=:\mathcal P(\lambda).

The conjecture proposes an exact polytope description of the convex hull of achievable derivatives for the two-qubit spin-spin system with a single Lindblad term V=σ\mathds1V=\sigma_-\otimes\mathds1. The paper supports it with a partial proof and numerical evidence, while establishing a slightly larger upper bound and deriving an optimal cooling procedure separately.

Sources & referencesView supporting material

Primary source

Emanuel Malvetti, “Provably Time-Optimal Cooling of Markovian Quantum Systems”, arXiv:2403.05285 (2024).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.