1677 search results - page 4 / 336 » On the Completeness of Quantum Computation Models |
MSCS
2007
13 years 10 months ago
2007
A discussion concerning the opposition between discretness and continuum in quantum mechanics is presented. In particular this duality is shown to be present not only in the early...
COCO
2004
Springer
14 years 4 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
DIS
2001
Springer
14 years 3 months ago
2001
Springer
In this paper we describe BR-4, a computational model of scienti c discovery in particle physics. The system incorporates operators for determining quantum values of known particle...
ENTCS
2007
13 years 10 months ago
2007
As a first step toward a notion of quantum data structures, we introduce a typing system for reflecting entanglement and separability. This is presented in the context of classi...
AIEDAM
2008
13 years 11 months ago
2008
Although it is known that quantum computers can solve certain computational problems exponentially faster than classical computers, only a small number of quantum algorithms have ...