DistributedEstimator: Distributed Training of Quantum Neural Networks via Circuit Cutting
Circuit cutting decomposes a large quantum circuit into smaller subcircuits executed independently; expectation values are recovered by classically combining subcircuit outcomes. Prior work characterises cutting overhead via subcircuit counts and sampling complexity, but its end-to-end impact on iterative, estimator-driven training pipelines remains under-measured from a systems perspective. We propose DistributedEstimator, a cut-aware estimator execution pipeline that treats circuit cutting as a staged distributed workload, instrumenting each query across four phases: partitioning, subexperiment generation, parallel execution, and classical reconstruction. Using logged runtime traces and learning outcomes on two binary classification workloads (Iris and MNIST), we quantify cutting overheads, scaling limits, and sensitivity to injected stragglers, and assess whether accuracy and robustness are preserved under matched training budgets. Reconstruction dominates per-query time -- a median of 53% and 95th percentile of 58% at three cuts -- bounding achievable speed-up under parallelism. Despite this, test accuracy is fully preserved on Iris and maintained without systematic degradation on MNIST across all cut configurations. Robustness under Gaussian noise and FGSM perturbations is similarly preserved, with several configurations matching or improving on the uncut baseline. Exponential growth of subexperiment counts (${O}(9^c)$ for CNOT-based decomposition) is a fundamental barrier limiting practical experimentation to small qubit counts. These results establish that practical scaling for learning workloads requires reducing and overlapping reconstruction, scheduling policies for barrier-dominated critical paths, and computationally efficient reconstruction strategies for larger qubit counts.
Code (0)
등록된 구현이 없습니다.
Tasks
Binary ClassificationSimilar Papers 제목 키워드 기반
Adversarial Robustness in Distributed Quantum Machine Learning
Studying adversarial robustness of quantum machine learning (QML) models is essential in order to understand their potential advantages over classical models and build trustworthy systems. Distributing QML models allows …
Quantum Machine LearningAdversarial RobustnessFederated LearningAn Invitation to Distributed Quantum Neural Networks
Deep neural networks have established themselves as one of the most promising machine learning techniques. Training such models at large scales is often parallelized, giving rise to the concept of distributed deep learni…
Quantum Machine LearningAdversarial Robustness of Partitioned Quantum Classifiers
Adversarial robustness in quantum classifiers is a critical area of study, providing insights into their performance compared to classical models and uncovering potential advantages inherent to quantum machine learning. …
Adversarial RobustnessQuantum Machine LearningQNAS: A Neural Architecture Search Framework for Accurate and Efficient Quantum Neural Networks
Designing quantum neural networks (QNNs) that are both accurate and deployable on NISQ hardware is challenging. Handcrafted ansatze must balance expressivity, trainability, and resource use, while limited qubits often ne…
Neural Architecture SearchToward Large-Scale Distributed Quantum Long Short-Term Memory with Modular Quantum Computers
In this work, we introduce a Distributed Quantum Long Short-Term Memory (QLSTM) framework that leverages modular quantum computing to address scalability challenges on Noisy Intermediate-Scale Quantum (NISQ) devices. By …