From the 1 of 5 linked papers with an AI index.
5 papers
Counterexamples to additivity of minimum output -Rényi entropy of quantum channels for and
Debbie Leung, Benjamin Lovitz, Peixue Wu
The authors construct explicit finite‑dimensional quantum channels that violate additivity of the minimum output p‑Rényi entropy for all Rényi orders p > 3/4 and 0 ≤ p < 1/4, narro…
Nearly tight bounds for testing tree tensor network states
Benjamin Lovitz, Angus Lowe
Tree tensor network states (TTNS) generalize the notion of having low Schmidt-rank to multipartite quantum states, through a parameter known as the bond dimension. This leads to su…
Constructive counterexamples to the additivity of minimum output Rényi entropy of quantum channels for all
Harm Derksen, Benjamin Lovitz
We present explicit quantum channels with strictly sub-additive minimum output Rényi entropy for all , improving upon prior constructions which handled . Our example is…
The complexity of perfect quantum state classification
Nathaniel Johnston, Benjamin Lovitz, Vincent Russo +1
The problem of quantum state classification asks how accurately one can identify an unknown quantum state that is promised to be drawn from a known set of pure states. In this work…
A hierarchy of eigencomputations for polynomial optimization on the sphere
Benjamin Lovitz, Nathaniel Johnston
We introduce a convergent hierarchy of lower bounds on the minimum value of a real form over the unit sphere. The main practical advantage of our hierarchy over the real sum-of-squ…