mlsanityData to 14 Oct 2026

Dimension reduction with structure-aware quantum circuits for hybrid machine learning

arXiv 2508.00048 ↗First posted 31 Jul 2025quant-ph cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Schmidt decomposition of a vector can be understood as writing the singular value decomposition (SVD) in vector form. A vector can be written as a linear combination of tensor product of two dimensional vectors by recursively applying Schmidt decompositions via SVD to all subsystems. Given a vector expressed as a linear combination of tensor products, using only the k principal terms yields a k-rank approximation of the vector. Therefore, writing a vector in this reduced form allows to retain most important parts of the vector while removing small noises from it, analogous to SVD-based denoising. In this paper, we show that quantum circuits designed based on a value k (determined from the tensor network decomposition of the mean vector of the training sample) can approximate the reduced-form representations of entire datasets. We then employ this circuit ansatz with a classical neural network head to construct a hybrid machine learning model. Since the output of the quantum circuit for an 2n dimensional vector is an n dimensional probability vector, this provides an exponential compression of the input and potentially can reduce the number of learnable parameters for training large-scale models. We use datasets provided in the Python scikit-learn module for the experiments. The results confirm the quantum circuit is able to compress data successfully to provide effective k-rank approximations to the classical processing component.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 43 references that are in the map. First posted on arXiv 31 Jul 2025.

Builds on

21 of 43 references.

References · 21

  1. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  2. 2020Variational Quantum Algorithmscited by 692
  3. 2018Supervised learning with quantum enhanced feature spacescited by 665
  4. 2018Barren plateaus in quantum neural network training landscapescited by 630
  5. 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 603
  6. 2020Power of data in quantum machine learningcited by 338
  7. 2013Predicting Parameters in Deep Learningcited by 224
  8. 2023Challenges and Opportunities in Quantum Machine Learningcited by 203
  9. 2024Barren Plateaus in Variational Quantum Computingcited by 133
  10. 2018Towards Quantum Machine Learning with Tensor Networkscited by 76
  11. 2020Methods for Pruning Deep Neural Networkscited by 49
  12. 2020Universal Approximation Property of Quantum Machine Learning Models in Quantum-Enhanced Feature Spacescited by 44
9 more
  1. 2023Tensor networks for quantum machine learningcited by 17
  2. 2023Tensor networks for interpretable and efficient quantum-inspired machine learningcited by 17
  3. 2019Classical and Quantum Algorithms for Tensor Principal Component Analysiscited by 5
  4. 2019Variational Quantum Algorithms for Dimensionality Reduction and Classificationcited by 4
  5. 2022Efficient Quantum Feature Extraction for CNN-based Learningcited by 3
  6. 2023Dimension reduction and redundancy removal through successive Schmidt decompositionscited by 3
  7. 2025Iterative Quantum Feature Mapscited by 3
  8. 2015Obtaining A Linear Combination of the Principal Components of a Matrix on Quantum Computerscited by 1
  9. 2025Learnable quantum spectral filters for hybrid graph neural networkscited by 1

Built on by

Not cited yet.