Sciweavers

1352 search results - page 88 / 271
» Fault-Tolerant Quantum Computation
Sort
View
ISMVL
2002
IEEE
84views Hardware» more  ISMVL 2002»
14 years 24 days ago
The Role of Super-Fast Transforms in Speeding Up Quantum Computations
We present the role that spectral methods play in the development of the most impressive quantum algorithms, such as the polynomial time number factoring algorithm by Shor. While ...
Zeljko Zilic, Katarzyna Radecka
PAAPP
2007
115views more  PAAPP 2007»
13 years 7 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
ECCC
2010
103views more  ECCC 2010»
13 years 8 months ago
Time-Space Efficient Simulations of Quantum Computations
We give two time- and space-efficient simulations of quantum computations with intermediate measurements, one by classical randomized computations with unbounded error and the oth...
Dieter van Melkebeek, Thomas Watson
FUIN
2000
68views more  FUIN 2000»
13 years 7 months ago
Models For Dependable Computation with Multiple Inputs and Some Hardness Results
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR gra...
Yongge Wang, Yvo Desmedt, Mike Burmester
CAMP
2005
IEEE
14 years 1 months ago
Bio-Inspired Computing Architectures: The Embryonics Approach
Abstract— The promise of next-generation computer technologies, such as nano-electronics, implies a number of serious alterations to the design flow of digital circuits. One of ...
Gianluca Tempesti, Daniel Mange, André Stau...