Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Engineering Applications of Artificial Intelligence

Spectral-aware contrastive learning for sample-efficient quantum architecture search

Zhimin He, Hongxiang Chen, Yan Zhou, Haozhen Situ, Shenggen Zheng, Li Li

Published May 30, 2026• 0 citations
Publisher
DOI
10.1016/j.engappai.2026.115214

Related papers

Data-efficient predictor-based quantum architecture search with semi-supervised learning

Haozhen Situ, Guohong Li, Zhengjiang Li +3 more

Physical Review A•Dec 2, 2025•2 citations

A progressive predictor-based quantum architecture search with active learning

Maijie Deng, Zhimin He, Shenggen Zheng +3 more

The European Physical Journal Plus•Oct 10, 2023•6 citations

Efficient Quantum Neural Architecture Search With Filtered Supernet for Mobile Learning Systems

Seok Bin Son, Hyojun Ahn, Samuel Yen-Chi Chen +2 more

IEEE Transactions on Mobile Computing•Jul 1, 2026•0 citations

Noise-aware quantum architecture search based on a nondominated sorting genetic algorithm

Chunxin Li, Hui Juan Zeng, Dazhi Ding

Physical Review A•Jun 9, 2026•0 citations

Noise-Aware Quantum Architecture Search Based on NSGA-II Algorithm

Chenlu Li, Hui Zeng, Dazhi Ding

Quantum architecture search (QAS) has emerged to automate the design of high-performance quantum circuits under specific tasks and hardware constraints. We propose a noise-aware quantum architecture search (NA-QAS) framework based on variational quantum circuit design. By incorporating a noise model into the training of parameterized quantum circuits (PQCs) , the proposed framework identifies the noise-robust architectures. We introduce a hybrid Hamiltonian $\varepsilon$ -greedy strategy to optimize evaluation costs and circumvent local optima. Furthermore, an enhanced variable-depth NSGA-II algorithm is employed to navigate the vast search space, enabling an automated trade-off between architectural expressibility and quantum hardware overhead. The effectiveness of the framework is validated through binary classification and iris multi-classification tasks under a noisy condition. Compared to existing approaches, our framework can search for quantum architectures with superior performance and greater resource efficiency under a noisy condition.

quant-pharXiv:2601.10965•Jan 19, 2026•0 citations

EAQAS: Embedding-Aware Quantum Architecture Search via cross-attention fusion and hierarchical representation learning

Jiawen Dai, Jialiang Gu, Raymond H. Ho +3 more

Existing quantum architecture search (QAS) methods typically treat quantum data embedding and circuit structures as independent components, leading to inefficient search processes and limited performance. We propose EAQAS, an embedding-aware QAS framework that explicitly models the joint representation of embedding operations and quantum gates using a Hierarchical Variational Graph Autoencoder (H-VGAE) with bi-directional cross-attention fusion. The framework integrates RepCap-based filtering for search space pruning, dual-branch encoders for modality-specific representation learning, and Bayesian optimization in the learned latent space. On binary classification tasks using MNIST and WDBC, EAQAS achieves accuracies of 99.28% and 97.01%, respectively. RepCap filtering at moderate thresholds ( \(\tau =0.3\) –0.5) accelerates search by 1.43–1.74× while fully preserving accuracy. Ablation studies confirm that cross-modal reconstruction is the most critical component, with its removal causing a 5.16% average performance drop. This work demonstrates that embedding-aware representation learning can enhance automated quantum circuit design under NISQ-compatible constraints.

EPJ Quantum Technology•Feb 18, 2026•0 citations
Quantum architecture search (QAS) has emerged to automate the design of high-performance quantum circuits under specific tasks and hardware constraints. We propose a noise-aware quantum architecture search (NA-QAS) framework based on variational quantum circuit design. By incorporating a noise model into the training of parameterized quantum circuits (PQCs) , the proposed framework identifies the noise-robust architectures. We introduce a hybrid Hamiltonian ε\varepsilonε -greedy strategy to optimize evaluation costs and circumvent local optima. Furthermore, an enhanced variable-depth NSGA-II algorithm is employed to navigate the vast search space, enabling an automated trade-off between architectural expressibility and quantum hardware overhead. The effectiveness of the framework is validated through binary classification and iris multi-classification tasks under a noisy condition. Compared to existing approaches, our framework can search for quantum architectures with superior performance and greater resource efficiency under a noisy condition.
Existing quantum architecture search (QAS) methods typically treat quantum data embedding and circuit structures as independent components, leading to inefficient search processes and limited performance. We propose EAQAS, an embedding-aware QAS framework that explicitly models the joint representation of embedding operations and quantum gates using a Hierarchical Variational Graph Autoencoder (H-VGAE) with bi-directional cross-attention fusion. The framework integrates RepCap-based filtering for search space pruning, dual-branch encoders for modality-specific representation learning, and Bayesian optimization in the learned latent space. On binary classification tasks using MNIST and WDBC, EAQAS achieves accuracies of 99.28% and 97.01%, respectively. RepCap filtering at moderate thresholds ( τ=0.3\tau =0.3τ=0.3 –0.5) accelerates search by 1.43–1.74× while fully preserving accuracy. Ablation studies confirm that cross-modal reconstruction is the most critical component, with its removal causing a 5.16% average performance drop. This work demonstrates that embedding-aware representation learning can enhance automated quantum circuit design under NISQ-compatible constraints.