Sciweavers

1677 search results - page 11 / 336
» On the Completeness of Quantum Computation Models
Sort
View
102
Voted
FOCS
1998
IEEE
15 years 1 months ago
Quantum Lower Bounds by Polynomials
We examine the number T of queries that a quantum network requires to compute several Boolean functions on f0;1gN in the black-box model. We show that, in the blackbox model, the ...
Robert Beals, Harry Buhrman, Richard Cleve, Michel...
FSTTCS
1998
Springer
15 years 1 months ago
Alternative Computational Models: A Comparison of Biomolecular and Quantum Computation
Molecular Computation (MC) is massively parallel computation where data is stored and processed within objects of molecular size. Biomolecular Computation (BMC) is MC using biotec...
John H. Reif
66
Voted
COGSCI
2007
138views more  COGSCI 2007»
14 years 9 months ago
The Brain Is Both Neurocomputer and Quantum Computer
In their article, Is the Brain a Quantum Computer,? Litt, Eliasmith, Kroon, Weinstein, and Thagard (2006) criticize the Penrose–Hameroff “Orch OR” quantum computational mode...
Stuart R. Hameroff
DATE
2004
IEEE
144views Hardware» more  DATE 2004»
15 years 1 months ago
Smaller Two-Qubit Circuits for Quantum Communication and Computation
We show how to implement an arbitrary two-qubit unitary operation using any of several quantum gate libraries with small a priori upper bounds on gate counts. In analogy to librar...
Vivek V. Shende, Igor L. Markov, Stephen S. Bulloc...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
15 years 2 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang