Sciweavers

1391 search results - page 2 / 279
» Complexity Limitations on Quantum Computation
Sort
View
PAAPP
2007
115views more  PAAPP 2007»
13 years 5 months ago
Quantum computing: beyond the limits of conventional computation
The quantum model of computation not only o ers entirely new ways to manipulate information, but also allows information processing tasks to be formulated in unconventional, genui...
Marius Nagy, Selim G. Akl
COCO
2004
Springer
185views Algorithms» more  COCO 2004»
13 years 10 months ago
Limitations of Quantum Advice and One-Way Communication
Abstract: Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accesse...
Scott Aaronson
DSN
2004
IEEE
13 years 10 months ago
Fault Tolerant Computation on Ensemble Quantum Computers
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...
P. Oscar Boykin, Vwani P. Roychowdhury, Tal Mor, F...
CORR
2000
Springer
95views Education» more  CORR 2000»
13 years 6 months ago
One Complexity Theorist's View of Quantum Computing
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or t...
Lance Fortnow
FOCS
2003
IEEE
13 years 11 months ago
Polynomial Degree vs. Quantum Query Complexity
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
Andris Ambainis