Fetching the paper…
Reading the bibliography…
Quantum walks are at the heart of modern quantum technologies.
N. Masuda, M. A. Porter, and R. Lambiotte, “Random walks and diffusion on networks,” Phys. Rep
1901
Earlier work this paper cites.
M. Kac, “Random walk and the theory of Brownian motion,” Am. Math. Mon
1947
Earlier work this paper cites.
G. F. Lawler, “Expected hitting times for a random walk on a connected graph,” Discrete Math
1986
Earlier work this paper cites.
Y. Aharonov, L. Davidovich, and N. Zagury, “Quantum random walks,” Phys. Rev. A
1993
Earlier work this paper cites.
New York, USA: Cambridge University Press, 1995
R. Motwani and P. Raghavan, Randomized Algorithms · 1995
Earlier work this paper cites.
L. Lovász, “Random walks on graphs: A survey,” in Combinatorics: Paul Erdõs is Eighty, Bolyai Soc. Math. Stud
1996
Earlier work this paper cites.
S. Lawrence, C. L. Giles, A. C. Tsoi, and A. D. Back, “Face recognition: a convolutional neural-network approach,” IEEE Transactions on Neural Networks
1997
Earlier work this paper cites.
Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradient-based learning applied to document recognition,” Proceedings of the IEEE
1998
Earlier work this paper cites.
F. Wang and D. P. Landau, “Efficient, multiple-range random walk algorithm to calculate the density of states,” Phys. Rev. Lett
2001
Earlier work this paper cites.
T. Sottinen, “Fractional Brownian motion, random walks and binary market models,” Financ. Stoch
2001
Earlier work this paper cites.
A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous, “One-dimensional quantum walks,” in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing
2001
Earlier work this paper cites.
D. Aharonov, A. Ambainis, J. Kempe, and U. Vazirani, “Quantum walks on graphs,” in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing
2001
Earlier work this paper cites.
M. Szummer and T. Jaakkola, “Partially labeled classification with Markov random walks,” in Adv. Neural. Inf. Process. Syst
2002
Earlier work this paper cites.
J. Kempe, “Quantum random walks: An introductory overview,” Contemp. Phys
2003
Earlier work this paper cites.
A. Ambainis, “Quantum walks and their algorithmic applications,” Int. J. Quantum Inf
2003
Earlier work this paper cites.
A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, “Exponential algorithmic speedup by a quantum walk,” in Proceedings of the 35th Annual ACM Symposium on Theory of Computing
2003
Earlier work this paper cites.
P. Y. Simard, D. Steinkraus, and J. C. Platt, “Best practices for convolutional neural networks applied to visual document analysis,” in Proceedings of the 7th International Conference on Document Analysis and Recognition
2003
Earlier work this paper cites.
F. Bartumeus, M. G. E. da Luz, G. M. Viswanathan, and J. Catalan, “Animal search strategies: A quantitative random-walk analysis,” Ecology
2005
Earlier work this paper cites.
J. Kempe, “Discrete quantum walks hit exponentially faster,” Probab. Theory Relat. Fields
2005
Earlier work this paper cites.
L. Grady, “Random walks for image segmentation,” IEEE Trans. Pattern Anal. Mach. Intell
2006
Earlier work this paper cites.
C. Gkantsidis, M. Mihail, and A. Saberi, “Random walks in peer-to-peer networks: Algorithms and evaluation,” Perform. Eval
2006
Earlier work this paper cites.
D. Brockmann, L. Hufnagel, and T. Geisel, “The scaling laws of human travel,” Nature
2006
Earlier work this paper cites.
D. Solenov and L. Fedichkin, “Continuous-time quantum walks on a cycle graph,” Phys. Rev. A
2006
Earlier work this paper cites.
L. Fedichkin, D. Solenov, and C. Tamon, “Mixing and decoherence in continuous-time quantum walks on cycles,” Quantum Inf. Comput
2006
Earlier work this paper cites.
H. Krovi and T. A. Brun, “Hitting time for quantum walks on the hypercube,” Phys. Rev. A
2006
Earlier work this paper cites.
A. Ambainis, “Quantum walk algorithm for element distinctness,” SIAM J. Comput
2007
Earlier work this paper cites.
G. S. Engel, T. R. Calhoun, E. L. Read, T.-K. Ahn, T. Mančal, Y.-C. Cheng, R. E. Blankenship, and G. R. Fleming, “Evidence for wavelike energy transfer through quantum coherence in photosynthetic systems,” Nature
2007
Cited alongside, same era.
E. A. Codling, M. J. Plank, and S. Benhamou, “Random walk models in biology,” J. Royal Soc. Interface
2008
Cited alongside, same era.
Morgan & Claypool Publishers, 2008
S. E. Venegas-Andraca, Quantum walks for computer scientists · 2008
Cited alongside, same era.
M. Mohseni, P. Rebentrost, S. Lloyd, and A. Aspuru-Guzik, “Environment-assisted quantum walks in photosynthetic energy transfer,” J. Chem. Phys
2008
Cited alongside, same era.
A. M. Childs, “Universal computation by quantum walk,” Phys. Rev. Lett
2009
Cited alongside, same era.
S. Chakraborty, L. Novo, A. Ambainis, and Y. Omar, “Spatial search by quantum walk is optimal for almost all graphs,” Phys. Rev. Lett
2016
Later among the works it cites.
A. Makmal, M. Tiersch, C. Ganahl, and H. J. Briegel, “Quantum walks on embedded hypercubes: Nonsymmetric and nonlocal cases,” Phys. Rev. A
2016
Later among the works it cites.
K. Kechedzhi and V. N. Smelyanskiy, “Open-system quantum annealing in mean-field models with exponential degeneracy,” Phys. Rev. X
2016
Later among the works it cites.
J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, “Quantum machine learning,” Nature
2017
Later among the works it cites.
G. Carleo and M. Troyer, “Solving the quantum many-body problem with artificial neural networks,” Science
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Santos and R. Portugal, “Quantum hitting time on the complete graph,” Int. J. Quantum Inf
2010
Cited alongside, same era.
F. Magniez, A. Nayak, J. Roland, and M. Santha, “Search via quantum walk,” SIAM J. Comput
2011
Cited alongside, same era.
T. Scholak, F. de Melo, T. Wellens, F. Mintert, and A. Buchleitner, “Efficient and coherent excitation transfer across disordered molecular networks,” Phys. Rev. E
2011
Cited alongside, same era.
S. E. Venegas-Andraca, “Quantum walks: a comprehensive review,” Quantum Inf. Process
2012
Cited alongside, same era.
H. J. Briegel and G. De las Cuevas, “Projective simulation for artificial intelligence,” Sci. Rep
2012
Cited alongside, same era.
D. Manzano, M. Tiersch, A. Asadian, and H. J. Briegel, “Quantum transport efficiency and Fourier’s law,” Phys. Rev. E
2012
Cited alongside, same era.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Adv. Neural Inf. Process. Syst
2012
Cited alongside, same era.
J. Carrasquilla and R. G. Melko, “Machine learning phases of matter,” Nat. Phys
2017
Later among the works it cites.
K. Ch’ng, J. Carrasquilla, R. G. Melko, and E. Khatami, “Machine learning phases of strongly correlated fermions,” Phys. Rev. X
2017
Later among the works it cites.
J. Kawahara, C. J. Brown, S. P. Miller, B. G. Booth, V. Chau, R. E. Grunau, J. G. Zwicker, and G. Hamarneh, “BrainNetCNN: Convolutional neural networks for brain networks; towards predicting neurodevelopment,” NeuroImage
2017
Later among the works it cites.
M. E. Lebedev, D. A. Dolinina, K.-B. Hong, T.-C. Lu, A. V. Kavokin, and A. P. Alodjants, “Exciton-polariton josephson junctions at finite temperatures,” Sci. Rep
2017
Later among the works it cites.
T. Grass and M. Lewenstein, “Hybrid annealing using a quantum simulator coupled to a classical computer,” Phys. Rev. A
2017
Later among the works it cites.
V. Dunjko, Y. Ge, and J. I. Cirac, “Computational speedups using small quantum devices,” Phys. Rev. Lett
2018
Later among the works it cites.
S. Boixo, S. V. Isakov, V. N. Smelyanskiy, R. Babbush, N. Ding, M. B. Zhang Jiang, J. Martinis, and H. Neven, “Characterizing quantum supremacy in near-term devices,” Nat. Phys
2018
Later among the works it cites.
V. Dunjko and H. J. Briegel, “Machine learning & artificial intelligence in the quantum domain: a review of recent progress,” Rep. Prog. Phys
2018
Later among the works it cites.
A. A. Melnikov, H. Poulsen Nautrup, M. Krenn, V. Dunjko, M. Tiersch, A. Zeilinger, and H. J. Briegel, “Active learning machine learns to create new quantum experiments,” Proc. Natl. Acad. Sci. U.S.A
2018
Later among the works it cites.
M. Bukov, A. G. R. Day, D. Sels, P. Weinberg, A. Polkovnikov, and P. Mehta, “Reinforcement learning in different phases of quantum control,” Phys. Rev. X
2018
Later among the works it cites.
T. Fösel, P. Tighineanu, T. Weiss, and F. Marquardt, “Reinforcement learning with neural networks for quantum feedback,” Phys. Rev. X
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
2018
Later among the works it cites.
F. Flamini, N. Spagnolo, and F. Sciarrino, “Photonic quantum information processing: a review,” Rep. Prog. Phys
2018
Later among the works it cites.
M. Gräfe, R. Heilmann, M. Lebugle, D. Guzman-Silva, A. Perez-Leija, and A. Szameit, “Integrated photonic quantum walks,” J. Opt
2018
Later among the works it cites.
X. Qiang, X. Zhou, J. Wang, C. Wilkes, T. Loke, S. O’Gara, L. Kling, G. D. Marshall, R. Santagati, T. C. Ralph, J. B. Wang, a. M. G. T. J. L. O’Brien, and J. C. F. Matthews, “Large-scale silicon quantum photonics implementing arbitrary two-qubit processing,” Nat. Photonics
2018
Later among the works it cites.
T. Albash and D. A. Lidar, “Adiabatic quantum computing,” Rev. Mod. Phys
2018
Later among the works it cites.
L. O’Driscoll, R. Nichols, and P. A. Knott, “A hybrid machine learning algorithm for designing quantum experiments,” Quantum Mach. Intell
2019
Closest in time.