1391 search results - page 20 / 279 » Complexity Limitations on Quantum Computation |
COCO
2004
Springer
14 years 1 months ago
2004
Springer
We study the power of quantum proofs, or more precisely, the power of Quantum MerlinArthur (QMA) protocols, in two well studied models of quantum computation: the black box model ...
CF
2006
ACM
14 years 1 months ago
2006
ACM
t available: Pdf (734.64 KB) Additional Information: full citation, abstract, references, index terms Bibliometrics: Downloads (6 Weeks): 25, Downloads (12 Months): 230, Citation C...
IWINAC
2009
Springer
14 years 2 months ago
2009
Springer
Manifold initiatives try to utilize the operational principles of organisms and brains to develop alternative, biologically inspired computing paradigms. This paper reviews key fea...
MKM
2009
Springer
14 years 2 months ago
2009
Springer
Graphical languages provide a powerful tool for describing the behaviour of quantum systems. While the use of graphs vastly reduces the complexity of many calculations [4,10], manu...
FOCS
2007
IEEE
14 years 2 months ago
2007
IEEE
Attempts to find new quantum algorithms that outperform classical computation have focused primarily on the nonabelian hidden subgroup problem, which generalizes the central prob...