QuProFS: An Evolutionary Training-free Approach to Efficient Quantum Feature Map Search

• URL: http://arxiv.org/abs/2508.07104v1
• Date: Sat, 09 Aug 2025 21:17:24 GMT
• Title: QuProFS: An Evolutionary Training-free Approach to Efficient Quantum Feature Map Search
• Abstract summary: We propose an evolutionary training-free quantum architecture search (QAS) framework that employs circuit-baseds focused on trainability, hardware robustness, generalisation ability, expressivity, complexity, and kernel-target alignment.<n>By ranking circuit architectures with various proxies, we reduce evaluation costs and incorporate hardware-aware circuits to enhance robustness against noise.<n>Our approach demonstrates competitive accuracy on both simulators and real quantum hardware, surpassing state-of-the-art QAS methods in terms of sampling efficiency and achieving up to a 2x speedup in architecture search runtime.
• Score: 19.355532507267075
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The quest for effective quantum feature maps for data encoding presents significant challenges, particularly due to the flat training landscapes and lengthy training processes associated with parameterised quantum circuits. To address these issues, we propose an evolutionary training-free quantum architecture search (QAS) framework that employs circuit-based heuristics focused on trainability, hardware robustness, generalisation ability, expressivity, complexity, and kernel-target alignment. By ranking circuit architectures with various proxies, we reduce evaluation costs and incorporate hardware-aware circuits to enhance robustness against noise. We evaluate our approach on classification tasks (using quantum support vector machine) across diverse datasets using both artificial and quantum-generated datasets. Our approach demonstrates competitive accuracy on both simulators and real quantum hardware, surpassing state-of-the-art QAS methods in terms of sampling efficiency and achieving up to a 2x speedup in architecture search runtime.

Related papers

• Probabilistic Design of Parametrized Quantum Circuits through Local Gate Modifications [40.28072745340568]
  We propose an evolution-inspired quantum architecture search algorithm, which we refer to as the local quantum architecture search.<n>The goal of the local quantum architecture search algorithm is to optimize parametrized quantum circuit architectures.<n>We evaluate the local quantum architecture search algorithm on two synthetic function-fitting regression tasks and two quantum chemistry regression datasets.
  arXiv  Detail & Related papers  (2026-02-12T22:47:03Z)
• Investigating Quantum Circuit Designs Using Neuro-Evolution [2.9631016562930537]
  We propose an evolutionary approach to the automated design and training of quantum circuits.<n>The proposed method searches over gate types, qubit connectivity, parameterization, and circuit depth while respecting hardware and noise constraints.<n>Preliminary results demonstrate that circuits evolved on classification tasks are able to achieve over 90% accuracy.
  arXiv  Detail & Related papers  (2026-02-03T18:57:39Z)
• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Differentiable Architecture Search for Adversarially Robust Quantum Computer Vision [6.837371200793778]
  Current quantum neural networks suffer from extreme sensitivity to both adversarial perturbations and hardware noise.<n>We propose a hybrid quantum-classical Differentiable Quantum Architecture Search (DQAS) framework that addresses these limitations.
  arXiv  Detail & Related papers  (2026-01-26T01:21:44Z)
• Quantum Architecture Search for Solving Quantum Machine Learning Tasks [3.515829683606796]
  This work introduces RL-QAS, a framework that applies RL to discover effective circuit architectures for classification tasks.<n>We evaluate RL-QAS using the Iris and binary MNIST datasets.
  arXiv  Detail & Related papers  (2025-09-14T09:55:38Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [60.996803677584424]
  Variational Quantum Circuits (VQCs) offer a novel pathway for quantum machine learning.<n>Their practical application is hindered by inherent limitations such as constrained linear expressivity, optimization challenges, and acute sensitivity to quantum hardware noise.<n>This work introduces VQC-MLPNet, a scalable and robust hybrid quantum-classical architecture designed to overcome these obstacles.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Provably Robust Training of Quantum Circuit Classifiers Against Parameter Noise [49.97673761305336]
  Noise remains a major obstacle to achieving reliable quantum algorithms.<n>We present a provably noise-resilient training theory and algorithm to enhance the robustness of parameterized quantum circuit classifiers.
  arXiv  Detail & Related papers  (2025-05-24T02:51:34Z)
• Scalable Quantum Architecture Search via Landscape Analysis [28.48505903998775]
  quantum architecture search (QAS) plays a pivotal role in variational quantum computing.<n>We introduce a scalable, training-free QAS framework that efficiently explores and evaluates quantum circuits.<n>Our framework attains robust performance on a challenging 50-qubit quantum many-body simulation.
  arXiv  Detail & Related papers  (2025-05-08T16:13:23Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Distributed quantum architecture search [0.0]
  Variational quantum algorithms, inspired by neural networks, have become a novel approach in quantum computing. Quantum architecture search tackles this by adjusting circuit structures along with gate parameters to automatically discover high-performance circuit structures. We propose an end-to-end distributed quantum architecture search framework, where we aim to automatically design distributed quantum circuit structures for interconnected quantum processing units with specific qubit connectivity.
  arXiv  Detail & Related papers  (2024-03-10T13:28:56Z)
• Quantum Architecture Search with Unsupervised Representation Learning [24.698519892763283]
  Unsupervised representation learning presents new opportunities for advancing Quantum Architecture Search (QAS)<n>QAS is designed to optimize quantum circuits for Variational Quantum Algorithms (VQAs)
  arXiv  Detail & Related papers  (2024-01-21T19:53:17Z)
• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• 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)

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.