Identifying network topologies via quantum walk distributions
arXiv:2301.13842 · doi:10.1116/5.0190168
Abstract
Control and characterization of networks is a paramount step for the development of many quantum technologies. Even for moderate-sized networks, this amounts to explore an extremely vast parameters 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. Our result shows that the algorithm is capable of efficiently retrieving the required information even in the presence of noise.
References in corpus (18)
- The Quantum Internet
- Silica-on-Silicon Waveguide Quantum Circuits
- Dephasing assisted transport: Quantum networks and biomolecules
- Exponential algorithmic speedup by quantum walk
- Quantum Walk in Position Space with Single Optically Trapped Atoms
- Perfect Transfer of Arbitrary States in Quantum Spin Networks
- Quantum Communication through Spin Chain Dynamics: an Introductory Overview
- Analysis of a large-scale weighted network of one-to-one human communication
- Tweezer-programmable 2D quantum walks in a Hubbard-regime lattice
- Characterization of qubit chains by Feynman probes
- On the optimality of spatial search by continuous-time quantum walk
- Robustness of Noisy Quantum Networks
- Continuous-time quantum walks on dynamical percolation graphs
- Quantum spatial search in two-dimensional waveguide arrays
- Multi-parameter quantum metrology with discrete-time quantum walks
- Feedback-assisted quantum search by continuous-time quantum walks
- Transport efficiency of continuous-time quantum walks on graphs
- Multiparameter estimation of continuous-time Quantum Walk Hamiltonians through Machine Learning