pith. sign in

arxiv: 2605.18345 · v1 · pith:HVVCZ6MTnew · submitted 2026-05-18 · 🪐 quant-ph · cs.LG

Hybrid Quantum-Classical Neural Architecture Search

Pith reviewed 2026-05-20 11:32 UTC · model grok-4.3

classification 🪐 quant-ph cs.LG
keywords hybrid quantum-classical neural networksneural architecture searchFLOPs-aware optimizationquantum machine learningNISQ hardware constraintshardware-aware design
0
0 comments X

The pith

FLOPs-aware neural architecture search produces accurate yet computationally efficient hybrid quantum-classical networks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper sets out to show how neural architecture search can be adapted to hybrid quantum-classical neural networks by incorporating FLOPs as a direct proxy for computational cost during the search. It argues that this hardware-aware extension automates the otherwise manual and difficult choices around data encoding, circuit structure, measurements, and classical-quantum coupling. A sympathetic reader would care because current NISQ devices impose strict resource limits, making manually designed models often too costly or impractical to run. By treating FLOPs as an explicit search objective, the method aims to discover architectures that remain accurate while staying within practical computational budgets.

Core claim

The central claim is that FLOPs-aware search constitutes an important hardware-aware direction for HQNNs, enabling the automatic construction of networks that are accurate, computationally efficient, and practically deployable on current quantum hardware by using FLOPs counts as a sufficient proxy for overall complexity.

What carries the argument

FLOPs-aware neural architecture search, which extends classical NAS techniques to hybrid quantum-classical settings by adding computational cost as an explicit objective alongside accuracy.

If this is right

  • Manual design of HQNNs becomes unnecessary once FLOPs-aware search is applied.
  • The resulting architectures balance prediction accuracy with reduced computational demands suitable for NISQ hardware.
  • Classical NAS methods can be directly reused in quantum-hybrid contexts when cost metrics are included.
  • Deployability of quantum machine learning models increases because efficiency is optimized during discovery rather than after the fact.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same search procedure could be extended to other hardware metrics such as circuit depth or noise resilience if those become measurable proxies.
  • Combining FLOPs-aware search with error-mitigation techniques might further improve the practical performance of the discovered HQNNs.
  • The approach suggests that resource-constrained quantum machine learning may benefit from treating hardware cost as a first-class search variable rather than a post-design check.

Load-bearing premise

That FLOPs counts serve as a sufficient proxy for actual computational complexity and hardware constraints when searching hybrid quantum-classical architectures.

What would settle it

A side-by-side execution of FLOPs-aware versus non-aware searched architectures on the same NISQ simulator or device, measuring whether the FLOPs-selected models show measurably lower actual runtime, gate count, or energy use while preserving comparable accuracy.

Figures

Figures reproduced from arXiv: 2605.18345 by Alberto Marchisio, Muhammad Kashif, Muhammad Shafique, Nouhaila Innan.

Figure 1
Figure 1. Figure 1: Functionality of a HQNN, composed of both classical layers and quantum layers, equipped with classical optimization and parameter update. in classification settings, is minimized using classical optimization, while gradients through the quantum block are obtained with differentiable quantum techniques such as the parameter-shift rule. This allows the quantum module to be integrated into familiar deep learn… view at source ↗
Figure 2
Figure 2. Figure 2: Overview of the standard NAS workflow, including the search space, search strategy, candidate evaluation, and architecture selection. 2.3 Evaluation Metrics We consider both predictive performance and computational efficiency as key evaluation criteria. In standard NAS, the primary objective is typically accuracy, which reflects how reliably a model performs on a given task. Accuracy measures the proportio… view at source ↗
Figure 3
Figure 3. Figure 3: Detailed methodology for FLOPs-aware HQNN architecture search. search process iteratively evolves candidate solutions using crossover (p = 0.8), mutation (p = 0.2), and Pareto-optimal architectures that balance accuracy and computational cost. The search stops evaluating further architectures if there is no improvement in the objectives for two consecutive generations. An overview of the complete methodolo… view at source ↗
Figure 4
Figure 4. Figure 4: Iris Dataset: Accuracy versus FLOPs for all candidate HQNN architectures (blue dots), and pareto-optimal architectures (red stars). Classical FLOPs vs accuracy (left), quantum FLOPs vs accuracy (middle), and Total FLOPs vs accuracy (right). 100%, beyond which larger quantum circuits offer no benefit. Classical FLOPs show weak correlation with accuracy, with Pareto-optimal solutions appearing across both lo… view at source ↗
Figure 5
Figure 5. Figure 5: Digits Dataset: Accuracy versus FLOPs for all candidate HQNN architectures (blue dots), and pareto-optimal architectures (red stars). Classical FLOPs vs accuracy (left), quantum FLOPs vs accuracy (middle), and Total FLOPs vs accuracy (right). Overall, the accuracy improvements in HQNNs are primarily driven by quantum FLOPs, while classical FLOPs remain largely fixed due to the constrained design of classic… view at source ↗
read the original abstract

