Quantum State Discrimination on Reconfigurable Noise-Robust Quantum Networks
arXiv:2003.11586 · doi:10.1103/PhysRevResearch.2.043011
Abstract
A fundamental problem in Quantum Information Processing is the discrimination amongst 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.
References in corpus (49)
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- A Quantum Random Walk Search Algorithm
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Dephasing assisted transport: Quantum networks and biomolecules
- Spatial search by quantum walk
- Highly efficient energy excitation transfer in light-harvesting complexes: The fundamental role of noise-assisted transport
- Universal quantum computation using the discrete time quantum walk
- Universal computation by multi-particle quantum walk
- Quantum State Discrimination
- Noise-assisted energy transfer in quantum networks and light-harvesting complexes
- Efficiency of energy transfer in a light-harvesting system under quantum coherence
- Decoherence in quantum walks - a review
- Entanglement and entangling power of the dynamics in light-harvesting complexes
- Designing Optimal Quantum Detectors Via Semidefinite Programming
- Quantum stochastic walks: A generalization of classical random walks and quantum walks
- Quantum Navigation and Ranking in Complex Networks
- Fast Escape from Quantum Mazes in Integrated Photonics
- Quantum walk as a generalized measuring device
- A Review on Quantum Search Algorithms
- QPSK coherent state discrimination via a hybrid receiver
- Experimental minimum-error quantum-state discrimination in high dimensions
- Observation of noise-assisted transport in an all-optical cavity-based network
- On the Optimality of Square Root Measurements in Quantum State Discrimination
- Robust Measurement for the Discrimination of Binary Coherent States
- Universally Optimal Noisy Quantum Walks on Complex Networks
- Optimal receiver for binary coherent signals
- Quantum walks on graphs representing the firing patterns of a quantum neural network
- Quantum Walks
- Dephasing-assisted transport in linear triple quantum dots
- Efficient simulation of sparse Markovian quantum dynamics
- Superdiffusive quantum stochastic walk definable of arbitrary directed graph
- Optimal universal learning machines for quantum state discrimination
- Optimal quantum state discrimination via nested binary measurements
- Optimal discrimination of single-qubit mixed states
- Implementation of generalized measurements on a qudit via quantum walks
- Optimal sequential measurements for bi-partite state discrimination
- Near optimal discrimination of binary coherent signals via atom-light interaction
- Steady states of continuous-time open quantum walks
- Optimal discrimination of optical coherent states cannot always be realized by interfering with coherent light, photon counting, and feedback
- Multiple-copy state discrimination of noisy qubits
- Tomography of a displacement photon counter for discrimination of single-rail optical qubits
- Naimark extension for the single-photon canonical phase measurement
- An effective iterative method to build the Naimark extension of rank-n POVMs
- Limit properties of global interaction stochastic quantum walks on directed graphs
- Properties of quantum stochastic walks from the asymptotic scaling exponent
- Rapid and Robust generation of Einstein--Podolsky--Rosen pairs with Spin Chains
Cited by in corpus (7)
- Quantum Reinforcement Learning: the Maze problem
- Machine learning classification of non-Markovian noise disturbing quantum dynamics
- Implementation of quantum stochastic walks for function approximation, two-dimensional data classification, and sequence classification
- State Classification via a Random-Walk-Based Quantum Neural Network
- Recurrence in discrete-time quantum stochastic walks
- Quantum hypothesis testing via robust quantum control
- Perturbed graphs achieve unit transport efficiency without environmental noise