Sciweavers

1352 search results - page 139 / 271
» Fault-Tolerant Quantum Computation
Sort
View
ICMLA
2010
13 years 6 months ago
A Probabilistic Graphical Model of Quantum Systems
Quantum systems are promising candidates of future computing and information processing devices. In a large system, information about the quantum states and processes may be incomp...
Chen-Hsiang Yeang
CIE
2010
Springer
14 years 25 days ago
On the Completeness of Quantum Computation Models
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension...
Pablo Arrighi, Gilles Dowek
FOSSACS
2011
Springer
12 years 11 months ago
Coalgebraic Walks, in Quantum and Turing Computation
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of coalgebras and monads. Nondeterministic and probabilistic walks are coalgebras of...
Bart Jacobs
ISCA
2007
IEEE
130views Hardware» more  ISCA 2007»
14 years 2 months ago
Dynamic prediction of architectural vulnerability from microarchitectural state
Transient faults due to particle strikes are a key challenge in microprocessor design. Driven by exponentially increasing transistor counts, per-chip faults are a growing burden. ...
Kristen R. Walcott, Greg Humphreys, Sudhanva Gurum...
ISPA
2004
Springer
14 years 1 months ago
Cayley DHTs - A Group-Theoretic Framework for Analyzing DHTs Based on Cayley Graphs
Static DHT topologies influence important features of such DHTs such as scalability, communication load balancing, routing efficiency and fault tolerance. Nevertheless, it is co...
Changtao Qu, Wolfgang Nejdl, Matthias Kriesell