1352 search results - page 134 / 271 » Fault-Tolerant Quantum Computation |
147
click to vote
ICPR
2008
IEEE
16 years 1 days ago
2008
IEEE
In this paper, we explore experimentally the use of the commute time of the continuous-time quantum walk for graph drawing. For the classical random walk, the commute time has bee...
148
Voted
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
138
click to vote
FOCS
1997
IEEE
15 years 9 months ago
1997
IEEE
In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeterministic and proba...
160
click to vote
MOBIHOC
2003
ACM
15 years 11 months ago
2003
ACM
Reliable storage of data with concurrent read/write accesses (or query/update) is an ever recurring issue in distributed settings. In mobile ad hoc networks, the problem becomes e...
166
click to vote
ISCA
2005
IEEE
15 years 11 months ago
2005
IEEE
: The theoretical study of quantum computation has yielded efficient algorithms for some traditionally hard problems. Correspondingly, experimental work on the underlying physical...