Lossy compression of statistical data using quantum annealer
arXiv:2110.02142 · doi:10.1038/s41598-022-07539-z
Abstract
We present a new lossy compression algorithm for statistical floating-point data through a representation learning with binary variables. The algorithm finds a set of basis vectors and their binary coefficients that precisely reconstruct the original data. The optimization for the basis vectors is performed classically, while binary coefficients are retrieved through both simulated and quantum annealing for comparison. A bias correction procedure is also presented to estimate and eliminate the error and bias introduced from the inexact reconstruction of the lossy compression for statistical data analyses. The compression algorithm is demonstrated on two different datasets of lattice quantum chromodynamics simulations. The results obtained using simulated annealing show 3.5 times better compression performance than the algorithms based on a neural-network autoencoder and principal component analysis. Calculations using quantum annealing also show promising results, but performance is limited by the integrated control error of the quantum processing unit, which yields large uncertainties in the biases and coupling parameters. Hardware comparison is further studied between the previous generation D-Wave 2000Q and the current D-Wave Advantage system. Our study shows that the Advantage system is more likely to obtain low-energy solutions for the problems than the 2000Q.
arXiv comment15 pages, 5 figures
References in corpus (19)
- Adam: A Method for Stochastic Optimization
- PyTorch: An Imperative Style, High-Performance Deep Learning Library
- Elementary gates for quantum computation
- Ising formulations of many NP problems
- Quantum Annealing in the Transverse Ising Model
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
- Adiabatic Quantum Computing
- Theory of Quantum Annealing of an Ising Spin Glass
- Quantum Annealing and Analog Quantum Computation
- Perspectives of quantum annealing: Methods and implementations
- Quantum autoencoders for efficient compression of quantum data
- Significantly Improving Lossy Compression for Scientific Data Sets Based on Multidimensional Prediction and Error-Controlled Quantization
- A case study in programming a quantum annealer for hard operational planning problems
- cuSZ: An Efficient GPU-Based Error-Bounded Lossy Compression Framework for Scientific Data
- Multivariable Optimization: Quantum Annealing & Computation
- Machine-Learning Prediction for Quasi-PDF Matrix Elements
- Image classification using quantum inference on the D-Wave 2X
- Machine Learning Estimators for Lattice QCD Observables
- A regression algorithm for accelerated lattice QCD that exploits sparse inference on the D-Wave quantum annealer