Information compression via hidden subgroup quantum autoencoders

Abstract

We design a quantum method for classical information compression that exploits the hidden subgroup quantum algorithm. We consider sequence data in a database with a priori unknown symmetries of the hidden subgroup type. We prove that data with a given group structure can be compressed with the same query complexity as the hidden subgroup problem, which is exponentially faster than the best known classical algorithms. We moreover design a quantum algorithm that variationally finds the group structure and uses it to compress the data. There is an encoder and a decoder, along the paradigm of quantum autoencoders. After the training, the encoder outputs a compressed data string and a description of the hidden subgroup symmetry, from which the input data can be recovered by the decoder. In illustrative examples, our algorithm outperforms the classical autoencoder on the mean squared value of test data. This classical-quantum separation in information compression capability has thermodynamical significance: the free energy assigned by a quantum agent to a system can be much higher than that of a classical agent. Taken together, our results show that a possible application of quantum computers is to efficiently compress certain types of data that cannot be efficiently compressed by current methods using classical computers.

References in corpus (21)

• Quantum Machine Learning
• An Introduction to Variational Autoencoders
• Barren plateaus in quantum neural network training landscapes
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Enhancing the charging power of quantum batteries
• Quantum autoencoders for efficient compression of quantum data
• Breaking Symmetric Cryptosystems using Quantum Period Finding
• Architectures for a quantum random access memory
• Quantum generalisation of feedforward neural networks
• The work value of information
• The quantum query complexity of the hidden subgroup problem is polynomial
• Quantum factoring, discrete logarithms and the hidden subgroup problem
• Quantum autoencoders to denoise quantum data
• Experimental Realization of a Quantum Autoencoder: The Compression of Qutrits via Machine Learning
• Realization of a quantum autoencoder for lossless compression of quantum data
• Noise-Assisted Quantum Autoencoder
• Experimental Implementation of a Quantum Autoencoder via Quantum Adders
• The nonequilibrium cost of accurate information processing
• Symmetries, graph properties, and quantum speedups
• Preserving Entanglement in a Solid-Spin System Using Quantum Autoencoders
• Deterministic Algorithms for the Hidden Subgroup Problem

Cited by in corpus (2)

• Rigorous noise reduction with quantum autoencoders
• Disentangling quantum autoencoder