1352 search results - page 90 / 271 » Fault-Tolerant Quantum Computation |
JPDC
2008
13 years 7 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...
SIAMCOMP
2002
13 years 7 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...
SIGOPS
2011
13 years 2 months 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...
ATAL
2007
Springer
14 years 2 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...
JAVA
2001
Springer
14 years 9 days 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...