اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدStorage capacity and learning capability of quantum neural networks
64
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the storage capacity of quantum neural networks (QNNs) described as completely positive trace preserving (CPTP) maps, which act on an $N$-dimensional Hilbert space. We demonstrate that QNNs can store up to $N$ linearly independent pure states and provide the structure of the corresponding maps. While the storage capacity of a classical Hopfield network scales linearly with the number of neurons, we show that QNNs can store an exponential number of linearly independent states. We estimate, employing the Gardner program, the relative volume of CPTP maps with $M$ stationary states. The volume decreases exponentially with $M$ and shrinks to zero for $Mgeq N+1$. We generalize our results to QNNs storing mixed states as well as input-output relations for feed-forward QNNs. Our approach opens the path to relate storage properties of QNNs to the quantum properties of the input-output states. This paper is dedicated to the memory of Peter Wittek.
قيم البحث
اقرأ أيضاً
We study the storage of multiple phase-coded patterns as stable dynamical attractors in recurrent neural networks with sparse connectivity. To determine the synaptic strength of existent connections and store the phase-coded patterns, we introduce a
learning rule inspired to the spike-timing dependent plasticity (STDP). We find that, after learning, the spontaneous dynamics of the network replay one of the stored dynamical patterns, depending on the network initialization. We study the network capacity as a function of topology, and find that a small- world-like topology may be optimal, as a compromise between the high wiring cost of long range connections and the capacity increase.
Bipartite operations underpin both classical communication and entanglement generation. Using a superposition of classical messages, we show that the capacity of a two-qubit operation for error-free entanglement-assisted bidirectional classical commu
nication can not exceed twice the entanglement capability. In addition we show that any bipartite two-qubit operation can increase the communication that may be performed using an ensemble by twice the entanglement capability.
Reinforcement learning with neural networks (RLNN) has recently demonstrated great promise for many problems, including some problems in quantum information theory. In this work, we apply RLNN to quantum hypothesis testing and determine the optimal m
easurement strategy for distinguishing between multiple quantum states ${ rho_{j} }$ while minimizing the error probability. In the case where the candidate states correspond to a quantum system with many qubit subsystems, implementing the optimal measurement on the entire system is experimentally infeasible. In this work, we focus on using RLNN to find locally-adaptive measurement strategies that are experimentally feasible, where only one quantum subsystem is measured in each round. We provide numerical results which demonstrate that RLNN successfully finds the optimal local approach, even for candidate states up to 20 subsystems. We additionally introduce a min-entropy based locally adaptive protocol, and demonstrate that the RLNN strategy meets or exceeds the min-entropy success probability in each random trial. While the use of RLNN is highly successful for designing adaptive local measurement strategies, we find that there can be a significant gap between success probability of any locally-adaptive measurement strategy and the optimal collective measurement. As evidence of this, we exhibit a collection of pure tensor product quantum states which cannot be optimally distinguished by any locally-adaptive strategy. This counterexample raises interesting new questions about the gap between theoretically optimal measurement strategies and practically implementable measurement strategies.
We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed quantum syste
ms over a quantum network. Along with this general class of ansatze, we introduce further specialized architectures, namely, Quantum Graph Recurrent Neural Networks (QGRNN) and Quantum Graph Convolutional Neural Networks (QGCNN). We provide four example applications of QGNNs: learning Hamiltonian dynamics of quantum systems, learning how to create multipartite entanglement in a quantum network, unsupervised learning for spectral clustering, and supervised learning for graph isomorphism classification.
Quantum machine learning promises great speedups over classical algorithms, but it often requires repeated computations to achieve a desired level of accuracy for its point estimates. Bayesian learning focuses more on sampling from posterior distribu
tions than on point estimation, thus it might be more forgiving in the face of additional quantum noise. We propose a quantum algorithm for Bayesian neural network inference, drawing on recent advances in quantum deep learning, and simulate its empirical performance on several tasks. We find that already for small numbers of qubits, our algorithm approximates the true posterior well, while it does not require any repeated computations and thus fully realizes the quantum speedups.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
