1677 search results - page 22 / 336 » On the Completeness of Quantum Computation Models |
DAC
2002
ACM
16 years 2 months ago
2002
ACM
This paper gives a simple but nontrivial set of local transformation rules for Control-NOT(CNOT)-based combinatorial circuits. It is shown that this rule set is complete, namely, ...
110
click to vote
STOC
2004
ACM
16 years 1 months ago
2004
ACM
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
LICS
1994
IEEE
15 years 5 months ago
1994
IEEE
I give a `totality space' model for linear logic [4], detaking an abstract view of computations on a datatype. The model has similarities with both the coherence space model ...
IPPS
2008
IEEE
15 years 7 months ago
2008
IEEE
As high-end computer systems present users with rapidly increasing numbers of processors, possibly also incorporating attached co-processors, programmers are increasingly challeng...
111
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
A general framework based on Gaussian models and a MAPEM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the sta...