3.6k citations · 12.4k across the 101 of their papers we have counts for
4 papers · 1 filter
Improved quantum algorithms for the ordered search problem via semidefinite programming
Andrew M. Childs, Andrew J. Landahl, Pablo A. Parrilo
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log_2 N q…
Detecting multipartite entanglement
Andrew C. Doherty, Pablo A. Parrilo, Federico M. Spedalieri
We discuss the problem of determining whether the state of several quantum mechanical subsystems is entangled. As in previous work on two subsystems we introduce a procedure for ch…
A complete family of separability criteria
Andrew C. Doherty, Pablo A. Parrilo, Federico M. Spedalieri
We introduce a new family of separability criteria that are based on the existence of extensions of a bipartite quantum state to a larger number of parties satisfying certain s…
Distinguishing separable and entangled states
Andrew C. Doherty, Pablo A. Parrilo, Federico M. Spedalieri
We show how to design families of operational criteria that distinguish entangled from separable quantum states. The simplest of these tests corresponds to the well-known Peres-Hor…