1677 search results - page 7 / 336 » On the Completeness of Quantum Computation Models |
ENTCS
2008
14 years 9 months ago
2008
Progress, Extended Abstract) Philippe Jorrand1 Simon Perdrix2 Leibniz Laboratory IMAG-INPG Grenoble, France The aim of this paper is to introduce a general model of quantum comput...
ISCI
2000
14 years 9 months ago
2000
This paper discusses a model of quantum associative memory which generalizes the completing associative memory proposed by Ventura and Martinez. Similar to this model, our system ...
SAC
2009
ACM
15 years 4 months ago
2009
ACM
Abstract— This article describes how to accelerate the convergence of Preconditioned Conjugate Gradient (PCG) type eigensolvers for the computation of several states around the b...
79
Voted
ISCA
2006
IEEE
15 years 3 months ago
2006
IEEE
We show that the problem of communication in a quantum computer reduces to constructing reliable quantum channels by distributing high-fidelity EPR pairs. We develop analytical m...
STOC
1993
ACM
15 years 1 months ago
1993
ACM
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...