Quantum state discrimination on reconfigurable noise-robust quantum networks

Abstract

A fundamental problem in quantum information processing is the discrimination among a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by a quantum stochastic walk. In particular, the structure of the graph mimics those of neural networks, with the quantum states to discriminate encoded on input nodes and with the discrimination obtained on the output nodes. We optimize the parameters of the network to obtain the highest probability of correct discrimination. Numerical simulations show that after a transient time the probability of correct decision approaches the theoretical optimal quantum limit. These results are confirmed analytically for small graphs. Finally, we analyze the robustness and reconfigurability of the network for different set of quantum states and show that this architecture can pave the way to experimental realizations of our protocol as well as novel quantum generalizations of deep learning.