153 citations · 253 across the 13 of their papers we have counts for
Showing 2009 · quant-phShow all
3 papers · 2 filters
quant-ph2009
QIP = PSPACE
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay +1
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a pa…
quant-ph2009★ 43 cited
Semidefinite programs for completely bounded norms
John Watrous
The completely bounded trace and spectral norms in finite dimensions are shown to be expressible by semidefinite programs. This provides an efficient method by which these norms ma…
quant-ph2009★ 153 cited
All entangled states are useful for channel discrimination
M. Piani, J. Watrous
We prove that every entangled state is useful as a resource for the problem of minimum-error channel discrimination. More specifically, given a single copy of an arbitrary bipartit…