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

Journal of Quantum Artificial Intelligence

Diffusion-Driven Synthesis of Parameterized Quantum Circuits for Efficient Hybrid Deep Learning Pipelines

Ariel Christopher Wawolangi

Published May 1, 2026• 0 citations
Publisher

Abstract

Hybrid quantum–classical deep learning increasingly relies on Parameterized Quantum Circuits (PQCs) as differentiable feature layers, yet practical deployment remains constrained by manual ansatz design, low-yield architecture search, and instability under hardware connectivity and shot-noise limits. This study introduces a diffusion-driven PQC synthesis framework that generates discrete gate-token architectures via conditional denoising, enforcing feasibility through constraint-aware masking and shaping candidate quality through preference-weighted training and screening-based selection. Under matched compute budgets across baselines, the proposed method achieves a higher valid-circuit yield and concentrates candidates in favorable performance–complexity regions. In comparative evaluation, diffusion-driven synthesis improves average downstream task performance to 0.80 with reduced variance (±0.02) while lowering average circuit complexity to 62 relatives to hand-designed ansätze (0.76 ± 0.03, complexity 82), evolutionary search (0.73 ± 0.04, complexity 97), and random sampling (0.69 ± 0.05, complexity 88). Screening efficiency increases through a higher screening-to-top-kkk yield, reducing wasted training runs attributable to infeasible connectivity or stalled optimization. Ablation results indicate that constraint masking is the primary driver of feasibility and candidate yield, while conditioning improves task alignment and preference weighting reduces performance variance by concentrating sampling probability on high-potential motifs. Overall, the findings demonstrate that diffusion-guided generation can serve as a scalable synthesis mechanism for producing deployable PQCs that improve hybrid learning performance without inflating circuit depth or two-qubit gate counts.

DOI
10.63913/jqai.v1i1.1

Related papers

Leveraging Diffusion Models for Parameterized Quantum Circuit Generation

Daniel Barta, Darya Martyniuk, Johannes Jung +1 more

Quantum computing holds immense potential, yet its practical success depends on multiple factors, including advances in quantum circuit design. In this paper, we introduce a generative approach based on denoising diffusion models (DMs) to synthesize parameterized quantum circuits (PQCs). Extending the recent diffusion model pipeline of [1], our model effectively conditions the synthesis process, enabling the simultaneous generation of circuit architectures and their continuous gate parameters. We demonstrate our approach in synthesizing PQCs optimized for generating high-fidelity Greenberger-Horne-Zeilinger (GHZ) states and achieving high accuracy in quantum machine learning (QML) classification tasks. Our Results indicate a strong generalization across varying gate sets and scaling qubit counts, highlighting the versatility and computational efficiency of diffusion-based methods. This work illustrates the potential of generative models as a powerful tool for accelerating and optimizing the design of PQCs, supporting the development of more practical and scalable quantum applications.

arXiv:2505.20863•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•6 citations

Thermal Noise Mitigation Algorithms for Quantum Enhanced Neural Network Training

P. Sagayaraj, Dr.G.H Kerinab Beenu, M Vinitha +1 more

Although quantum computers will not necessarily transform ML in general, they hold immense potential for specific uses, such as dealing with high-dimensional data and complex correlations that cannot be effectively modeled using classical systems. It is, however, difficult to design efficient quantum circuits, especially with the existing Noisy Intermediate-Scale Quantum (NISQ) hardware that has constraints including decoherence, a limited number of qubits, and gate fidelity limitations. The authors propose an Adaptive Quantum Circuit Architecture Search (AQCAS) framework whose structure and parameters are optimized dynamically to improve the performance of the task-specific ML. The framework integrates quantum circuit encoding, a hybrid search strategy that is based on reinforcement learning and evolutionary algorithms, and a task-specific adaptivity mechanism. Benchmark datasets were used for experimental evaluations of both simulation using Qiskit Aer and classical optimization using the Python frameworks TensorFlow and PennyLane. Fixed and standard variational quantum circuits were compared with performance measurements like the classification accuracy, circuit depth, convergence speed, and computational efficiency. The results show that the accuracy of AQCAS can be raised to 94.1%, and the circuit depth is lowered at the same time. It converged rapidly and is computationally efficient. Ablation studies show that both hybrid search and adaptivity mechanisms help to enhance generalization and stability under NISQ constraints. The results demonstrate the potential of AQCAS as a practical approach to using adaptive quantum circuits in specialized ML applications, and lay the groundwork for future development of scaling to larger devices, implementing noise-aware optimization, and integrating with hybrid quantum-classical ML pipelines.

