13 citations · 66 across the 21 of their papers we have counts for
Showing 2025Show all
3 papers · 1 filter
quant-ph2025
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…
quant-ph2025
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 p…
cs.DS2025
A linear-time algorithm for Chow decompositions
Alexander Taveira Blomenhofer, Benjamin Lovitz
We propose a linear-time algorithm to compute low-rank Chow decompositions. Our algorithm can decompose concise symmetric 3-tensors in n variables of Chow rank n/3. The algorithm i…