activity
20092026
most citedPPT-indistinguishable states via semidefinite programming

81 citations · 172 across the 6 of their papers we have counts for

collaborators

6 papers

quant-ph2026

Metriq: A Collaborative Platform for Benchmarking Quantum Computers

Alessandro Cosentino, Changhao Li, Vincent Russo +6

The fragmented landscape of quantum computer benchmarks, characterized by system-specific tools and inconsistent evaluation methodologies, hinders reliable cross-platform performan…

quant-ph2014★ 77 cited

Limitations on separable measurements by convex optimization

Somshubhro Bandyopadhyay, Alessandro Cosentino, Nathaniel Johnston +3

We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization. Specific results that we prove include…

quant-ph2013★ 1 cited

Small sets of locally indistinguishable orthogonal maximally entangled states

Alessandro Cosentino, Vincent Russo

We study the problem of distinguishing quantum states using local operations and classical communication (LOCC). A question of fundamental interest is whether there exist sets of $…

quant-ph2013★ 5 cited

Dequantizing read-once quantum formulas

Alessandro Cosentino, Robin Kothari, Adam Paetznick

Quantum formulas, defined by Yao [FOCS '93], are the quantum analogs of classical formulas, i.e., classical circuits in which all gates have fanout one. We show that any read-once…

quant-ph2012★ 81 cited

PPT-indistinguishable states via semidefinite programming

Alessandro Cosentino

We show a simple semidefinite program whose optimal value is equal to the maximum probability of perfectly distinguishing orthogonal maximally entangled states using any PPT measur…

quant-ph2009★ 8 cited

Weight of quadratic forms and graph states

Alessandro Cosentino, Simone Severini

We prove a connection between Schmidt-rank and weight of quadratic forms. This provides a new tool for the classification of graph states based on entanglement. Our main tool arise…