International Journal of Artificial Intelligence and Machine Learning•May 24, 2026•0 citations

Hybrid diffusion-optimization for quantum synthesis with continuous native gates

Dajun Guo, Chukun Hu, Xiaolu Su

Abstract Quantum circuit synthesis becomes increasingly challenging as system sizes grow and hardware-native gate sets diversify. Denoising diffusion models have recently been applied to quantum circuit synthesis as an alternative to expensive classical optimization. Existing diffusion-based approaches, however, either operate on discrete gate alphabets or separate gate identities and continuous parameters into different generative streams, which raises the question of whether a unified representation can more naturally encode structure–parameter dependencies. We propose a hybrid diffusion–optimization framework for quantum circuit synthesis with continuous native gates. Taking a trapped-ion-inspired native gate set as a representative example, our single-stream diffusion model operates directly on a continuous-parameter gate set { R X ( θ ), R Y ( θ ), R XX ( θ )} and produces fully parameterized circuits in a single diffusion sampling run. A lightweight gradient-based post-optimization of the continuous parameters, based on the process infidelity, then corrects residual stochastic errors. Trained and evaluated on random three-qubit unitaries, the model generates compact circuits that accurately approximate unseen targets. Under identical training conditions, the continuous-gate formulation achieves substantially lower process infidelity than both random-circuit and a discrete-gate diffusion baseline. Furthermore, applying gradient-based post-optimization to the continuous-gate diffusion output yields a significant additional improvement in fidelity compared with the same model without post-optimization, demonstrating that this refinement step is an effective strategy for correcting residual stochastic errors in the diffusion-generated parameters. These results point to a practical route toward continuous-parameter quantum circuit synthesis in native gate sets.

Physica Scripta•May 7, 2026•0 citations

Adaptive Quantum Circuit Architecture Search Algorithms for Specialized ML Tasks

Dr.V. Aruna, Ponmurugan Panneerselvam, P. Pushpalatha

Quantum Machine Learning (QML) utilizes the principles of quantum computations to improve the performance of learning by the use of parameterized quantum circuits and variational algorithms. But despite the qubit number, circuit depth, and patterns of entanglement, creating the optimal quantum circuit architectures for particular machine learning applications remains an important problem. Fixed circuits, or classical Neural Architecture Search (NAS), are not enough to transfer knowledge to other tasks and/or to search the quantum search space efficiently. In this context, this paper presents an Adaptive Quantum Circuit Architecture Search (AQ CAS) framework that dynamically generates and optimizes quantum circuit architectures using a hybrid search algorithm that integrates reinforcement learning, evolutionary operators, and evaluation without gradient. AQ CAS involves a task-specific feedback mechanism to eliminate those candidates that perform poorly and concentrate the search on those candidates with good performance. The framework is evaluated on benchmark data sets such as Iris, synthetic classical ML tasks, and hybrid quantum-classical tasks, and compared to fixed circuits, existing quantum NAS methods, and classical machine learning models. Experimental results indicate that AQ CAS can achieve higher accuracy for the task, using fewer qubits, fewer layers, and less training time, which further shows the need for adaptivity and task specialization. These results inform us about efficient hybrid classical-quantum pipelines, and give a glimpse of the directions that adaptive architecture search might take in enabling scalable and practical QML deployment.

International Journal of Artificial Intelligence and Machine Learning•May 24, 2026•0 citations

Investigating Quantum Circuit Designs Using Neuro-Evolution

Devroop Kar, Daniel E. Krutz, Travis Desell