Hybrid quantum-classical neural networks (HQNNs) are emerging as a practical approach for quantum machine learning in the noisy intermediate-scale quantum (NISQ) era, as they combine classical learning components with parameterized quantum circuits in an end-to-end trainable framework. However, their performance and efficiency depend strongly on architectural choices such as data encoding, circuit structure, measurement design, and the coupling between classical and quantum modules. This makes manual design increasingly difficult, especially when hardware limitations and resource constraints must also be taken into account. In this paper, we study the foundations of HQNNs and neural architecture search (NAS), discuss how NAS extends to quantum and hybrid settings, and demonstrate FLOPs-aware search (where FLOPs serve as a proxy for computational complexity), as an important hardware-aware direction for building HQNNs that are not only accurate but also computationally efficient and practically deployable.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 1 minor

Summary. The manuscript studies the foundations of hybrid quantum-classical neural networks (HQNNs) and neural architecture search (NAS), discusses how NAS extends to quantum and hybrid settings, and demonstrates FLOPs-aware search (using FLOPs as a proxy for computational complexity) as a hardware-aware direction for constructing HQNNs that are accurate, computationally efficient, and practically deployable on NISQ hardware.

Significance. If the demonstration establishes that FLOPs-aware NAS yields HQNN architectures with favorable accuracy-efficiency trade-offs, the work could be significant for systematizing the design of practical hybrid quantum-classical models under resource constraints, extending classical NAS techniques to the quantum domain.

major comments (1)
  1. [Abstract] Abstract, final paragraph: the central claim that FLOPs-aware search produces HQNNs that are 'practically deployable' rests on FLOPs serving as a faithful proxy for total computational complexity. In hybrid quantum-classical settings this is questionable, since quantum sub-circuits are dominated by gate depth, two-qubit gate count, and shot noise rather than classical floating-point operations; the search objective may therefore still select high-depth or high-measurement circuits that undermine NISQ deployability.
minor comments (1)
  1. [Abstract] The abstract supplies no quantitative results, baselines, error bars, or specific architectural outcomes from the FLOPs-aware demonstration, making it difficult to evaluate whether the claimed efficiency gains are realized.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their thoughtful comments, which have helped us improve the clarity and precision of our manuscript. We address the major comment point by point below.

read point-by-point responses
  1. Referee: [Abstract] Abstract, final paragraph: the central claim that FLOPs-aware search produces HQNNs that are 'practically deployable' rests on FLOPs serving as a faithful proxy for total computational complexity. In hybrid quantum-classical settings this is questionable, since quantum sub-circuits are dominated by gate depth, two-qubit gate count, and shot noise rather than classical floating-point operations; the search objective may therefore still select high-depth or high-measurement circuits that undermine NISQ deployability.

    Authors: We agree that FLOPs is an imperfect proxy for the full computational complexity in hybrid quantum-classical systems, as quantum circuit execution is better characterized by metrics such as gate depth, two-qubit gate counts, and the number of shots required for measurement. Our use of FLOPs primarily captures the classical computational cost associated with the neural network components and data processing, which constitutes a significant portion of the overall resource requirements in hybrid models. To address this, we have revised the final paragraph of the abstract to remove the unqualified claim of 'practically deployable' and instead emphasize 'computationally efficient' with respect to classical FLOPs. Additionally, we have added a new subsection in the discussion that explicitly discusses the limitations of FLOPs as a proxy and proposes future extensions of the NAS framework to incorporate quantum hardware metrics such as circuit depth and gate count. We believe this strengthens the paper by acknowledging the referee's valid concern while maintaining the contribution of FLOPs-aware search as a practical starting point for hybrid NAS. revision: yes

