SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Theoretical Computer Science

Volumn 264, Issue 1, 2001, Pages 139-153

Counting by quantum eigenvalue estimation

(1) Mosca, Michele a,b

a UNIVERSITY OF OXFORD (United Kingdom)

b UNIVERSITY OF WATERLOO (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; QUANTUM THEORY; RANDOM PROCESSES; THEOREM PROVING;

QUANTUM SEARCHING;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 0034905729 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/S0304-3975(00)00217-6 Document Type: Article

Times cited : (36)

References (24)

1
- 0023869334
- Notes on the history of reversible computation
- (1988) IBM J. Res. Dev. , vol.32 , pp. 16-23
- Bennett, C.H.¹

2
- 84904569271
- Generalized grover search algorithm for arbitrary initial amplitude distribution
- Proc. 1st NASA Internat. Conf. on Quantum Computing and Quantum Communications, Palm Springs, USA
- (1999) Lecture Notes in Computer Science , vol.1509 , pp. 140-147
- Biron, D.¹ Biham, O.² Biham, E.³ Grassl, M.⁴ Lidar, D.A.⁵

3
- 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.V.⁴

4
- 0032313840
- Quantum lower bounds by polynomials
- (1998) Proc. 39th Ann. Symp. on the Foundations Comput. Sci. , pp. 352-361
- Beals, R.¹ Buhrman, H.² Cleve, R.³ Mosca, M.⁴ De Wolf, R.⁵

5
- 0002257447
- Tight bounds on quantum searching
- Journal version appeared in Fortschr. Phys. 46 (1998) 493-505
- (1996) Proc. 4th Work. on Physics and Computation , pp. 36-43
- Boyer, M.¹ Brassard, G.² Høyer, P.³ Tapp, A.⁴

6
- 0030661550
- An exact quantum polynomial-time algorithm for Simon's problem
- IEEE Computer Society Press, Silver Spring, MD
- (1997) Proc. of the 5th Israeli Symp. on Theory of Computing and Systems , pp. 12-23
- Brassard, G.¹ Høyer, P.²

7
- 0003639558
- preprint
- Quantum amplitude amplification and estimation
- Brassard, G.¹ Høyer, P.² Mosca, M.³ Tapp, A.⁴

8
- 84878528377
- Quantum counting
- Proc. 25th Internat. Coll. on Automata, Languages and Programming
- (1998) Lecture Notes in Computer Science , vol.1443 , pp. 820-831
- Brassard, G.¹ Høyer, P.² Tapp, A.³

9
- 0027245270
- Quantum complexity theory
- ACM Press, New York. Journal version appeared in SIAM J. Comput. 26 (1997) 1474-1483
- (1993) Proc. 25th Annual ACM Symposium on the Theory of Computing , pp. 11-20
- Bernstein, E.¹ Vazirani, U.²

10
- 33746708722
- Quantum algorithms revisited
- (1998) Proc. Roy. Soc. London A , vol.454 , pp. 339-354
- Cleve, R.¹ Ekert, A.² Macchiavello, C.³ Mosca, M.⁴

11
- 84883346492
- Quantum database searching by a single query
- Proc. of the 1st NASA Internat. Conf. on Quantum Computing and Quantum Communication , pp. 148-151
- Chi, D.P.¹ Kim, J.²

12
- 0022421379
- Quantum-theory, the Church-Turing principle and the universal quantum computer
- (1985) Proc. Roy. Soc. London A , vol.400 , pp. 97-117
- Deutsch, D.¹

13
- 0000119236
- Rapid solution of problems by quantum computation
- (1992) Proc. Roy. Soc. London A , vol.439 , pp. 553-558
- Deutsch, D.¹ Jozsa, R.²

14
- 51249180339
- Simulating Physics with computers
- (1982) Internat. J. Theor. Phys. , vol.21 , pp. 467-488
- Feynman, R.P.¹

15
- 0029701737
- A fast quantum mechanical algorithm for database search
- ACM Press, New York. Journal version, Quantum Mechanics helps in searching for a needle in a haystack, appeared in Physical Review Letters 79 (1997) 325-328
- (1996) Proc. 28th Ann. ACM Symp. on the Theory of Computing , pp. 212-219
- Grover, L.K.¹

16
- 0031645678
- A framework for fast quantum mechanical algorithms
- ACM Press, New York
- (1998) Proc. 30th Ann. ACM Symp. on the Theory of Computing , pp. 53-62
- Grover, L.K.¹

17
- 38249043088
- Random generation of combinatorial structures from a uniform distribution
- (1986) Theoret. Comput. Sci. , vol.43 , pp. 169-188
- Jerrum, M.R.¹ Valiant, L.G.² Vazirani, V.V.³

18
- 0003551512
- (1995) Quantum measurements and the Abelian Stabilizer Problem
- Kitaev, A.Y.¹

19
- 0040810965
- Quantum searching, counting and amplitude amplification by eigenvector analysis
- R. Freivalds (Ed.), Brno, Czech Republic
- (1998) Proc. of Randomized Algorithms, Workshop of Mathematical Foundations of Computer Science , pp. 90-100
- Mosca, M.¹

20
- 84961385953
- The hidden subgroup problem and eigenvalue estimation on a quantum computer
- Proc. of the 1st NASA Int. Conf. on Quantum Computing and Quantum Communication
- Lecture Notes in Computer Science , pp. 174-188
- Mosca, M.¹ Ekert, A.²

21
- 84944878354
- CRC Press, London
- (1996) Handbook of Applied Cryptography
- Menezes, A.J.¹ Van Oorschot, P.C.² Vanstone, S.A.³

22
- 0004168557
- Cambridge University Press, Cambridge
- (1995) Randomized Algorithms
- Motwani, R.¹ Raghavan, P.²

23
- 85115374351
- Algorithms for quantum computation: Discrete logarithms and factoring
- Journal version, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput. 26 (1997) 1484-1509
- (1994) Proc. 35th Ann. Symp. on Foundations of Comp. Sci. , pp. 124-134
- Shor, P.W.¹

24
- 0002007763
- On the power of quantum computation
- Journal version appeared in SIAM J. Comput. 26 (1997) 1474-1483
- (1994) Proc. 35th Ann. Symp. on Foundations Comput. Sci. , pp. 116-123
- Simon, D.¹

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