Designing effective quantum circuits remains a central challenge in quantum computing, as circuit structure strongly influences expressivity, trainability, and hardware feasibility. Current approaches, whether using manually designed circuit templates, fixed heuristics, or automated rules, face limitations in scalability, flexibility, and adaptability, often producing circuits that are poorly matched to the specific problem or quantum hardware. In this work, we propose the Evolutionary eXploration of Augmenting Quantum Circuits (EXAQC), an evolutionary approach to the automated design and training of parameterized quantum circuits (PQCs) which leverages and extends on strategies from neuroevolution and genetic programming. The proposed method jointly searches over gate types, qubit connectivity, parameterization, and circuit depth while respecting hardware and noise constraints. The method supports both Qiskit and Pennylane libraries, allowing the user to configure every aspect. This work highlights evolutionary search as a critical tool for advancing quantum machine learning and variational quantum algorithms, providing a principled pathway toward scalable, problem-aware, and hardware-efficient quantum circuit design. Preliminary results demonstrate that circuits evolved on classification tasks are able to achieve over 90% accuracy on most of the benchmark datasets with a limited computational budget, and are able to emulate target circuit quantum states with high fidelity scores.

arXiv:2602.03840•Genetic and Evolutionary Computation Conference Companion (GECCO Companion)•Jul 13, 2026•1 citation

A Generative AI-Assisted Framework for Mitigating Barren Plateaus in Hybrid Quantum-Classical Large Language Model Fine-Tuning

Arvindhan M, Azween Abdullah, Daniel Arockiam

Although recent advances in transfer learning have simplified training, fine-tuning big language models remains an energy-intensive and expensive process, with high hardware and energy costs that make it difficult to use and scale. While quantum machine learning (QML) presents a promising theoretical tool to overcome these bottlenecks, the practical implementation is hampered by the barren plateau problem, a phenomenon well established in literature that manifests through exponentially vanishing gradients of deep parameterized quantum circuits (PQCs) with increasing circuit depth, preventing informative parameter updates by rendering the optimization landscape flat. This study presents a hybrid quantum-classical architecture in which a PQC layer is integrated into a pretrained classical LLM backbone and fine-tuned throughout this work. This iterative refinement loop is controlled by an Expected Improvement acquisition function, which actively guides the search process through parameter regimes with obvious non-vanishing gradient variance. The study proposes that this theory-driven initialization scheme reduces the onset of barren plateaus, thereby enabling efficient and stable convergence in hybrid optimization. Experiments show that the proposed method consistently outperforms purely classical fine-tuning baselines and randomly initialized quantum baselines on representative downstream natural language processing tasks. The experimental results show that principled parameter initialization leads to concrete improvements in convergence stability, gradient trainability, and task-level performance. In summary, this research provides a scalable method for integrating near-term noisy intermediate-scale Quantum (NISQ) devices into state-of-the-art deep learning pipelines, fostering the further real-world adoption of hybrid quantum-classical systems for demanding artificial intelligence tasks.

