activity
20232026
most citedTight bounds for antidistinguishability and circulant sets of pure quantum states

10 citations · 12 across the 5 of their papers we have counts for

collaborators

7 papers

quant-ph2026

Sharp bounds for perfect quantum state classification beyond antidistinguishability

Nathaniel Johnston, Benjamin Lovitz, Vincent Russo +1

A multiset of pure quantum states is said to be k-learnable if there is a measurement strategy that always narrows an unknown sample drawn from the list down to one of at most k ca…

quant-ph2026

PPT states of almost maximal Schmidt number

Nathaniel Johnston, Benjamin Lovitz

We construct PPT states on that have Schmidt number asymptotically approaching the smaller local dimension. More specifically, we construct a PPT…

quant-ph2026

Distinguishability of locally diagonal orthogonally invariant quantum states

Nathaniel Johnston, Vincent Russo

We study the distinguishability of quantum states under local operations with classical communication (LOCC), separable, and positive-partial-transpose (PPT) measurements, focusing…

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-ph2024★ 1 cited

X-arability of mixed quantum states

Harm Derksen, Nathaniel Johnston, Benjamin Lovitz

The problem of determining when entanglement is present in a quantum system is one of the most active areas of research in quantum physics. Depending on the setting at hand, differ…

quant-ph2023★ 10 cited

Tight bounds for antidistinguishability and circulant sets of pure quantum states

Nathaniel Johnston, Vincent Russo, Jamie Sikora

A set of pure quantum states is said to be antidistinguishable if upon sampling one at random, there exists a measurement to perfectly determine some state that was not sampled. We…

math.OC2023★ 1 cited

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…