A Qubit-Efficient Hybrid Quantum Encoding Mechanism for Quantum Machine Learning
Hevish Cowlessur, Tansu Alpcan, Chandra Thapa, Seyit Camtepe, Neel Kanth Kundu

TL;DR
This paper introduces qPGA, a non-invertible, qubit-efficient data encoding method for quantum machine learning that preserves data structure and enhances noise resilience, enabling scalable and secure QML applications.
Contribution
The paper presents qPGA, a novel classical dimensionality reduction technique based on Riemannian geometry that improves data encoding efficiency and security for quantum machine learning.
Findings
qPGA outperforms autoencoders in preserving local data structure
qPGA reduces qubit requirements for quantum encoding
qPGA demonstrates high accuracy in QML classification tasks
Abstract
Efficiently embedding high-dimensional datasets onto noisy and low-qubit quantum systems is a significant barrier to practical Quantum Machine Learning (QML). Approaches such as quantum autoencoders can be constrained by current hardware capabilities and may exhibit vulnerabilities to reconstruction attacks due to their invertibility. We propose Quantum Principal Geodesic Analysis (qPGA), a novel, non-invertible method for dimensionality reduction and qubit-efficient encoding. Executed classically, qPGA leverages Riemannian geometry to project data onto the unit Hilbert sphere, generating outputs inherently suitable for quantum amplitude encoding. This technique preserves the neighborhood structure of high-dimensional datasets within a compact latent space, significantly reducing qubit requirements for amplitude encoding. We derive theoretical bounds quantifying qubit requirements for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
