Back to News
quantum-computing

Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines

arXiv Quantum Physics
Loading...
3 min read
0 likes
⚡ Quantum Brief
A 2026 survey identifies feature encoding as the primary bottleneck in quantum machine learning on NISQ devices, analyzing 66 studies (2017–2026) to fill gaps in cost, expressivity, and noise robustness frameworks. The study introduces a three-axis taxonomy classifying six encoding families—basis, angle, dense-angle, amplitude, data re-uploading, and IQP—based on measurable trade-offs between resource demands, expressivity, and error resilience. For the first time, researchers derive closed-form bounds showing amplitude encoding requires gate-error rates below ~10⁻³ to remain viable, making it impractical for current NISQ hardware with higher error rates. A unified analysis links Fourier expressivity, barren-plateau risks, and kernel concentration to encoding circuits, offering the first joint assessment of trainability challenges in quantum models. Practitioners gain a five-regime decision tool matching feature dimension, qubit count, error rate, and task type to optimal encodings, revealing shallow angle-based methods outperform amplitude encoding in noisy environments despite its theoretical qubit efficiency.
Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines

Summarize this article with:

Quantum Physics arXiv:2606.05387 (quant-ph) [Submitted on 3 Jun 2026] Title:Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines Authors:Vincenzo Sammartino View a PDF of the paper titled Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines, by Vincenzo Sammartino View PDF HTML (experimental) Abstract:The encoding of classical data into quantum states constitutes the primary performance bottleneck in Quantum Machine Learning (qml) on Noisy Intermediate-Scale Quantum (nisq) devices. No existing framework jointly characterises resource cost, expressivity, and noise robustness, nor provides actionable selection guidelines for practitioners. This survey addresses that gap through a systematic review of 66 primary works (2017-2026) assembled via a PRISMA-adapted protocol across five academic databases. Four principal contributions are made. First, a three-axis cost-expressivity-robustness taxonomy classifies all major encoding families - basis, angle, dense-angle, amplitude, data re-uploading, and IQP - along independently measurable axes. Second, closed-form depth-fidelity bounds under nisq decoherence channels identify the critical gate-error rate p* ~ 10^-3 below which amplitude encoding is viable. Third, a unified treatment of Fourier expressivity, barren-plateau onset, and quantum kernel concentration as functions of the encoding circuit provides the first joint trainability analysis. Fourth, a five-regime decision framework maps (D, n, p, tau) - feature dimension, qubit budget, error rate, and task type - to a hardware-grounded encoding recommendation. The central finding is that for p >= 10^-3, shallow angle-based encodings consistently outperform amplitude encoding in practice, despite the latter's exponential qubit advantage. Comments: Subjects: Quantum Physics (quant-ph); Emerging Technologies (cs.ET) Cite as: arXiv:2606.05387 [quant-ph] (or arXiv:2606.05387v1 [quant-ph] for this version) https://doi.org/10.48550/arXiv.2606.05387 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Vincenzo Sammartino [view email] [v1] Wed, 3 Jun 2026 19:46:35 UTC (49 KB) Full-text links: Access Paper: View a PDF of the paper titled Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines, by Vincenzo SammartinoView PDFHTML (experimental)TeX Source view license Current browse context: quant-ph new | recent | 2026-06 Change to browse by: cs cs.ET References & Citations INSPIRE HEP NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading... BibTeX formatted citation × loading... Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs. Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Read Original

Tags

quantum-machine-learning
quantum-hardware

Source Information

Source: arXiv Quantum Physics