Sciweavers

1352 search results - page 232 / 271
» Fault-Tolerant Quantum Computation
Sort
View
UC
2009
Springer
14 years 2 months ago
On the Brightness of the Thomson Lamp: A Prolegomenon to Quantum Recursion Theory
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the...
Karl Svozil
ECCC
2002
86views more  ECCC 2002»
13 years 8 months ago
Classical Physics and the Church-Turing Thesis
Would physical laws permit the construction of computing machines that are capable of solving some problems much faster than the standard computational model? Recent evidence sugge...
Andrew Chi-Chih Yao
DAC
2010
ACM
14 years 5 days ago
Reducing the number of lines in reversible circuits
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
Robert Wille, Mathias Soeken, Rolf Drechsler
CORR
2010
Springer
196views Education» more  CORR 2010»
13 years 8 months ago
Low Power Reversible Parallel Binary Adder/Subtractor
In recent years, Reversible Logic is becoming more and more prominent technology having its applications in Low Power CMOS, Quantum Computing, Nanotechnology, and Optical Computin...
H. G. Rangaraju, U. Venugopal, K. N. Muralidhara, ...
PODC
2010
ACM
14 years 5 days ago
The multiplicative power of consensus numbers
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
Damien Imbs, Michel Raynal