1352 search results - page 90 / 271 » Fault-Tolerant Quantum Computation |
148
Voted
JPDC
2008
15 years 5 months ago
2008
This paper proposes a variation of the Byzantine generals problem (or Byzantine consensus). Each general has a set of good plans and a set of bad plans. The problem is to make all...
171
click to vote
SIAMCOMP
2002
15 years 5 months ago
2002
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
168
Voted
SIGOPS
2011
15 years 9 days ago
2011
Secure, fault-tolerant distributed systems are difficult to build, to validate, and to operate. Conservative design for such systems dictates that their security and fault toleran...
134
click to vote
ATAL
2007
Springer
15 years 11 months ago
2007
Springer
Key idea of this work is to appropriately extend one prominent generic agent architecture, namely InteRRap [8], to the case of a quantum pattern matching (QPM) based type-I quantu...
163
Voted
JAVA
2001
Springer
15 years 9 months ago
2001
Springer
CX, a network-based computational exchange, is presented. The system’s design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, e...