-
1
-
-
84927700972
-
Quantum search of spatial regions
-
Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theory Comput. 1(4), 47-79 (2005
-
(2005)
Theory Comput.
, vol.1
, Issue.4
, pp. 47-79
-
-
Aaronson, S.1
Ambainis, A.2
-
2
-
-
0034819347
-
Quantum walks on graphs
-
Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of the 33rd ACM Symposium on Theory of Computing, pp. 50-59 (2001 (Pubitemid 32865717)
-
(2001)
Conference Proceedings of the Annual ACM Symposium on Theory of Computing
, pp. 50-59
-
-
Aharonov, D.1
Ambainis, A.2
Kempe, J.3
Vazirani, U.4
-
3
-
-
0034832939
-
One-dimensional quantum walks
-
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 37-49 (2001 (Pubitemid 32865716)
-
(2001)
Conference Proceedings of the Annual ACM Symposium on Theory of Computing
, pp. 37-49
-
-
Ambainis, A.1
Bach, E.2
Nayak, A.3
Vishwanath, A.4
Watrous, J.5
-
4
-
-
20744438178
-
Coins make quantum walks faster
-
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms
-
Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, pp. 1099-1108 (2005 (Pubitemid 40851478)
-
(2005)
Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
, pp. 1099-1108
-
-
Ambainis, A.1
Kempe, J.2
Rivosh, A.3
-
5
-
-
5444262221
-
Quantum walks and their algorithmic applications
-
Ambainis, A.: Quantum walks and their algorithmic applications. Int. J. Quantum Inf. 1, 507-518 (2003
-
(2003)
Int. J. Quantum Inf.
, vol.1
, pp. 507-518
-
-
Ambainis, A.1
-
6
-
-
34548457765
-
Quantum walk algorithm for element distinctness
-
DOI 10.1137/S0097539705447311
-
Ambainis, A.: Quantum walk algorithm for element distinctness. SIAM J. Comput. 37(1), 210-239 (2007 (Pubitemid 351321994)
-
(2007)
SIAM Journal on Computing
, vol.37
, Issue.1
, pp. 210-239
-
-
Ambainis, A.1
-
8
-
-
33746708722
-
Quantum algorithms revisited
-
Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. R. Soc. Lond. Ser. A, Math. Phys. Sci. 454, 339-354 (1998 (Pubitemid 128733166)
-
(1998)
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
, vol.454
, Issue.1969
, pp. 339-354
-
-
Cleve, R.1
Ekert, A.2
Macchiavello, C.3
Mosca, M.4
-
9
-
-
19744381153
-
Spatial search and the Dirac equation
-
Childs, A., Goldstone, J.: Spatial search and the Dirac equation. Phys. Rev. A 70, 042312 (2004
-
(2004)
Phys. Rev. A
, vol.70
, pp. 042312
-
-
Childs, A.1
Goldstone, J.2
-
11
-
-
0003551512
-
Quantum measurements and the Abelian stabilizer problem
-
arXiv:quant-ph/9511026
-
Kitaev, A.: Quantum measurements and the Abelian stabilizer problem. ECCC technical report 96-003 and arXiv:quant-ph/9511026 (1995
-
(1995)
ECCC technical report 96-003
-
-
Kitaev, A.1
-
12
-
-
77955313487
-
Finding is as easy as detecting for quantum walks
-
Krovi, H., Magniez, F., Ozols, M., Roland, J.: Finding is as easy as detecting for quantum walks. In: Proceedings of 37st International Colloquium on Automata, Languages and Programming, LNCS (2010
-
(2010)
Proceedings of 37st International Colloquium on Automata Languages and Programming LNCS
-
-
Krovi, H.1
Magniez, F.2
Ozols, M.3
Roland, J.4
-
13
-
-
0012590157
-
Classical and quantum computation
-
Am. Math. Soc., Providence
-
Kitaev, A.Yu., Shen, A.H., Vyalyi, M.N.: Classical and Quantum Computation. Graduate Studies in Mathematics, vol. 47. Am. Math. Soc., Providence (2002
-
(2002)
Graduate Studies in Mathematics
, vol.47
-
-
Kitaev, A.Yu.1
Shen, A.H.2
Vyalyi, M.N.3
-
14
-
-
34547326040
-
Quantum complexity of testing group commutativity
-
DOI 10.1007/s00453-007-0057-8
-
Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. Algorithmica 48(3), 221-232 (2007 (Pubitemid 47145791)
-
(2007)
Algorithmica (New York)
, vol.48
, Issue.3
, pp. 221-232
-
-
Magniez, F.1
Nayak, A.2
-
15
-
-
35548965589
-
Search via quantum walk
-
DOI 10.1145/1250790.1250874, STOC'07: Proceedings of the 39th Annual ACM Symposium on Theory of Computing
-
Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via quantum walk. In: Proceedings of the 39th ACM Symposium on Theory of Computing, pp. 575-584 (2007 (Pubitemid 350001037)
-
(2007)
Proceedings of the Annual ACM Symposium on Theory of Computing
, pp. 575-584
-
-
Magniez, F.1
Nayak, A.2
Roland, J.3
Santha, M.4
-
16
-
-
42549095580
-
Quantum algorithms for the triangle problem
-
Magniez, F., Santha, M., Szegedy, M.: Quantum algorithms for the triangle problem. SIAM J. Comput. 37(2), 611-629 (2007
-
(2007)
SIAM J. Comput.
, vol.37
, Issue.2
, pp. 611-629
-
-
Magniez, F.1
Santha, M.2
Szegedy, M.3
-
19
-
-
0037768972
-
A quantum random walk search algorithm
-
Shenvi, N., Kempe, J., Whaley, K.: A quantum random walk search algorithm. Phys. Rev. A 67, 052307 (2003
-
(2003)
Phys. Rev. A
, vol.67
, pp. 052307
-
-
Shenvi, N.1
Kempe, J.2
Whaley, K.3
-
21
-
-
47249161520
-
Faster quantum walk algorithm for the two dimensional spatial search
-
Tulsi, A.: Faster quantum walk algorithm for the two dimensional spatial search. Phys. Rev. A 78, 012310 (2008
-
(2008)
Phys. Rev. A
, vol.78
, pp. 012310
-
-
Tulsi, A.1
|