Circularity Check

0 steps flagged

No circularity: discussion and demonstration paper with no load-bearing derivations

full rationale

The manuscript studies foundations of HQNNs and NAS, discusses extensions to hybrid quantum-classical settings, and demonstrates FLOPs-aware search as a hardware-aware direction. No equations, predictions, or first-principles derivations are presented that could reduce to inputs by construction. The central claims rest on conceptual discussion and empirical demonstration rather than any self-referential fit or self-citation chain, rendering the work self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim rests on the domain assumption that neural architecture search techniques transfer effectively to quantum-hybrid settings and that FLOPs is a meaningful proxy for deployability; no free parameters or invented entities are identifiable from the abstract.

axioms (1)
  • domain assumption NAS methods can be extended to quantum and hybrid quantum-classical settings while incorporating hardware constraints such as FLOPs
    Invoked in the abstract when stating that the paper discusses how NAS extends to quantum and hybrid settings and demonstrates FLOPs-aware search.

pith-pipeline@v0.9.0 · 5680 in / 1126 out tokens · 41137 ms · 2026-05-20T11:32:45.161803+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

58 extracted references · 58 canonical work pages · 3 internal anchors

  1. [1]

    An introduction to quantum machine learning,

    M. Schuld, I. Sinayskiy, and F. Petruccione, “An introduction to quantum machine learning,”Contemporary Physics, vol. 56, no. 2, pp. 172–185, 2015. 12 A. Marchisio, M. Kashif, N. Innan, and M. Shafique

  2. [2]

    A survey on quantum machine learning: Current trends, challenges, opportunities, and the road ahead,

    K. Zaman, A. Marchisio, M. A. Hanif, and M. Shafique, “A survey on quantum machine learning: Current trends, challenges, opportunities, and the road ahead,” arXiv preprint arXiv:2310.10315, 2023

  3. [3]

    Position paper: Quantum neural networks - a paradigm shift in ai or a theoretical promise?,

    M. Kashif and M. Shafique, “Position paper: Quantum neural networks - a paradigm shift in ai or a theoretical promise?,” in2025 International Joint Conference on Neural Networks (IJCNN), pp. 1–10, 2025

  4. [4]

    Quantum machine learning: an interplay between quantum computing and machine learning,

    J. Qi, C.-H. H. Yang, S. Y.-C. Chen, and P.-Y. Chen, “Quantum machine learning: an interplay between quantum computing and machine learning,” in2025 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 1–5, IEEE, 2025

  5. [5]

    Enhancing quantum support vector machines through variational kernel training,

    N. Innan, M. A.-Z. Khan, B. Panda, and M. Bennai, “Enhancing quantum support vector machines through variational kernel training,”Quantum Information Processing, vol. 22, no. 10, p. 374, 2023

  6. [6]

    A variational quantum perceptron with grover’s algorithm for efficient classification,

    N. Innan and M. Bennai, “A variational quantum perceptron with grover’s algorithm for efficient classification,”Physica Scripta, vol. 99, no. 5, p. 055120, 2024

  7. [7]

    Design space exploration of hybrid quantum– classical neural networks,

    M. Kashif and S. Al-Kuwari, “Design space exploration of hybrid quantum– classical neural networks,”Electronics, 2021

  8. [8]

    Quantum computing in the nisq era and beyond,

    J. Preskill, “Quantum computing in the nisq era and beyond,”Quantum, vol. 2, p. 79, 2018

  9. [9]

    A comparative analysis of hybrid-quantum classical neural networks,

    K. Zamanet al., “A comparative analysis of hybrid-quantum classical neural networks,” inWorld Congress in Computer Science, Computer Engineering & Applied Computing, 2024

  10. [10]

    Noisy hqnns: A comprehensive analysis of noise robustness in hybrid quantum neural networks,

    T. Ahmed, A. Marchisio, M. Kashif, and M. Shafique, “Noisy hqnns: A comprehensive analysis of noise robustness in hybrid quantum neural networks,” inIJCNN, 2025

  11. [11]

    The impact of cost function globality and locality in hybrid quantum neural networks on nisq devices,

    M. Kashif and S. Al-Kuwari, “The impact of cost function globality and locality in hybrid quantum neural networks on nisq devices,”Machine Learning: Science and Technology, 2023

  12. [12]

    Studying the impact of quantum-specific hyperparameters on hybrid quantum- classical neural networks,

    K. Zaman, T. Ahmed, M. Kashif, M. A. Hanif, A. Marchisio, and M. Shafique, “Studying the impact of quantum-specific hyperparameters on hybrid quantum- classical neural networks,” inWorld Congress in Computer Science, Computer Engineering & Applied Computing, pp. 132–149, Springer, 2024

  13. [13]

    A comparative analysis and noise robustness evaluation in quantum neural networks,

    T. Ahmed, M. Kashif, A. Marchisio, and M. Shafique, “A comparative analysis and noise robustness evaluation in quantum neural networks,”Scientific Reports, vol. 15, no. 1, p. 33654, 2025

  14. [14]

    A privacy-preserving federated framework with hybrid quantum- enhanced learning for financial fraud detection,

    A. Sawaika, S. Krishna, T. Tomar, D. P. Suggisetti, A. Lal, T. Shrivastav, N. Innan, and M. Shafique, “A privacy-preserving federated framework with hybrid quantum- enhanced learning for financial fraud detection,” in2025 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 1578– 1588, IEEE, 2025

  15. [15]

    Cutting is all you need: Execution of large-scale quantum neural networks on limited-qubit devices,

    A. Marchisio, E. Sychiuco, M. Kashif, and M. Shafique, “Cutting is all you need: Execution of large-scale quantum neural networks on limited-qubit devices,” in 2025 IEEE International Conference on Quantum Artificial Intelligence (QAI), pp. 330–336, IEEE, 2025

  16. [16]

    Gat-qnn: Genetic algorithm-based training of hybrid quantum neural networks,

    T. Ahmed, A. Marchisio, M. Kashif, N. Innan, and M. Shafique, “Gat-qnn: Genetic algorithm-based training of hybrid quantum neural networks,” inIJCNN, 2026

  17. [17]

    Scaling Laws for Hybrid Quantum Neural Networks: Depth, Width, and Quantum-Centric Diagnostics

    D. Vyskubov, K. Vyskubov, N. Innan, and M. Shafique, “Scaling laws for hybrid quantum neural networks: Depth, width, and quantum-centric diagnostics,”arXiv preprint arXiv:2604.06007, 2026. Hybrid Quantum-Classical Neural Architecture Search 13

  18. [18]

    The unified effect of data encoding, ansatz expressibility and entanglement on the trainability of hqnns,

    M. Kashif and S. Al-Kuwari, “The unified effect of data encoding, ansatz expressibility and entanglement on the trainability of hqnns,”International Journal of Parallel, Emergent and Distributed Systems, vol. 38, no. 5, pp. 362– 400, 2023

  19. [19]

    Faqnas: Flops- aware hybrid quantum neural architecture search using genetic algorithm,

    M. Kashif, S. Khalid, A. Marchisio, N. Innan, and M. Shafique, “Faqnas: Flops- aware hybrid quantum neural architecture search using genetic algorithm,”arXiv preprint arXiv:2511.10062, 2025

  20. [20]

    Closing the loop: Resource-aware hybrid nas guided by analytical and hardware-calibrated quantum cost modeling,

    M. Kashif, A. Marchisio, and M. Shafique, “Closing the loop: Resource-aware hybrid nas guided by analytical and hardware-calibrated quantum cost modeling,” arXiv preprint arXiv:2603.00625, 2026

  21. [21]

    Qnas: A neural architecture search framework for accurate and efficient quantum neural networks,

    K. Maleki, A. Marchisio, and M. Shafique, “Qnas: A neural architecture search framework for accurate and efficient quantum neural networks,” inIJCNN, 2026

  22. [22]

    Demonstrating quantum advantage in hybrid quantum neural networks for model capacity,

    M. Kashif and S. Al-Kuwari, “Demonstrating quantum advantage in hybrid quantum neural networks for model capacity,” inICRC, 2022

  23. [23]

    Alleviating barren plateaus in parameterized quantum machine learning circuits: Investigating advanced parameter initialization strategies,

    M. Kashif, S. Al-Kuwari, M. Rashid, and M. Shafique, “Alleviating barren plateaus in parameterized quantum machine learning circuits: Investigating advanced parameter initialization strategies,” inDATE, 2024

  24. [24]

    Barren plateaus in quantum neural network training landscapes

    J. R. McCleanet al., “Barren plateaus in quantum neural network training landscapes,”CoRR, vol. abs/1803.11173, 2018

  25. [25]

    Resqnets: a residual approach for mitigating barren plateaus in quantum neural networks,

    M. Kashif and S. Al-Kuwari, “Resqnets: a residual approach for mitigating barren plateaus in quantum neural networks,”EPJ Quantum Technology, 2024

  26. [26]

    Robqfl: Robust quantum federated learning in adversarial environment,

    W. El Maouaki, N. Innan, A. Marchisio, T. Said, M. Shafique, and M. Bennai, “Robqfl: Robust quantum federated learning in adversarial environment,” in2025 IEEE International Conference on Quantum Artificial Intelligence (QAI), pp. 128– 134, IEEE, 2025

  27. [27]

    Designing robust quantum neural networks via optimized circuit metrics,

    W. El Maouaki, A. Marchisio, T. Said, M. Shafique, and M. Bennai, “Designing robust quantum neural networks via optimized circuit metrics,”Advanced Quantum Technologies, vol. 8, no. 6, p. 2400601, 2025

  28. [28]

    Advqunn: A methodology for analyzing the adversarial robustness of quanvolutional neural networks,

    W. El Maouaki, A. Marchisio, T. Said, M. Bennai, and M. Shafique, “Advqunn: A methodology for analyzing the adversarial robustness of quanvolutional neural networks,” in2024 IEEE International Conference on Quantum Software (QSW), pp. 175–181, IEEE, 2024

  29. [29]

    Neural architecture search: A survey,

    T. Elsken, J. H. Metzen, and F. Hutter, “Neural architecture search: A survey,” Journal of Machine Learning Research, vol. 20, no. 55, pp. 1–21, 2019

  30. [30]

    A comprehensive survey on hardware-aware neural architecture search,

    H. Benmeziane, K. E. Maghraoui, H. Ouarnoughi, S. Niar, M. Wistuba, and N. Wang, “A comprehensive survey on hardware-aware neural architecture search,” arXiv preprint arXiv:2101.09336, 2021

  31. [31]

    Nascaps: A framework for neural architecture search to optimize the accuracy and hardware efficiency of convolutional capsule networks,

    A. Marchisio, A. Massa, V. Mrazek, B. Bussolino, M. Martina, and M. Shafique, “Nascaps: A framework for neural architecture search to optimize the accuracy and hardware efficiency of convolutional capsule networks,” inProceedings of the 39th International Conference on Computer-Aided Design, pp. 1–9, 2020

  32. [32]

    Computational advantage in hybrid quantum neural networks: Myth or reality?,

    M. Kashif, A. Marchisio, and M. Shafique, “Computational advantage in hybrid quantum neural networks: Myth or reality?,” inDAC, 2025

  33. [33]

    Flops-efficient filter pruning via transfer scale for neural network acceleration,

    Z. Guoet al., “Flops-efficient filter pruning via transfer scale for neural network acceleration,”Journal of Computational Science, vol. 55, p. 101459, 2021

  34. [34]

    Run, don’t walk: Chasing higher flops for faster neural networks,

    J. Chenet al., “Run, don’t walk: Chasing higher flops for faster neural networks,” inProceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), pp. 12021–12031, June 2023

  35. [35]

    Convolution neural network with low operation flops and high accuracy for image recognition,

    S.-C. Hsiaet al., “Convolution neural network with low operation flops and high accuracy for image recognition,”Journal of Real-Time Image Processing, vol. 18, no. 4, pp. 1309–1319, 2021. 14 A. Marchisio, M. Kashif, N. Innan, and M. Shafique

  36. [36]

    Quantum circuit architecture search for variational quantum algorithms,

    Y. Du, T. Huang, S. You, M.-H. Hsieh, and D. Tao, “Quantum circuit architecture search for variational quantum algorithms,”npj Quantum Information, vol. 8, no. 1, p. 62, 2022

  37. [37]

    Quantum long short-term memory with differentiable architecture search,

    S. Y.-C. Chen and P. Tiwari, “Quantum long short-term memory with differentiable architecture search,” in2025 IEEE International Conference on Quantum Artificial Intelligence (QAI), pp. 13–18, IEEE, 2025

  38. [38]

    Neural architecture search for quantum autoencoders,

    H. Agha, S. Y.-C. Chen, H.-H. Tseng, and S. Yoo, “Neural architecture search for quantum autoencoders,” in2025 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 1748–1755, IEEE, 2025

  39. [39]

    Financial fraud detection: a comparative study of quantum machine learning models,

    N. Innan, M. A.-Z. Khan, and M. Bennai, “Financial fraud detection: a comparative study of quantum machine learning models,”International Journal of Quantum Information, vol. 22, no. 02, p. 2350044, 2024

  40. [40]

    Comparative performance analysis of quantum machine learning architectures for credit card fraud detection,

    M. El Alami, N. Innan, M. Shafique, and M. Bennai, “Comparative performance analysis of quantum machine learning architectures for credit card fraud detection,” Applied Intelligence, vol. 56, no. 3, p. 83, 2026

  41. [41]

    Hqnn-fsp: A hybrid classical-quantum neural network for regression-based financial stock market prediction,

    P. K. Choudhary, N. Innan, M. Shafique, and R. Singh, “Hqnn-fsp: A hybrid classical-quantum neural network for regression-based financial stock market prediction,”Quantum Machine Intelligence, vol. 8, no. 1, p. 55, 2026

  42. [42]

    Qnn-vrcs: A quantum neural network for vehicle road cooperation systems,

    N. Innan, B. K. Behera, S. Al-Kuwari, and A. Farouk, “Qnn-vrcs: A quantum neural network for vehicle road cooperation systems,”IEEE Transactions on Intelligent Transportation Systems, 2025

  43. [43]

    Circuithunt: Automated quantum circuit screening for superior credit-card fraud detection,

    N. Innan, A. Singh, and M. Shafique, “Circuithunt: Automated quantum circuit screening for superior credit-card fraud detection,” in2025 IEEE International Conference on Quantum Artificial Intelligence (QAI), pp. 432–438, IEEE, 2025

  44. [44]

    Quantum architecture search: a survey,

    D. Martyniuk, J. Jung, and A. Paschke, “Quantum architecture search: a survey,” in2024 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 1695–1706, IEEE, 2024

  45. [45]

    Qubit-wise architecture search method for variational quantum circuits,

    J. Chen, Z. Cai, K. Xu, D. Wu, and W. Cao, “Qubit-wise architecture search method for variational quantum circuits,”arXiv preprint arXiv:2403.04268, 2024

  46. [46]

    Quantumdarts: differentiable quantum architecture search for variational quantum algorithms,

    W. Wu, G. Yan, X. Lu, K. Pan, and J. Yan, “Quantumdarts: differentiable quantum architecture search for variational quantum algorithms,” inInternational conference on machine learning, pp. 37745–37764, PMLR, 2023

  47. [47]

    Evolutionary quantum architecture search for parametrized quantum circuits,

    L. Ding and L. Spector, “Evolutionary quantum architecture search for parametrized quantum circuits,” inProceedings of the genetic and evolutionary computation conference companion, pp. 2190–2195, 2022

  48. [48]

    Evolutionary-based searching method for quantum circuit architecture,

    A. Zhang and S. Zhao, “Evolutionary-based searching method for quantum circuit architecture,”Quantum Information Processing, vol. 22, no. 7, p. 283, 2023

  49. [49]

    Quantum architecture search via deep reinforcement learning,

    E.-J. Kuo, Y.-L. L. Fang, and S. Y.-C. Chen, “Quantum architecture search via deep reinforcement learning,”arXiv preprint arXiv:2104.07715, 2021

  50. [50]

    QAS-QTNs: Curriculum reinforcement learning-driven quantum architecture search for quantum tensor networks,

    S. Dutta, N. Innan, S. B. Yahia, and M. Shafique, “QAS-QTNs: Curriculum reinforcement learning-driven quantum architecture search for quantum tensor networks,” in2025 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 1739–1747, IEEE, 2025

  51. [51]

    Differentiable quantum architecture search,

    S.-X. Zhang, C.-Y. Hsieh, S. Zhang, and H. Yao, “Differentiable quantum architecture search,”Quantum Science & Technology, vol. 7, no. 4, p. 045023, 2022

  52. [52]

    Gradient-based optimization for quantum architecture search,

    Z. He, J. Wei, C. Chen, Z. Huang, H. Situ, and L. Li, “Gradient-based optimization for quantum architecture search,”Neural Networks, vol. 179, p. 106508, 2024

  53. [53]

    Differentiable quantum architecture search in quantum-enhanced Hybrid Quantum-Classical Neural Architecture Search 15 neural network parameter generation,

    S. Y.-C. Chen, C.-Y. Liu, K.-C. Chen, W.-J. Huang, Y.-J. Chang, and W.- H. Huang, “Differentiable quantum architecture search in quantum-enhanced Hybrid Quantum-Classical Neural Architecture Search 15 neural network parameter generation,” in2025 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 01, pp. 1525–1535, 2025

  54. [54]

    Differentiable quantum architecture search in quantum-enhanced neural network parameter generation,

    S. Y.-C. Chen, C.-Y. Liu, K.-C. Chen, W.-J. Huang, Y.-J. Chang, and W.- H. Huang, “Differentiable quantum architecture search in quantum-enhanced neural network parameter generation,” in2025 IEEE International Conference on Quantum Computing and Engineering (QCE), vol. 1, pp. 1525–1535, IEEE, 2025

  55. [55]

    Neural predictor based quantum architecture search,

    S.-X. Zhang, C.-Y. Hsieh, S. Zhang, and H. Yao, “Neural predictor based quantum architecture search,”Machine Learning: Science and Technology, vol. 2, no. 4, p. 045027, 2021

  56. [56]

    Graph-based bayesian optimization for quantum circuit architecture search with uncertainty calibrated surrogates,

    P. K. Choudhary, N. Innan, M. Shafique, and R. Singh, “Graph-based bayesian optimization for quantum circuit architecture search with uncertainty calibrated surrogates,”arXiv preprint arXiv:2512.09586, 2025

  57. [57]

    Scikit-learn: Machine learning in python,

    F. Pedregosaet al., “Scikit-learn: Machine learning in python,”Journal of Machine Learning Research, vol. 12, pp. 2825–2830, 2011

  58. [58]

    Late Breaking Results: Hardware-Aware Compilation Reshapes Trainability in Variational Quantum Circuits

    M. Kashif and M. Shafique, “Late breaking results: Hardware-aware compilation reshapes trainability in variational quantum circuits,”arXiv preprint arXiv:2604.16527, 2026