Topology identification of autonomous quantum dynamical networks

Abstract

Topology identification comprises reconstructing the interaction Hamiltonian of a quantum network by properly processing measurements of its density operator within a fixed time interval. It finds application in several quantum technology contexts, ranging from quantum communication to quantum computing or sensing. In this paper, we provide analytical conditions for the solvability of the topology identification problem for autonomous quantum dynamical networks. The solvability condition is then converted in an algorithm for quantum network reconstruction that is easily implementable on standard computer facilities. The obtained algorithm is tested for Hamiltonian reconstruction on numerical examples based on the quantum walks formalism.

12 pages, 2 figures; v2: misprints corrected and presentation of the results improved with respect to v1

References in corpus (7)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Spectral signatures of many-body localization with interacting photons
• Modeling and Control of Quantum Systems: An Introduction
• Hamiltonian identifiability assisted by single-probe measurement
• Scalable reconstruction of unitary processes and Hamiltonians
• One-way quantum computing in a decoherence-free subspace
• Gradient-based reconstruction of molecular Hamiltonians and density matrices from time-dependent quantum observables