Dorit Aharonov, Andris Ambainis, Julia Kempe & Umesh Vazirani (2001):
Quantum walks on graphs.
In: Proceedings of the thirty-third annual ACM symposium on Theory of computing,
pp. 50–59.
Available at https://doi.org/10.1145/380752.380758.
Andris Ambainis (2007):
Quantum walk algorithm for element distinctness.
SIAM Journal on Computing 37(1),
pp. 210–239.
Available at https://doi.org/10.1137/S0097539705447311.
Quentin Aristote, Nathanaël Eon & Giuseppe Di Molfetta (2020):
Dynamical Triangulation Induced by Quantum Walk.
Symmetry 12(1),
pp. 128.
Available at https://doi.org/10.3390/sym12010128.
Pablo Arrighi, Giuseppe Di Molfetta, Iván Márquez-Martín & Armando Pérez (2019):
From curved spacetime to spacetime-dependent local unitaries over the honeycomb and triangular Quantum Walks.
Scientific reports 9(1),
pp. 1–10.
Available at https://doi.org/10.1038/s41598-019-47535-4.
A.-L. Barabási & R. Albert (1999):
Emergence of scaling in random networks.
Science 286,
pp. 509–512,
doi:10.1126/science.286.5439.509.
Scott D Berry & Jingbo B Wang (2011):
Two-particle quantum walks: Entanglement and graph isomorphism testing.
Physical Review A 83(4),
pp. 042317.
Available at https://doi.org/10.1103/PhysRevA.83.042317.
Sergey Bravyi & Barbara Terhal (2010):
Complexity of stoquastic frustration-free Hamiltonians.
Siam journal on computing 39(4),
pp. 1462–1485.
Available at https://doi.org/10.1137/08072689X.
Andrew M Childs & Jeffrey Goldstone (2004):
Spatial search by quantum walk.
Physical Review A 70(2),
pp. 022314.
Available at https://doi.org/10.1103/PhysRevA.70.022314.
Giuseppe Di Molfetta & Pablo Arrighi (2020):
A quantum walk with both a continuous-time limit and a continuous-spacetime limit.
Quantum Information Processing 19(2),
pp. 47.
Available at https://doi.org/10.1007/s11128-019-2549-2.
Paul Erdős & Alfréd Rényi (1960):
On the evolution of random graphs.
Publ. Math. Inst. Hung. Acad. Sci 5(1),
pp. 17–60.
Gian Carlo Ghirardi, Alberto Rimini & Tullio Weber (1986):
Unified dynamics for microscopic and macroscopic systems.
Physical review D 34(2),
pp. 470.
Available at https://doi.org/10.1103/PhysRevD.34.470.
Nicholas Metropolis & Stanislaw Ulam (1949):
The monte carlo method.
Journal of the American statistical association 44(247),
pp. 335–341,
doi:10.1080/01621459.1949.10483310.
Filippo M. Miatto (2020):
quantumgraphs.
https://github.com/ziofil/QuantumGraphs.
Cornelis J Stam & Jaap C Reijneveld (2007):
Graph theoretical analysis of complex networks in the brain.
Nonlinear biomedical physics 1(1),
pp. 3.
Available at https://doi.org/10.1186/1753-4631-1-3.
Steven H Strogatz (2001):
Exploring complex networks.
nature 410(6825),
pp. 268–276.
Available at https://doi.org/10.1038/35065725.
Michele Tumminello, Fabrizio Lillo, Jyrki Piilo & Rosario N Mantegna (2012):
Identification of clusters of investors from their real trading activity in a financial market.
New Journal of Physics 14(1),
pp. 013041.
Available at https://doi.org/10.1088/1367-2630/14/1/013041.
Alexei Vázquez, Alessandro Flammini, Amos Maritan & Alessandro Vespignani (2003):
Modeling of protein interaction networks.
Complexus 1(1),
pp. 38–44.
Available at https://doi.org/10.1159/000067642.
Chrysoula Vlachou, J Rodrigues, Paulo Mateus, N Paunkovi\'c & André Souto (2015):
Quantum walk public-key cryptographic system.
International Journal of Quantum Information 13(07),
pp. 1550050.
Available at https://doi.org/10.1142/S0219749915500501.
Xiao Fan Wang & Guanrong Chen (2003):
Complex networks: small-world, scale-free and beyond.
IEEE circuits and systems magazine 3(1),
pp. 6–20.
Available at https://doi.org/10.1109/MCAS.2003.1228503.
Duncan J. Watts & Steven H. Strogatz (1998):
Collective dynamics of ‘small-world’ networks.
Nature 393,
pp. 440–442.
Available at https://doi.org/10.1038/30918.
eptcs@eptcs.org