Modeling Feature Maps for Quantum Machine Learning

• URL: http://arxiv.org/abs/2501.08205v1
• Date: Tue, 14 Jan 2025 15:45:27 GMT
• Title: Modeling Feature Maps for Quantum Machine Learning
• Authors: Navneet Singh, Shiva Raj Pokhrel,
• Abstract summary: This study systematically evaluates how various quantum noise models affect key Quantum Machine Learning (QML) algorithms.<n>Results indicate that QSVC is notably robust under noise, whereas Peg-QSVC and QNN are more sensitive, particularly to depolarizing and amplitude-damping noise.<n>These findings underscore the critical importance of feature map selection and noise mitigation strategies in optimizing QML for genomic classification.
• Score: 12.248184406275405
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Quantum Machine Learning (QML) offers significant potential for complex tasks like genome sequence classification, but quantum noise on Noisy Intermediate-Scale Quantum (NISQ) devices poses practical challenges. This study systematically evaluates how various quantum noise models including dephasing, amplitude damping, depolarizing, thermal noise, bit-flip, and phase-flip affect key QML algorithms (QSVC, Peg-QSVC, QNN, VQC) and feature mapping techniques (ZFeatureMap, ZZFeatureMap, and PauliFeatureMap). Results indicate that QSVC is notably robust under noise, whereas Peg-QSVC and QNN are more sensitive, particularly to depolarizing and amplitude-damping noise. The PauliFeatureMap is especially vulnerable, highlighting difficulties in maintaining accurate classification under noisy conditions. These findings underscore the critical importance of feature map selection and noise mitigation strategies in optimizing QML for genomic classification, with promising implications for personalized medicine.

Related papers

• Investigating Quantum Feature Maps in Quantum Support Vector Machines for Lung Cancer Classification [0.0]
  Quantum Support Vector Machines (QSVM) leverage quantum mechanical phenomena like superposition and entanglement to construct high-dimensional Hilbert spaces for data classification.<n>We analyze how different quantum feature maps influence classification performance.<n>Results show that the PauliFeatureMap consistently outperformed the others, achieving perfect classification in three subsets and strong performance overall.
  arXiv  Detail & Related papers  (2025-06-03T18:01:29Z)
• Modeling Quantum Machine Learning for Genomic Data Analysis [12.248184406275405]
  Quantum Machine Learning (QML) continues to evolve, unlocking new opportunities for diverse applications.<n>We investigate and evaluate the applicability of QML models for binary classification of genome sequence data by employing various feature mapping techniques.<n>We present an open-source, independent Qiskit-based implementation to conduct experiments on a benchmark genomic dataset.
  arXiv  Detail & Related papers  (2025-01-14T15:14:26Z)
• Noise-resistant adaptive Hamiltonian learning [30.632260870411177]
  An adaptive Hamiltonian learning (AHL) model for data analysis and quantum state simulation is proposed to overcome problems such as low efficiency.<n>A noise-resistant quantum neural network (RQNN) based on AHL is developed, which improves the noise robustness of the quantum neural network.
  arXiv  Detail & Related papers  (2025-01-14T11:12:59Z)
• Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
  Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML) At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
  arXiv  Detail & Related papers  (2024-11-13T23:56:20Z)
• Lindblad-like quantum tomography for non-Markovian quantum dynamical maps [46.350147604946095]
  We introduce Lindblad-like quantum tomography (L$ell$QT) as a quantum characterization technique of time-correlated noise in quantum information processors. We discuss L$ell$QT for the dephasing dynamics of single qubits in detail, which allows for a neat understanding of the importance of including multiple snapshots of the quantum evolution in the likelihood function.
  arXiv  Detail & Related papers  (2024-03-28T19:29:12Z)
• Benchmarking Quantum Generative Learning: A Study on Scalability and Noise Resilience using QUARK [0.3624329910445628]
  This paper investigates the scalability and noise resilience of quantum generative learning applications. We employ rigorous benchmarking techniques to track progress and identify challenges in scaling QML algorithms. We show that QGANs are not as affected by the curse of dimensionality as QCBMs and to which extent QCBMs are resilient to noise.
  arXiv  Detail & Related papers  (2024-03-27T15:05:55Z)
• GQHAN: A Grover-inspired Quantum Hard Attention Network [53.96779043113156]
  Grover-inspired Quantum Hard Attention Mechanism (GQHAM) is proposed. GQHAN adeptly surmounts the non-differentiability hurdle, surpassing the efficacy of extant quantum soft self-attention mechanisms. The proposal of GQHAN lays the foundation for future quantum computers to process large-scale data, and promotes the development of quantum computer vision.
  arXiv  Detail & Related papers  (2024-01-25T11:11:16Z)
• Adaptive Feature Selection for No-Reference Image Quality Assessment by Mitigating Semantic Noise Sensitivity [55.399230250413986]
  We propose a Quality-Aware Feature Matching IQA Metric (QFM-IQM) to remove harmful semantic noise features from the upstream task. Our approach achieves superior performance to the state-of-the-art NR-IQA methods on eight standard IQA datasets.
  arXiv  Detail & Related papers  (2023-12-11T06:50:27Z)
• QuantumNAT: Quantum Noise-Aware Training with Noise Injection, Quantization and Normalization [22.900530292063348]
  Quantum Circuits (PQC) are promising towards quantum advantage on near-term quantum hardware. However, due to the large quantum noises (errors), the performance of PQC models has a severe degradation on real quantum devices. We present QuantumNAT, a PQC-specific framework to perform noise-aware optimizations in both training and inference stages to improve robustness.
  arXiv  Detail & Related papers  (2021-10-21T17:59:19Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Quantum Amplitude Estimation in the Presence of Noise [0.0]
  Quantum Amplitude Estimation is a key sub-routine in several important quantum algorithms, including Grover search and Quantum Monte-Carlo methods. An obstacle to implementing QAE in noisy quantum devices has been the need to perform Quantum Phase Estimation as a sub-routine. We show that, given an accurate noise characterization of one's system, one must choose a schedule that balances the trade-off between the greater ideal performance achieved by higher-depth circuits.
  arXiv  Detail & Related papers  (2020-06-25T03:01:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.