Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction
From MaRDI portal
Publication:6114596
DOI10.1007/s00607-023-01154-0zbMath1523.68087OpenAlexW4317705295MaRDI QIDQ6114596
Maryam Bagherian, Sarah Chehade, Ali Passian, Ben Whitney
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
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)
Cites Work
- Unnamed Item
- A Mathematical Theory of Communication
- Tensor Decompositions and Applications
- On the relationships between SVD, KLT and PCA
- On the NP-hardness of edge-deletion and -contraction problems
- Quantum data compression by principal component analysis
- Enhancement of curve-fitting image compression using hyperbolic function
- Fast gapped variants for Lempel-Ziv-Welch compression
- Demonstration of Blind Quantum Computing
- Scientific Data Mining
- A New Proof of the Quantum Noiseless Coding Theorem
- Trading quantum for classical resources in quantum data compression
- Energy-Efficient Spectral Analysis Method Using Autoregressive Model-Based Approach for Internet of Things
- General Mixed-State Quantum Data Compression With and Without Entanglement Assistance
- Discrete Mehler–Fock transforms
- Discrete Cosine Transform
- Quantum advantage with shallow circuits
- One-Shot Classical Data Compression With Quantum Side Information and the Distillation of Common Randomness or Secret Keys
- One-Shot Lossy Quantum Data Compression
- Efficient distributed quantum computing
- Quantum cryptography
- Quantum Information Theory
This page was built for publication: Classical and quantum compression for edge computing: the ubiquitous data dimensionality reduction
