Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction

DOI10.1007/S00607-023-01154-0MaRDI QIDQ6114596zbMATH OpenOpenAlexFDO

Authors Maryam Bagherian, Sarah Chehade, Ben Whitney, Ali Passian

Publication date 12 July 2023

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00607-023-01154-0

zbMATH Keywords

classical compressiondimensionality reductionedge computingquantum compression

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Quantum algorithms and complexity in the theory of computing (68Q12) Computational aspects of data analysis and big data (68T09)

Recommendations

• Quantum data compression by principal component analysis
• Stochastic Algorithms: Foundations and Applications
• New limits to classical and quantum instance compression
• Quantum point cloud and its compression
• Efficient and exact quantum compression
• On Lossless Quantum Data Compression With a Classical Helper
• Efficient quantum information processing via quantum compressions
• Lossless quantum data compression and quantum Kolmogorov complexity
• Compact data encoding for data re-uploading quantum classifier
• scientific article; zbMATH DE number 2132451

Cites work

• A Mathematical Theory of Communication
• A New Proof of the Quantum Noiseless Coding Theorem
• Demonstration of Blind Quantum Computing
• Discrete Cosine Transform
• Discrete Mehler-Fock transforms
• Efficient distributed quantum computing
• Energy-Efficient Spectral Analysis Method Using Autoregressive Model-Based Approach for Internet of Things
• Enhancement of curve-fitting image compression using hyperbolic function
• Fast gapped variants for Lempel-Ziv-Welch compression
• General Mixed-State Quantum Data Compression With and Without Entanglement Assistance
• scientific article; zbMATH DE number 2243374 (Why is no real title available?)
• On the NP-hardness of edge-deletion and -contraction problems
• On the relationships between SVD, KLT and PCA
• One-Shot Classical Data Compression With Quantum Side Information and the Distillation of Common Randomness or Secret Keys
• One-Shot Lossy Quantum Data Compression
• Quantum advantage with shallow circuits
• Quantum cryptography
• Quantum data compression by principal component analysis
• Quantum information theory
• Scientific Data Mining
• Tensor Decompositions and Applications
• Trading quantum for classical resources in quantum data compression

This page was built for publication: Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6114596)