13 citations · 66 across the 21 of their papers we have counts for
17 papers · 1 filter
Improved bounds on stabilizer extent and Clifford rank
Pulkit Sinha, Benjamin Lovitz
We prove that every pure state of stabilizer rank at most has stabilizer extent at most , and establish the analogous bound for the squared Clifford c…
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…
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…
Superadditivity of classical communication over quantum channels via random and deterministic permutations
Benjamin Lovitz, Peixue Wu
Since Hastings' proof of superadditivity of classical communication over quantum channels, considerable effort has been devoted to finding a structural explanation of this phenomen…
Counterexamples to additivity of minimum output -Rényi entropy of quantum channels for all
Debbie Leung, Benjamin Lovitz, Ion Nechita +1
The additivity of minimum output entropies is a central problem in quantum information theory. Nonadditivity is known for every Rényi order , at the von Neumann point , a…
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…
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…
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…
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…
A Complete Hierarchy of Linear Systems for Certifying Quantum Entanglement of Subspaces
Nathaniel Johnston, Benjamin Lovitz, Aravindan Vijayaraghavan
We introduce a hierarchy of linear systems for showing that a given subspace of pure quantum states is entangled (i.e., contains no product states). This hierarchy outperforms know…
New techniques for bounding stabilizer rank
Benjamin Lovitz, Vincent Steffan
In this work, we present number-theoretic and algebraic-geometric techniques for bounding the stabilizer rank of quantum states. First, we refine a number-theoretic theorem of Moul…
Entangled subspaces and generic local state discrimination with pre-shared entanglement
Benjamin Lovitz, Nathaniel Johnston
Walgate and Scott have determined the maximum number of generic pure quantum states that can be unambiguously discriminated by an LOCC measurement [Journal of Physics A: Mathematic…
The Non-m-Positive Dimension of a Positive Linear Map
Nathaniel Johnston, Benjamin Lovitz, Daniel Puzzuoli
We introduce a property of a matrix-valued linear map that we call its "non-m-positive dimension" (or "non-mP dimension" for short), which measures how large a subspace can be…
On decomposable correlation matrices
Benjamin Lovitz
Correlation matrices (positive semidefinite matrices with ones on the diagonal) are of fundamental interest in quantum information theory. In this work we introduce and study the s…
Practical Quantum Appointment Scheduling
Dave Touchette, Benjamin Lovitz, Norbert Lütkenhaus
We propose a protocol based on coherent states and linear optics operations for solving the appointment-scheduling problem. Our main protocol leaks strictly less information about…
Families of Quantum Fingerprinting Protocols
Benjamin Lovitz, Norbert Lütkenhaus
We introduce several families of quantum fingerprinting protocols to evaluate the equality function on two -bit strings in the simultaneous message passing model. The original q…
Perfect State Transfer in Laplacian Quantum Walk
R. Alvir, S. Dever, B Lovitz +4
For a graph and a related symmetric matrix , the continuous-time quantum walk on relative to is defined as the unitary matrix , where varies o…