Tài liệu tham khảo |
Loại |
Chi tiết |
[6] D.Aharonov, A.Ambainis, J.Kempe, and U. Vazirani. Quantum walks on graphs. In Proc. 33th ACM Symp. On the Theory of Computing (STOC), pp.50-59, 2001 |
Sách, tạp chí |
Tiêu đề: |
Proc. 33th ACM Symp. On the Theory of Computing (STOC) |
|
[7] Y.Aharonov, A.Botero.S.Popescu, B.reznik and J. Tollaksen, Physics Letters A 301, (2002) 130 |
Sách, tạp chí |
|
[8] D.Aharonov, W.van Dam, J.Kempe, Z.Landau, S.Lloyd, and O.Regev.Adiabatic quantum computation is equivalent to standard quamtum computation. In Proc .45 th Annual IEEE Symp. On Foundations of Computer Science (FOCS),pp.42-51,2004 |
Sách, tạp chí |
Tiêu đề: |
Proc .45"th "Annual IEEE Symp. On Foundations of ComputerScience (FOCS) |
|
[9] A.Ambainis. Quantum search algorithms (survey). SIAGCT News, 35(2) p:22-35,2004 |
Sách, tạp chí |
|
[10] A.Ambainis. Quamtum walk algorithm for element distinctness.In Proc.45 th Annual IEEE Symp. On Foundations of Computer Science (FOCS),pp.22-31,2004 (Preprint quant-ph/0311001) |
Sách, tạp chí |
Tiêu đề: |
Proc".45"th "Annual IEEE Symp. On Foundations of Computer Science (FOCS),"pp.22-31,2004 ("Preprint |
|
[12] A.Ambainis, J.Kempe, and A.Rivosh.Coins make quantum walks faster.In Proc.16 th ACM-SIAM Symp. on Discrete Algorithms(SODA), pp.1099- 1108,2005 |
Sách, tạp chí |
Tiêu đề: |
In Proc.16"th ACM-SIAM Symp. on Discrete Algorithms(SODA) |
|
[14] R. Beals. Quantum computation of Fourier transforms over symmetric groups. In Proc. 29 th STOC, pp.48-53, 1997 |
Sách, tạp chí |
Tiêu đề: |
In Proc. 29"th "STOC |
|
[15] Ch. Bennett. Logical reversibility of computation.IBM J. Res. Dev., 17:5225, 1973 |
Sách, tạp chí |
|
[16] C.Bennett, H.J. Bernstein, S.Popescu and B.Schumacher, Phys. Rev. A 53, (1996) 2046 |
Sách, tạp chí |
|
[17] C.H.Bennett, F. Bessette, G. Brassard, L. Salvail and J. Smolin, Journal of Cryptology 5, (1992) 3 |
Sách, tạp chí |
Tiêu đề: |
Journalof Cryptology |
|
[19] E. Bernstein and U .Vazirani. Quantum complexity theory. SIAM J.Comput., 26:1411, 1997 |
Sách, tạp chí |
|
[20] G.Brassard, P.Hoyer, and A. Tapp.Quantum cryptanalysis of hash and claw-free func-tions.In Proc.3 rd Latin American Symp. on Theoretical Informatics (LATIN),(Number 1380 in LNCS),pp.163-169,1998 |
Sách, tạp chí |
Tiêu đề: |
Proc.3"rd Latin American Symp. on TheoreticalInformatics (LATIN) |
|
[1] Nguyen Ba An, Tran Thai Hoa. Physich Letters A 373 (2009) 2601- 2604 [2] H.J. Briegel, R, Raussendorf, Phys.Rev.Lett. 86(2001) 910 |
Khác |
|
[3] A. Einstein, B. Popescu, Fortschr. Phys. 46 (1998) 567 |
Khác |
|
[4] D.M. Greenberger, M.A. Horne, A. Zeilinger, in: M. Kafatos(Ed), Bell's Theorem, Quantum Theory, anh Conception of the Universe, Kluwer, Dordrecht, 1989, p. 69 |
Khác |
|
[5] W. Dur, G. Vidal, J.I. Cirac, Phys.Rev. A 62 (2000) 062314 |
Khác |
|
[13] M. Aspelmeyer, H. R. Bohm, T. Gyatso, T.Jennewein, R. Kaltenbaek, M. Lindenthal, G.Molina-teriza, A. Poppe, K.Resch, M. Taraba, R.Ursin, P.Walther and A .Zeilinger, Science 301, (2003) 621 |
Khác |
|
[21] H. Buhrman, C. D u rr, M. Heiligman P. H o yer, F.Magniez, M.Santha,and R. de Wolf. Quantum algorithms for element distinctness. In Proc. 15 th IEEE Computa- tional Complexity. Extended version in SIAM J.Comput., 34(6):1324-1330; 2005 |
Khác |
|