Graph-Based Bayesian Optimization for Quantum Circuit Architecture Search with Uncertainty Calibrated Surrogates
- URL: http://arxiv.org/abs/2512.09586v1
- Date: Wed, 10 Dec 2025 12:23:04 GMT
- Title: Graph-Based Bayesian Optimization for Quantum Circuit Architecture Search with Uncertainty Calibrated Surrogates
- Authors: Prashant Kumar Choudhary, Nouhaila Innan, Muhammad Shafique, Rajeev Singh,
- Abstract summary: We present an automated framework that discovers and refines variational quantum circuits.<n>Circuits are represented as graphs and mutated and selected via an expected improvement acquisition function.<n>The GNN-guided pipeline consistently finds circuits with lower complexity and competitive or superior classification accuracy.
- Score: 2.271697926182248
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Quantum circuit design is a key bottleneck for practical quantum machine learning on complex, real-world data. We present an automated framework that discovers and refines variational quantum circuits (VQCs) using graph-based Bayesian optimization with a graph neural network (GNN) surrogate. Circuits are represented as graphs and mutated and selected via an expected improvement acquisition function informed by surrogate uncertainty with Monte Carlo dropout. Candidate circuits are evaluated with a hybrid quantum-classical variational classifier on the next generation firewall telemetry and network internet of things (NF-ToN-IoT-V2) cybersecurity dataset, after feature selection and scaling for quantum embedding. We benchmark our pipeline against an MLP-based surrogate, random search, and greedy GNN selection. The GNN-guided optimizer consistently finds circuits with lower complexity and competitive or superior classification accuracy compared to all baselines. Robustness is assessed via a noise study across standard quantum noise channels, including amplitude damping, phase damping, thermal relaxation, depolarizing, and readout bit flip noise. The implementation is fully reproducible, with time benchmarking and export of best found circuits, providing a scalable and interpretable route to automated quantum circuit discovery.
Related papers
- 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) - Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
arXiv Detail & Related papers (2026-01-10T02:36:03Z) - Design and Optimization of Adaptive Diversity Schemes in Quantum MIMO Channels [45.812053169933705]
We study an adaptive diversity strategy for discrete-variable QuMIMO systems based on universal asymmetric cloning at the transmitter and probabilistic purification at the receiver.<n>Results show that the proposed scheme yields significant fidelity gains in crosstalk-dominated settings and automatically adapts to channel symmetry and channel conditions.<n>This work provides design guidelines for future QuMIMO systems and establishes a robust baseline for more advanced transmission and decoding strategies.
arXiv Detail & Related papers (2025-11-19T15:58:10Z) - FlowQ-Net: A Generative Framework for Automated Quantum Circuit Design [8.70817825961863]
We introduce textscFlowQ-Net (Flow-based Quantum design Network), a generative framework for automated quantum circuit synthesis.<n>This framework learns a policy to construct circuits sequentially, sampling them in to a flexible user-defined reward function.<n>We demonstrate the efficacy of textscFlowQ-Net through an extensive set of simulations.
arXiv Detail & Related papers (2025-10-30T16:57:13Z) - VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
arXiv Detail & Related papers (2025-06-12T01:38:15Z) - Genetic Transformer-Assisted Quantum Neural Networks for Optimal Circuit Design [3.6953740776904924]
We introduce Genetic Transformer Assisted Quantum Neural Networks (GTQNNs)<n>GTQNNs are a hybrid learning framework that combines a transformer encoder with a shallow variational quantum circuit.<n>Experiments on four benchmarks show that GTQNNs match or exceed state of the art quantum models.
arXiv Detail & Related papers (2025-06-10T19:49:21Z) - RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [44.13836547616739]
Variational Quantum Algorithms (VQAs) are a promising approach to leverage Noisy Intermediate-Scale Quantum (NISQ) computers.<n> choosing optimal quantum circuits that efficiently solve a given VQA problem is a non-trivial task.<n>Quantum Architecture Search (QAS) algorithms enable automatic generation of quantum circuits tailored to the provided problem.
arXiv Detail & Related papers (2025-06-04T08:30:35Z) - Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems.
In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems.
We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
arXiv Detail & Related papers (2024-04-17T11:00:12Z) - Reinforcement learning-assisted quantum architecture search for variational quantum algorithms [0.0]
This thesis focuses on identifying functional quantum circuits in noisy quantum hardware.
We introduce a tensor-based quantum circuit encoding, restrictions on environment dynamics to explore the search space of possible circuits efficiently.
In dealing with various VQAs, our RL-based QAS outperforms existing QAS.
arXiv Detail & Related papers (2024-02-21T12:30:39Z) - A hybrid quantum-classical classifier based on branching multi-scale
entanglement renormalization ansatz [5.548873288570182]
This paper proposes a quantum semi-supervised classifier based on label propagation.
Considering the difficulty of graph construction, we develop a variational quantum label propagation (VQLP) method.
In this method, a locally parameterized quantum circuit is created to reduce the parameters required in the optimization.
arXiv Detail & Related papers (2023-03-14T13:46:45Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z)
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.