Sciweavers

1677 search results - page 5 / 336
» On the Completeness of Quantum Computation Models
Sort
View
ENTCS
2006
136views more  ENTCS 2006»
14 years 9 months ago
Classically-controlled Quantum Computation
It is reasonable to assume that quantum computations take place under the control of the classical world. For modelling this standard situation, we introduce a Classically-control...
Simon Perdrix, Philippe Jorrand
ALGORITHMICA
2010
92views more  ALGORITHMICA 2010»
14 years 9 months ago
Quantum Separation of Local Search and Fixed Point Computation
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
Xi Chen, Xiaoming Sun, Shang-Hua Teng
CORR
2010
Springer
225views Education» more  CORR 2010»
14 years 9 months ago
Analysis of the Security of BB84 by Model Checking
Quantum Cryptography or Quantum key distribution (QKD) is a technique that allows the secure distribution of a bit string, used as key in cryptographic protocols. When it was note...
Mohamed Elboukhari, Mostafa Azizi, Abdelmalek Aziz...
88
Voted
MICRO
2005
IEEE
117views Hardware» more  MICRO 2005»
15 years 3 months ago
A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
Recent experimental advances have demonstrated technologies capable of supporting scalable quantum computation. A critical next step is how to put those technologies together into...
Tzvetan S. Metodi, Darshan D. Thaker, Andrew W. Cr...
ECCC
2008
98views more  ECCC 2008»
14 years 9 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous