Sciweavers

233 search results - page 5 / 47
» Interactive Proofs For Quantum Computations
Sort
View
94
Voted
FOCS
2000
IEEE
15 years 1 months ago
Succinct quantum proofs for properties of finite groups
In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certifi...
John Watrous
CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 9 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
COCO
2008
Springer
86views Algorithms» more  COCO 2008»
14 years 11 months ago
Using Entanglement in Quantum Multi-prover Interactive Proofs
Julia Kempe, Hirotada Kobayashi, Keiji Matsumoto, ...
68
Voted
MSCS
2006
89views more  MSCS 2006»
14 years 9 months ago
Quantum weakest preconditions
We develop a notion of predicate transformer and, in particular, the weakest precondition, appropriate for quantum computation. We show that there is a Stone-type duality between ...
Ellie D'Hondt, Prakash Panangaden