17 citations · 26 across the 2 of their papers we have counts for
2 papers
quant-ph2013★ 17 cited
Quantum interactive proofs and the complexity of separability testing
Gus Gutoski, Patrick Hayden, Kevin Milner +1
We identify a formal connection between physical problems related to the detection of separable (unentangled) quantum states and complexity classes in theoretical computer science.…
quant-ph2012★ 9 cited
Two-message quantum interactive proofs and the quantum separability problem
Patrick Hayden, Kevin Milner, Mark M. Wilde
Suppose that a polynomial-time mixed-state quantum circuit, described as a sequence of local unitary interactions followed by a partial trace, generates a quantum state shared betw…