1 code implementation • 31 Oct 2018 • Bryan Coutts, Mark Girard, John Watrous
Optimality conditions for convex optimization problems over the set of all quantum measurements of a given system having a fixed number of measurement outcomes are obtained as a special case.
Quantum Physics
no code implementations • 29 Aug 2014 • Somshubhro Bandyopadhyay, Alessandro Cosentino, Nathaniel Johnston, Vincent Russo, John Watrous, Nengkun Yu
We prove limitations on LOCC and separable measurements in bipartite state discrimination problems using techniques from convex optimization.
Quantum Physics
no code implementations • 19 Aug 2008 • Scott Aaronson, John Watrous
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas.
Quantum Physics Computational Complexity
no code implementations • 25 Apr 2008 • Debbie Leung, Ben Toner, John Watrous
We show that any number of parties can coherently exchange any one pure quantum state for another, without communication, given prior shared entanglement.
Quantum Physics
no code implementations • 21 Apr 2008 • John Watrous
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems.
Quantum Physics
no code implementations • 8 Sep 2000 • John Watrous
We prove that for an arbitrary group oracle there exist succinct (polynomial-length) quantum proofs for the Group Non-Membership problem that can be checked with small error in polynomial time on a quantum computer.
Computational Complexity Quantum Physics F.1.3;F.1.2
