36 citations · 115 across the 12 of their papers we have counts for
Showing 2006Show all
3 papers · 1 filter
cs.DS2006★ 2 cited
Convex Separation from Optimization via Heuristics
Lawrence M. Ioannou, Benjamin C. Travaglione, Donny Cheung
Let be a full-dimensional convex subset of . We describe a new polynomial-time Turing reduction from the weak separation problem for to the weak optimization…
quant-ph2006
Computational complexity of the quantum separability problem
Lawrence M. Ioannou
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an un…
quant-ph2006★ 27 cited
Quantum Separability and Entanglement Detection via Entanglement-Witness Search and Global Optimization
Lawrence M. Ioannou, Benjamin C. Travaglione
We focus on determining the separability of an unknown bipartite quantum state by invoking a sufficiently large subset of all possible entanglement witnesses given the expected…