International Journal of Computer Information Systems and Industrial Management Applications•Aug 19, 2026•0 citations
Hybrid quantum–classical deep learning increasingly relies on Parameterized Quantum Circuits (PQCs) as differentiable feature layers, yet practical deployment remains constrained by manual ansatz design, low-yield architecture search, and instability under hardware connectivity and shot-noise limits. This study introduces a diffusion-driven PQC synthesis framework that generates discrete gate-token architectures via conditional denoising, enforcing feasibility through constraint-aware masking and shaping candidate quality through preference-weighted training and screening-based selection. Under matched compute budgets across baselines, the proposed method achieves a higher valid-circuit yield and concentrates candidates in favorable performance–complexity regions. In comparative evaluation, diffusion-driven synthesis improves average downstream task performance to 0.80 with reduced variance (±0.02) while lowering average circuit complexity to 62 relatives to hand-designed ansätze (0.76 ± 0.03, complexity 82), evolutionary search (0.73 ± 0.04, complexity 97), and random sampling (0.69 ± 0.05, complexity 88). Screening efficiency increases through a higher screening-to-top-kkk yield, reducing wasted training runs attributable to infeasible connectivity or stalled optimization. Ablation results indicate that constraint masking is the primary driver of feasibility and candidate yield, while conditioning improves task alignment and preference weighting reduces performance variance by concentrating sampling probability on high-potential motifs. Overall, the findings demonstrate that diffusion-guided generation can serve as a scalable synthesis mechanism for producing deployable PQCs that improve hybrid learning performance without inflating circuit depth or two-qubit gate counts.
Quantum computing holds immense potential, yet its practical success depends on multiple factors, including advances in quantum circuit design. In this paper, we introduce a generative approach based on denoising diffusion models (DMs) to synthesize parameterized quantum circuits (PQCs). Extending the recent diffusion model pipeline of [1], our model effectively conditions the synthesis process, enabling the simultaneous generation of circuit architectures and their continuous gate parameters. We demonstrate our approach in synthesizing PQCs optimized for generating high-fidelity Greenberger-Horne-Zeilinger (GHZ) states and achieving high accuracy in quantum machine learning (QML) classification tasks. Our Results indicate a strong generalization across varying gate sets and scaling qubit counts, highlighting the versatility and computational efficiency of diffusion-based methods. This work illustrates the potential of generative models as a powerful tool for accelerating and optimizing the design of PQCs, supporting the development of more practical and scalable quantum applications.
Although quantum computers will not necessarily transform ML in general, they hold immense potential for specific uses, such as dealing with high-dimensional data and complex correlations that cannot be effectively modeled using classical systems. It is, however, difficult to design efficient quantum circuits, especially with the existing Noisy Intermediate-Scale Quantum (NISQ) hardware that has constraints including decoherence, a limited number of qubits, and gate fidelity limitations. The authors propose an Adaptive Quantum Circuit Architecture Search (AQCAS) framework whose structure and parameters are optimized dynamically to improve the performance of the task-specific ML. The framework integrates quantum circuit encoding, a hybrid search strategy that is based on reinforcement learning and evolutionary algorithms, and a task-specific adaptivity mechanism. Benchmark datasets were used for experimental evaluations of both simulation using Qiskit Aer and classical optimization using the Python frameworks TensorFlow and PennyLane. Fixed and standard variational quantum circuits were compared with performance measurements like the classification accuracy, circuit depth, convergence speed, and computational efficiency. The results show that the accuracy of AQCAS can be raised to 94.1%, and the circuit depth is lowered at the same time. It converged rapidly and is computationally efficient. Ablation studies show that both hybrid search and adaptivity mechanisms help to enhance generalization and stability under NISQ constraints. The results demonstrate the potential of AQCAS as a practical approach to using adaptive quantum circuits in specialized ML applications, and lay the groundwork for future development of scaling to larger devices, implementing noise-aware optimization, and integrating with hybrid quantum-classical ML pipelines.
Abstract Quantum circuit synthesis becomes increasingly challenging as system sizes grow and hardware-native gate sets diversify. Denoising diffusion models have recently been applied to quantum circuit synthesis as an alternative to expensive classical optimization. Existing diffusion-based approaches, however, either operate on discrete gate alphabets or separate gate identities and continuous parameters into different generative streams, which raises the question of whether a unified representation can more naturally encode structure–parameter dependencies. We propose a hybrid diffusion–optimization framework for quantum circuit synthesis with continuous native gates. Taking a trapped-ion-inspired native gate set as a representative example, our single-stream diffusion model operates directly on a continuous-parameter gate set { R X ( θ ), R Y ( θ ), R XX ( θ )} and produces fully parameterized circuits in a single diffusion sampling run. A lightweight gradient-based post-optimization of the continuous parameters, based on the process infidelity, then corrects residual stochastic errors. Trained and evaluated on random three-qubit unitaries, the model generates compact circuits that accurately approximate unseen targets. Under identical training conditions, the continuous-gate formulation achieves substantially lower process infidelity than both random-circuit and a discrete-gate diffusion baseline. Furthermore, applying gradient-based post-optimization to the continuous-gate diffusion output yields a significant additional improvement in fidelity compared with the same model without post-optimization, demonstrating that this refinement step is an effective strategy for correcting residual stochastic errors in the diffusion-generated parameters. These results point to a practical route toward continuous-parameter quantum circuit synthesis in native gate sets.
Quantum Machine Learning (QML) utilizes the principles of quantum computations to improve the performance of learning by the use of parameterized quantum circuits and variational algorithms. But despite the qubit number, circuit depth, and patterns of entanglement, creating the optimal quantum circuit architectures for particular machine learning applications remains an important problem. Fixed circuits, or classical Neural Architecture Search (NAS), are not enough to transfer knowledge to other tasks and/or to search the quantum search space efficiently. In this context, this paper presents an Adaptive Quantum Circuit Architecture Search (AQ CAS) framework that dynamically generates and optimizes quantum circuit architectures using a hybrid search algorithm that integrates reinforcement learning, evolutionary operators, and evaluation without gradient. AQ CAS involves a task-specific feedback mechanism to eliminate those candidates that perform poorly and concentrate the search on those candidates with good performance. The framework is evaluated on benchmark data sets such as Iris, synthetic classical ML tasks, and hybrid quantum-classical tasks, and compared to fixed circuits, existing quantum NAS methods, and classical machine learning models. Experimental results indicate that AQ CAS can achieve higher accuracy for the task, using fewer qubits, fewer layers, and less training time, which further shows the need for adaptivity and task specialization. These results inform us about efficient hybrid classical-quantum pipelines, and give a glimpse of the directions that adaptive architecture search might take in enabling scalable and practical QML deployment.
Designing effective quantum circuits remains a central challenge in quantum computing, as circuit structure strongly influences expressivity, trainability, and hardware feasibility. Current approaches, whether using manually designed circuit templates, fixed heuristics, or automated rules, face limitations in scalability, flexibility, and adaptability, often producing circuits that are poorly matched to the specific problem or quantum hardware. In this work, we propose the Evolutionary eXploration of Augmenting Quantum Circuits (EXAQC), an evolutionary approach to the automated design and training of parameterized quantum circuits (PQCs) which leverages and extends on strategies from neuroevolution and genetic programming. The proposed method jointly searches over gate types, qubit connectivity, parameterization, and circuit depth while respecting hardware and noise constraints. The method supports both Qiskit and Pennylane libraries, allowing the user to configure every aspect. This work highlights evolutionary search as a critical tool for advancing quantum machine learning and variational quantum algorithms, providing a principled pathway toward scalable, problem-aware, and hardware-efficient quantum circuit design. Preliminary results demonstrate that circuits evolved on classification tasks are able to achieve over 90% accuracy on most of the benchmark datasets with a limited computational budget, and are able to emulate target circuit quantum states with high fidelity scores.
Although recent advances in transfer learning have simplified training, fine-tuning big language models remains an energy-intensive and expensive process, with high hardware and energy costs that make it difficult to use and scale. While quantum machine learning (QML) presents a promising theoretical tool to overcome these bottlenecks, the practical implementation is hampered by the barren plateau problem, a phenomenon well established in literature that manifests through exponentially vanishing gradients of deep parameterized quantum circuits (PQCs) with increasing circuit depth, preventing informative parameter updates by rendering the optimization landscape flat. This study presents a hybrid quantum-classical architecture in which a PQC layer is integrated into a pretrained classical LLM backbone and fine-tuned throughout this work. This iterative refinement loop is controlled by an Expected Improvement acquisition function, which actively guides the search process through parameter regimes with obvious non-vanishing gradient variance. The study proposes that this theory-driven initialization scheme reduces the onset of barren plateaus, thereby enabling efficient and stable convergence in hybrid optimization. Experiments show that the proposed method consistently outperforms purely classical fine-tuning baselines and randomly initialized quantum baselines on representative downstream natural language processing tasks. The experimental results show that principled parameter initialization leads to concrete improvements in convergence stability, gradient trainability, and task-level performance. In summary, this research provides a scalable method for integrating near-term noisy intermediate-scale Quantum (NISQ) devices into state-of-the-art deep learning pipelines, fostering the further real-world adoption of hybrid quantum-classical systems for demanding artificial intelligence tasks.