508 search results - page 20 / 102 » Poly-locality in quantum computing |
EUROCRYPT
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we show how to convert a statistically binding but computationally concealing quantum bit commitment scheme into a computationally binding but statistically concealin...
PAAPP
2006
13 years 8 months ago
2006
ICPR
2008
IEEE
14 years 3 months 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...
FOCS
1998
IEEE
14 years 26 days ago
1998
IEEE
Sampling is an important primitive in probabilistic and quantum algorithms. In the spirit of communication complexity, given a function f : X
FOCS
1997
IEEE
14 years 25 days 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...