Papers
Topics
Authors
Recent
Search
2000 character limit reached

Quantum Compressed Sensing with Unsupervised Tensor-Network Machine Learning

Published 24 Jul 2019 in stat.ML, cond-mat.str-el, cs.LG, and quant-ph | (1907.10290v2)

Abstract: We propose tensor-network compressed sensing (TNCS) by combining the ideas of compressed sensing, tensor network (TN), and machine learning, which permits novel and efficient quantum communications of realistic data. The strategy is to use the unsupervised TN machine learning algorithm to obtain the entangled state $|\Psi \rangle$ that describes the probability distribution of a huge amount of classical information considered to be communicated. To transfer a specific piece of information with $|\Psi \rangle$, our proposal is to encode such information in the separable state with the minimal distance to the measured state $|\Phi \rangle$ that is obtained by partially measuring on $|\Psi \rangle$ in a designed way. To this end, a measuring protocol analogous to the compressed sensing with neural-network machine learning is suggested, where the measurements are designed to minimize uncertainty of information from the probability distribution given by $|\Phi \rangle$. In this way, those who have $|\Phi \rangle$ can reliably access the information by simply measuring on $|\Phi \rangle$. We propose q-sparsity to characterize the sparsity of quantum states and the efficiency of the quantum communications by TNCS. The high q-sparsity is essentially due to the fact that the TN states describing nicely the probability distribution obey the area law of entanglement entropy. Testing on realistic datasets (hand-written digits and fashion images), TNCS is shown to possess high efficiency and accuracy, where the security of communications is guaranteed by the fundamental quantum principles.

Citations (5)

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.