1677 search results - page 6 / 336 » On the Completeness of Quantum Computation Models |
112
Voted
JELIA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identi...
COCO
2004
Springer
15 years 2 months ago
2004
Springer
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
75
Voted
DAGSTUHL
2006
14 years 11 months ago
2006
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
MSCS
2006
14 years 9 months ago
2006
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 ...
70
Voted
CORR
2008
Springer
14 years 9 months ago
2008
Springer
It has recently been discovered that both quantum and classical propositional logics can be modelled by classes of nonorthomodular and thus non-distributive lattices that properly...