# Mark W. Girard

## Publications Authored By Mark W. Girard

We introduce a new entanglement measure for two-qubit states that we call the binegativity. This new measure is compared to the concurrence and negativity, the only other known entanglement measures that can be computed analytically for all two-qubit states. The ordering of entangled two-qubit mixed states induced by the binegativity is distinct from the ordering determined by previously known measures, yielding new insights into the structure of entangled mixed states of two qubits. Read More

The primary goal in the study of entanglement as a resource theory is to find conditions that determine when one quantum state can or cannot be transformed into another via local operations and classical communication. This is typically done through entanglement monotones or conversion witnesses. Such quantities cannot be computed for arbitrary quantum states in general, but it is useful to consider classes of symmetric states for which closed-form expressions can be found. Read More

The primary goal of entanglement theory is to determine convertibility conditions for two quantum states. Up until now, this has always been done with the use of entanglement monotones. With the exception of the negativity, such quantities tend to be rather uncomputable. Read More

Convex optimization problems arise naturally in quantum information theory, often in terms of minimizing a convex function over a convex subset of the space of hermitian matrices. In most cases, finding exact solutions to these problems is usually impossible. As inspired by earlier investigations into the relative entropy of entanglement [Phys. Read More

When performing maximum-likelihood quantum-state tomography, one must find the quantum state that maximizes the likelihood of the state given observed measurements on identically prepared systems. The optimization is usually performed with iterative algorithms. This paper provides a gradient-based upper bound on the ratio of the true maximum likelihood and the likelihood of the state of the current iteration, regardless of the particular algorithm used. Read More