1677 search results - page 1 / 336 » On the Completeness of Quantum Computation Models |
ENTCS
2008
13 years 4 months ago
2008
We argue that a realistic model for quantum computations should be general with respect to measurements, and complete with respect to the information flow between the quantum and ...
CIE
2010
Springer
13 years 9 months ago
2010
Springer
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
DSN
2004
IEEE
13 years 8 months ago
2004
IEEE
In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual com...
STOC
2006
ACM
14 years 4 months ago
2006
ACM
It is proved that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the Goldreich?Micali?Wigderson classical zero-knowledge proto...
ENTCS
2008
13 years 4 months ago
2008
In this paper we study the relation between reversible and irreversible computation applicable to different models of computation -- here we are considering classical and quantum ...