Control and characterization of networks are paramount steps in the development of many quantum technologies. Even for moderate-sized networks, this amounts to exploring an extremely vast parameter space in search for the couplings defining the network topology. Here, we explore the use of a genetic algorithm to retrieve the topology of a network from the measured probability distribution obtained from the evolution of a continuous-time quantum walk on the network. We show that we can successfully retrieve the topology of different networks with efficiencies above 70% in all the examined scenarios and that the algorithm is capable of efficiently retrieving the required information even in the presence of noise.

1.
S.
Wasserman
and
K.
Faust
,
Social Network Analysis: Methods and Applications
(
Cambridge University Press
,
1994
).
2.
J.-P.
Onnela
,
J.
Saramäki
,
J.
Hyvönen
,
G.
Szabó
,
M. A.
de Menezes
,
K.
Kaski
,
A.-L.
Barabási
, and
J.
Kertész
,
New J. Phys.
9
,
179
(
2007
).
3.
H.
Jeong
,
B.
Tombor
,
R.
Albert
,
Z. N.
Oltvai
, and
A. L.
Barabási
,
Nature
407
,
651
(
2000
).
4.
R.
Pastor-Satorras
and
A.
Vespignani
,
Phys. Rev. Lett.
86
,
3200
(
2001
).
5.
S.
Maslov
and
K.
Sneppen
,
Science
296
,
910
(
2002
).
6.
E.
de Silva
and
M.
Stumpf
,
J. R. Soc. Interface
2
,
419
(
2005
).
7.
M. B.
Plenio
and
S. F.
Huelga
,
New J. Phys.
10
,
113019
(
2008
).
8.
W.
Winterbach
,
P. V.
Mieghem
,
M.
Reinders
,
H.
Wang
, and
D. D.
Ridder
,
BMC Syst. Biol.
7
,
90
(
2013
).
9.
L.
De Keer
,
K. I.
Kilic
,
P. H. M.
Van Steenberge
,
L.
Daelemans
,
D.
Kodura
,
H.
Frisch
,
K.
De Clerck
,
M.-F.
Reyniers
,
C.
Barner-Kowollik
et al,
Nat. Mater.
20
,
1422
(
2021
).
10.
M.
Faloutsos
,
P.
Faloutsos
, and
C.
Faloutsos
, “
On power-law relationships of the internet topology
,” in
ACM SIGCOMM 99'
(
Association for Computing Machinery
,
New York
,
1999
), pp.
251
262
.
11.
G.
Caldarelli
,
R.
Marchetti
, and
L.
Pietronero
,
Europhys. Lett.
52
,
386
(
2000
).
12.
R.
Pastor-Satorras
,
A.
Vázquez
, and
A.
Vespignani
, “
Topology, hierarchy, and correlations in internet graphs
,” in
Complex Networks
(
Springer
,
Berlin/Heidelberg
,
2004
), pp.
425
440
.
13.
Y.
He
,
G.
Siganos
, and
M.
Faloutsos
, “
Internet topology
,” in
Encyclopedia of Complexity and Systems Science
(
Springer
,
New York
,
2009
), pp.
4930
4947
.
14.
J. I.
Cirac
,
P.
Zoller
,
H. J.
Kimble
, and
H.
Mabuchi
,
Phys. Rev. Lett.
78
,
3221
(
1997
).
15.
T.
Chanelière
,
D. N.
Matsukevich
,
S. D.
Jenkins
,
S. Y.
Lan
,
T. A. B.
Kennedy
, and
A.
Kuzmich
,
Nature
438
,
833
(
2005
).
16.
O.
Mülken
,
M.
Dolgushev
, and
M.
Galiceanu
,
Phys. Rev. E
93
,
022304
(
2016
).
18.
J.
Nokkala
,
F.
Galve
,
R.
Zambrini
,
S.
Maniscalco
, and
J.
Piilo
,
Sci. Rep.
6
,
26861
(
2016
).
19.
D.
Deutsch
,
Proc. R. Soc. London, Ser. A
425
,
73
(
1989
).
20.
M.
Christandl
,
N.
Datta
,
T. C.
Dorlas
,
A.
Ekert
,
A.
Kay
, and
A. J.
Landahl
,
Phys. Rev. A
71
,
032312
(
2005
).
22.
A.
Politi
,
M. J.
Cryan
,
J. G.
Rarity
,
S.
Yu
, and
J. L.
O'Brien
,
Science
320
,
646
(
2008
).
23.
A.
Aspuru-Guzik
and
P.
Walther
,
Nat. Phys.
8
,
285
(
2012
).
24.
E.
Farhi
and
S.
Gutmann
,
Phys. Rev. A
58
,
915
(
1998
).
25.
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 Thirty-Fifth Annual ACM Symposium on Theory of Computing (STOC '03)
(
Association for Computing Machinery
,
New York
,
2003
), pp.
59
68
.
26.
V.
Kendon
,
Int. J. Quantum Inf.
4
,
791
(
2006
).
27.
28.
O.
Mülken
and
A.
Blumen
,
Phys. Rep.
502
,
37
(
2011
).
29.
C.
Benedetti
,
M. A. C.
Rossi
, and
M. G. A.
Paris
,
Europhys. Lett.
124
,
60001
(
2019
).
30.
S.
Chakraborty
,
L.
Novo
, and
J.
Roland
,
Phys. Rev. A
102
,
032214
(
2020
).
31.
V.
Gualtieri
,
C.
Benedetti
, and
M. G. A.
Paris
,
Phys. Rev. A
102
,
012201
(
2020
).
32.
K.
Kadian
,
S.
Garhwal
, and
A.
Kumar
,
Comput. Sci. Rev.
41
,
100419
(
2021
).
33.
G.
Bressanini
,
C.
Benedetti
, and
M. G. A.
Paris
,
Quantum Inf. Proc.
21
,
317
(
2022
).
34.
L.
Razzoli
,
M. G. A.
Paris
, and
P.
Bordone
,
Entropy
23
,
85
(
2021
).
35.
I.
Gianani
and
C.
Benedetti
,
AVS Quantum Sci.
5
,
014405
(
2023
).
36.
D.
Tamascelli
,
C.
Benedetti
,
S.
Olivares
, and
M. G. A.
Paris
,
Phys. Rev. A
94
,
042129
(
2016
).
37.
L.
Seveso
,
C.
Benedetti
, and
M. G. A.
Paris
,
J. Phys. A
52
,
105304
(
2019
).
38.
M.
Annabestani
,
M.
Hassani
,
D.
Tamascelli
, and
M. G. A.
Paris
,
Phys. Rev. A
105
,
062411
(
2022
).
39.
K.
Rambhatla
,
S. E.
D'Aurelio
,
M.
Valeri
,
E.
Polino
,
N.
Spagnolo
, and
F.
Sciarrino
,
Phys. Rev. Res.
2
,
033078
(
2020
).
40.
41.
R.
Nichols
,
L.
Mineh
,
J.
Rubio
,
J. C. F.
Matthews
, and
P. A.
Knott
,
Quantum Sci. Technol.
4
,
045012
(
2019
).
43.
M.
Mitchell
,
An Introduction to Genetic Algorithms
(
The MIT Press
,
1998
).
44.
S.
Katoch
,
S.
Chauhan
, and
V.
Kumar
,
Multimedia Tools Appl.
80
,
8091
(
2021
).
45.
D. E.
Knuth
,
The Stanford GraphBase: A Platform for Combinatorial Computing
(
ACM Press
,
New York
,
1993
), pp.
74
87
.
46.
V.
Hugo
,
Les Miserables
(
Verboeckhoven & Company
,
1862
).
47.
R.
Koch
,
S.
Kühl
,
R. M.
Morais
,
B.
Spinnler
,
W.
Schairer
,
B.
Sommernkorn-Krombholz
, and
S.
Pachnicke
,
J. Lightwave Technol.
40
,
567
(
2022
).
48.
H.-J.
Briegel
,
W.
Dür
,
J. I.
Cirac
, and
P.
Zoller
,
Phys. Rev. Lett.
81
,
5932
(
1998
).
50.
S.
Perseguers
,
M.
Lewenstein
,
A.
Acín
, and
J. I.
Cirac
,
Nat. Phys.
6
,
539
(
2010
).
51.
C.
Benedetti
,
D.
Tamascelli
,
M. G.
Paris
, and
A.
Crespi
,
Phys. Rev. Appl.
16
,
054036
(
2021
).
52.
B. C.
Coutinho
,
W. J.
Munro
,
K.
Nemoto
, and
Y.
Omar
,
Commun. Phys.
5
,
105
(
2022
).
53.
A.
Candeloro
,
C.
Benedetti
,
M. G.
Genoni
, and
M. G. A.
Paris
,
Adv. Quantum Technol.
6
,
2200093
(
2023
).
54.
M.
Karski
,
L.
Förster
,
J. M.
Choi
,
A.
Steffen
,
W.
Alt
,
D.
Meschede
, and
A.
Widera
,
Science
325
,
174
(
2009
).
55.
P.
Imany
,
N. B.
Lingaraju
,
M. S.
Alshaykh
,
D. E.
Leaird
, and
A. M.
Weiner
,
Sci. Adv.
6
,
eaba8066
(
2020
).
56.
A. W.
Young
,
W. J.
Eckner
,
N.
Schine
,
A. M.
Childs
, and
A. M.
Kaufman
,
Science
377
,
885
(
2022
).

Supplementary Material

You do not currently have access to this content.