SCOPUS 정보 검색 플랫폼

Journal of Computer and System Sciences

Volumn 62, Issue 2, 2001, Pages 376-391

Quantum simulations of classical random walks and undirected graph connectivity

(1) Watrous, J a

a UNIVERSITÉ DE MONTRÉAL (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ERROR ANALYSIS; GRAPHIC METHODS; PROBABILISTIC LOGICS; PROBLEM SOLVING; RANDOM PROCESSES; TURING MACHINES;

CLASSICAL RANDOM WALKS; QUANTUM SIMULATIONS; QUANTUM TURING MACHINES; RANDOMIZED LOGSPACE; UNDIRECTED GRAPH CONNECTIVITY; UNITARY QUANTUM COMPUTATIONS;

COMPUTER SIMULATION;

EID: 0035278392 PISSN: 00220000 EISSN: None Source Type: Journal
DOI: 10.1006/jcss.2000.1732 Document Type: Conference Paper

Times cited : (169)

References (16)

1
- 0031632848
- Quantum circuits with mixed states
- (1998) Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing , pp. 20-30
- Aharonov, D.¹ Kitaev, A.² Nisan, N.³

2
- 85045415700
- Random walks, universal traversal sequences, and the time complexity of maze problems
- (1979) Proceedings of the 20th Annual Symposium on Foundations of Computer Science , pp. 218-223
- Aleliunas, R.¹ Karp, R.² Lipton, R.³ Lovász, L.⁴ Rackoff, C.⁵

3
- 0030671644
- 4/3
- (1997) Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing , pp. 230-239
- Armoni, R.¹ Ta-Shma, A.² Wigderson, A.³ Zhou, S.⁴

4
- 0010146684
- The thermodynamics of computation-A review
- (1982) Internat. J. Theoret. Phys. , vol.21 , pp. 905-940
- Bennett, C.H.¹

5
- 0001063035
- Strengths and weaknesses of quantum computing
- (1997) SIAM J. Comput. , vol.26 , pp. 1510-1523
- Bennett, C.H.¹ Bernstein, E.² Brassard, G.³ Vazirani, U.⁴

6
- 5544255325
- Quantum complexity theory
- (1997) SIAM J. Comput. , vol.26 , pp. 1411-1473
- Bernstein, E.¹ Vazirani, U.²

7
- 0002768948
- Quantum computation
- (L. Hemaspaandra and A. Selman, Eds.); Springer-Verlag, Berlin/New York
- (1997) Complexity Theory Retrospective II , pp. 23-50
- Berthiaume, A.¹

8
- 0004242420
- Algebraic graph theory
- Cambridge University Press, Cambridge, UK
- (1974)
- Biggs, N.¹

9
- 0029701737
- A fast quantum mechanical algorithm for database search
- (1996) Proceedings of the Twenty-Eight Annual ACM Symposium on Theory of Computing , pp. 212-219
- Grover, L.¹

10
- 0000328287
- Irreversibility and heat generation in the computing process
- (1961) IBM J. Res. Develop. , vol.5 , pp. 183-191
- Landauer, R.¹

11
- 0002442882
- Reversible space equals deterministic space (extended abstract)
- (1997) Proceedings of the 12th Annual IEEE Conference on Computational Complexity , pp. 45-50
- Lange, K.¹ McKenzie, P.² Tapp, A.³

12
- 0001667057
- Symmetric space-bounded computation
- (1982) Theoret. Comput. Sc. , vol.19 , pp. 161-187
- Lewis, H.¹ Papadimitriou, C.²

13
- 0005312542
- Mixing of random walks and other diffusions on a graph
- (P. Rowlinson, Ed.), London Mathematical Society Lecture Note Series; Cambridge University Press, Cambridge, UK
- (1995) Surveys in Combinatories , vol.218 , pp. 119-154
- Lovász, L.¹ Winkler, P.²

14
- 0003044448
- Symmetric logspace is closed under complement
- (1995) Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing , pp. 140-146
- Nisan, N.¹ Ta-Shma, A.²

15
- 0029720399
- Randomization and derandomization in space-bounded computation
- (1996) Proceedings of the 11th Annual IEEE Conference on Computational Complexity , pp. 128-149
- Saks, M.¹

16
- 0032597110
- Space-bounded quantum complexity
- (1999) J. Comput. System Sci. , vol.59 , pp. 281-326
- Watrous, J.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.