Sciweavers

3328 search results - page 6 / 666
» Topological Quantum Computation
Sort
View
ACMSE
2006
ACM
13 years 11 months ago
Revisiting a limit on efficient quantum computation
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...
Tarsem S. Purewal Jr.
COGSCI
2006
107views more  COGSCI 2006»
13 years 7 months ago
Is the Brain a Quantum Computer?
We argue that computation via quantum mechanical processes is irrelevant to explaining how brains produce thought, contrary to the ongoing speculations of many theorists. First, q...
Abninder Litt, Chris Eliasmith, Frederick W. Kroon...
SPAA
2003
ACM
14 years 22 days ago
The effect of communication costs in solid-state quantum computing architectures
Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed un...
Dean Copsey, Mark Oskin, Tzvetan S. Metodi, Freder...
ISCI
2000
92views more  ISCI 2000»
13 years 7 months ago
Quantum associative memory
This paper combines quantum computation with classical neural network theory to produce a quantum computational learning algorithm. Quantum computation uses microscopic quantum lev...
Dan Ventura, Tony R. Martinez
CORR
2012
Springer
183views Education» more  CORR 2012»
12 years 3 months ago
Twisting q-holonomic sequences by complex roots of unity
A sequence fn(q) is q-holonomic if it satisfies a nontrivial linear recurrence with coefficients polynomials in q and qn . Our main theorem states that q-holonomicity is preserve...
Stavros Garoufalidis, Christoph Koutschan