Sciweavers

3328 search results - page 20 / 666
» Topological Quantum Computation
Sort
View
MSCS
2006
89views more  MSCS 2006»
13 years 7 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
STOC
1997
ACM
122views Algorithms» more  STOC 1997»
13 years 11 months ago
Fault-Tolerant Quantum Computation With Constant Error
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
Dorit Aharonov, Michael Ben-Or
POPL
2005
ACM
14 years 7 months ago
Communicating quantum processes
We define a language CQP (Communicating Quantum Processes) for modelling systems which combine quantum and classical communication and computation. CQP combines the communication ...
Simon J. Gay, Rajagopal Nagarajan
ICALP
2001
Springer
14 years 22 hour ago
Separating Quantum and Classical Learning
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
Rocco A. Servedio
CORR
2010
Springer
76views Education» more  CORR 2010»
13 years 7 months ago
Nonadaptive quantum query complexity
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that an...
Ashley Montanaro