HQNET: Harnessing Quantum Noise for Effective Training of Quantum Neural Networks in NISQ Era
Pith reviewed 2026-05-24 03:35 UTC · model grok-4.3
The pith
Choosing the right measurement observable allows quantum neural networks to train on up to 10 noisy qubits without barren plateaus halting progress.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The paper demonstrates that among PauliX, PauliY, PauliZ, and a customized Hermitian observable, the customized one is most robust to noise-induced barren plateaus when using a global cost function, permitting effective training of quantum neural networks with up to 10 qubits. With a local cost function, PauliZ outperforms the others up to 10 qubits. Simulations show that PauliX and PauliY lead to flatter landscapes under noise with global costs.
What carries the argument
The selection of the Hermitian observable for measurement, combined with global or local cost functions, which determines the cost landscape's trainability under depolarizing noise.
Load-bearing premise
The noise model used in the simulations captures the main effects that produce barren plateaus on actual NISQ hardware, and performance differences come from the observable rather than other factors.
What would settle it
Running the QNN training on a real 10-qubit NISQ device with the customized observable under global cost and observing whether the loss decreases meaningfully or remains flat.
Figures
read the original abstract
Effective training of Quantum Neural Networks (QNNs) is crucial in the Noisy Intermediate-Scale Quantum (NISQ) era, where noise accelerates the onset of barren plateaus (BPs) and limits scalability. This paper investigates how quantum noise impacts QNN trainability and demonstrates that careful selection of qubit measurement observables can mitigate these effects. We analyze PauliX, PauliY, PauliZ, and a customized Hermitian observable under both global (all-qubit measured) and local (single-qubit measured) cost functions. Our results show that with global cost function, PauliX and PauliY lead to flatter landscapes under noise, while PauliZ maintains training up to $8$ qubits before encountering BPs. The customized Hermitian observable proves most robust, enabling training up to $10$ qubits in noisy settings. For local cost function setting, PauliZ outperforms PauliX and PauliY, maintaining efficiency up to $10$ qubits. These findings highlight the importance of noise-aware observable selection, offering a practical strategy to improve QNN performance and advance quantum machine learning in noisy environments.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript claims that careful choice of measurement observables in QNNs can mitigate noise-induced barren plateaus. Simulations show PauliX/Y produce flatter landscapes under global costs, PauliZ sustains training to 8 qubits, and a customized Hermitian observable enables training to 10 qubits; under local costs PauliZ reaches 10 qubits while X/Y do not.
Significance. If the noise model and simulation protocol accurately capture dominant NISQ effects, the work supplies a concrete, observable-selection heuristic that could extend the practical reach of QNN training by 2–4 qubits without hardware changes. The empirical ranking of observables is falsifiable and directly actionable for circuit design.
major comments (2)
- [Abstract, §4] Abstract and §4 (Simulation Setup): the claim that the customized Hermitian observable is 'most robust' and enables training to 10 qubits rests on unspecified noise-channel parameters, circuit depth, shot counts, and error-bar reporting. Without these quantities it is impossible to judge whether the reported thresholds are statistically distinguishable from the Pauli cases or sensitive to unmodeled effects (readout, coherent, or correlated noise).
- [§3–4] §3–4 (Noise Model): the central attribution of performance differences to observable choice assumes the chosen depolarizing or amplitude-damping channels dominate barren-plateau formation identically to real hardware. No sensitivity analysis or hardware-validation experiment is described; if readout or crosstalk terms alter relative gradient variances, the ranking of observables would not hold.
minor comments (2)
- [Abstract] Abstract: the phrase 'customized Hermitian observable' is used without an explicit operator definition or construction rule; a one-line mathematical expression should appear at first mention.
- [Figure captions] Figure captions (assumed §5): axis labels and legend entries for 'global' vs 'local' cost functions should explicitly state the measured observable and the precise cost-function definition to avoid ambiguity.
Simulated Author's Rebuttal
We thank the referee for the constructive feedback. We address each major comment below and will revise the manuscript to enhance clarity on simulation parameters and noise-model assumptions.
read point-by-point responses
-
Referee: [Abstract, §4] Abstract and §4 (Simulation Setup): the claim that the customized Hermitian observable is 'most robust' and enables training to 10 qubits rests on unspecified noise-channel parameters, circuit depth, shot counts, and error-bar reporting. Without these quantities it is impossible to judge whether the reported thresholds are statistically distinguishable from the Pauli cases or sensitive to unmodeled effects (readout, coherent, or correlated noise).
Authors: We agree that explicit reporting is required for reproducibility. The revised manuscript will add a table in §4 listing all noise parameters (depolarizing probability, amplitude-damping rate), circuit depths, shot counts per expectation value, and error bars (standard deviation over repeated runs) together with a brief statistical comparison confirming that the 10-qubit threshold for the customized observable is distinguishable from the Pauli cases under the reported conditions. revision: yes
-
Referee: [§3–4] §3–4 (Noise Model): the central attribution of performance differences to observable choice assumes the chosen depolarizing or amplitude-damping channels dominate barren-plateau formation identically to real hardware. No sensitivity analysis or hardware-validation experiment is described; if readout or crosstalk terms alter relative gradient variances, the ranking of observables would not hold.
Authors: The depolarizing and amplitude-damping channels are the standard models employed in the barren-plateau literature to isolate observable effects. We will add a sensitivity analysis in the revision that varies noise strengths over a factor of two and shows the observable ranking remains stable. Hardware validation lies outside the scope of this simulation study; we will insert a limitations paragraph noting that unmodeled readout or crosstalk could affect the ranking and that experimental confirmation is needed. revision: partial
Circularity Check
No circularity; results are direct empirical simulation outputs with no self-referential reductions.
full rationale
The paper reports numerical simulation outcomes on how PauliX/Y/Z and a custom Hermitian observable affect QNN trainability thresholds (e.g., PauliZ up to 8 qubits globally, custom observable up to 10 qubits) under specified noise models and cost functions. These thresholds are presented as simulation results rather than quantities derived from equations, fitted parameters renamed as predictions, or self-citations. No load-bearing steps match the enumerated circularity patterns: there are no self-definitional observables, no fitted inputs called predictions, and no uniqueness theorems or ansatzes imported via citation. The derivation chain consists of independent circuit simulations, rendering the findings self-contained.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Standard quantum mechanics and common NISQ noise models (depolarizing, amplitude damping, etc.) govern the simulated circuits.
invented entities (1)
-
Customized Hermitian observable
no independent evidence
Forward citations
Cited by 1 Pith paper
-
Identifying Protein Co-regulatory Network Logic by Solving B-SAT Problems through Gate-based Quantum Computing
Grover's algorithm solves a B-SAT encoding of protein co-regulatory logic to recover high-likelihood Boolean models for a 5-protein neural development network from sparse data on quantum simulators and NISQ devices.
Reference graph
Works this paper leans on
-
[1]
Quantum Computing in the NISQ era and beyond,
J. Preskill, “Quantum Computing in the NISQ era and beyond,”Quan- tum, vol. 2, p. 79, Aug. 2018
work page 2018
-
[2]
Towards advantages of parameterized quantum pulses,
Z. Lianget al., “Towards advantages of parameterized quantum pulses,” arXiv, no. 2304.09253, 2023
-
[3]
Quantum circuit matrix product state ansatz for large-scale simulations of molecules,
Y . Fanet al., “Quantum circuit matrix product state ansatz for large-scale simulations of molecules,”arXiv, no. 2301.06376, 2023
-
[4]
Computational advantage in hybrid quantum neural networks: Myth or reality?
M. Kashifet al., “Computational advantage in hybrid quantum neural networks: Myth or reality?”arXiv:2412.04991, 2025
-
[5]
Nisq computing: where are we and where do we go?
J. W. Z. Lauet al., “Nisq computing: where are we and where do we go?”AAPPS Bulletin, vol. 32, no. 1, p. 27, 2022
work page 2022
-
[6]
Investigating the effect of noise on the training performance of hybrid quantum neural networks,
M. Kashifet al., “Investigating the effect of noise on the training performance of hybrid quantum neural networks,” in2024 International Joint Conference on Neural Networks (IJCNN). IEEE, 2024, pp. 1–10
work page 2024
-
[7]
Quantum advantage in cryptography,
R. Renner and R. Wolf, “Quantum advantage in cryptography,”AIAA Journal, vol. 61, no. 5, pp. 1895–1910, 2023
work page 1910
-
[8]
Quantum computing for near-term applications in generative chemistry and drug discovery,
A. Pyrkovet al., “Quantum computing for near-term applications in generative chemistry and drug discovery,”Drug Discovery Today, p. 103675, 2023
work page 2023
-
[9]
J. Biamonteet al., “Quantum machine learning,”Nature, vol. 549, no. 7671, pp. 195–202, sep 2017
work page 2017
-
[10]
Parameterized quantum circuits as machine learning models,
M. Benedettiet al., “Parameterized quantum circuits as machine learning models,”Quantum Science and Technology, vol. 4, no. 4, p. 043001, nov 2019
work page 2019
-
[11]
Next- generation quantum neural networks: Enhancing efficiency, security, and privacy,
N. Innan, M. Kashif, A. Marchisio, M. Bennai, and M. Shafique, “Next- generation quantum neural networks: Enhancing efficiency, security, and privacy,” in2025 IEEE 31st International Symposium on On-Line Testing and Robust System Design (IOLTS), 2025, pp. 1–4
work page 2025
-
[12]
Variational quantum algorithms,
M. Cerezoet al., “Variational quantum algorithms,”Nature Reviews Physics, vol. 3, no. 9, pp. 625–644, 2021
work page 2021
-
[13]
A survey on quantum machine learning: Current trends, challenges, opportunities, and the road ahead,
K. Zamanet al., “A survey on quantum machine learning: Current trends, challenges, opportunities, and the road ahead,” 2023
work page 2023
-
[14]
Classification with Quantum Neural Networks on Near Term Processors
E. Farhi and H. Neven, “Classification with quantum neural networks on near term processors,”arXiv, no. 1802.06002, 2018
work page internal anchor Pith review Pith/arXiv arXiv 2018
-
[15]
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, vol. 10, no. 23, p. 2980, 2021
work page 2021
-
[16]
Barren plateaus in quantum neural network training landscapes,
J. R. McCleanet al., “Barren plateaus in quantum neural network training landscapes,”Nature Communications, vol. 9, no. 1, nov 2018
work page 2018
-
[17]
Mitigating barren plateaus with transfer-learning-inspired parameter initializations,
H. Liuet al., “Mitigating barren plateaus with transfer-learning-inspired parameter initializations,”New Journal of Phys, vol. 25, no. 1, p. 013039, 2023
work page 2023
-
[18]
M. Kashifet al., “Alleviating barren plateaus in parameterized quantum machine learning circuits: Investigating advanced parameter initialization strategies,”arXiv, no. 2311.13218, 2023
-
[19]
Deep quanvolutional neural networks with enhanced trainability and gradient propagation,
M. Kashif and M. Shafique, “Deep quanvolutional neural networks with enhanced trainability and gradient propagation,”Scientific Reports, vol. 15, no. 1, p. 21764, 2025
work page 2025
-
[20]
Resqnets: a residual approach for mit- igating barren plateaus in quantum neural networks,
M. Kashif and S. Al-Kuwari, “Resqnets: a residual approach for mit- igating barren plateaus in quantum neural networks,”EPJ Quantum Technology, vol. 11, no. 1, p. 4, 2024
work page 2024
-
[21]
M. Kashif and M. Shafique, “The dilemma of random parameter initialization and barren plateaus in variational quantum algorithms,” in 2024 IEEE International Conference on Rebooting Computing (ICRC). IEEE, 2024, pp. 1–8
work page 2024
-
[22]
Entanglement-induced barren plateaus,
O. Marreroet al., “Entanglement-induced barren plateaus,”PRX Quan- tum, vol. 2, p. 040316, Oct 2021
work page 2021
-
[23]
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
work page 2023
-
[24]
Cost function dependent barren plateaus in shallow parametrized quantum circuits,
M. Cerezoet al., “Cost function dependent barren plateaus in shallow parametrized quantum circuits,”Nat. Comms, vol. 12, no. 1, 2021
work page 2021
-
[25]
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, vol. 4, no. 1, p. 015004, jan 2023
work page 2023
-
[26]
Quantum neural networks: A comparative analysis and noise robustness evaluation,
T. Ahmedet al., “Quantum neural networks: A comparative analysis and noise robustness evaluation,”arXiv preprint arXiv:2501.14412, 2025
-
[27]
Noise-induced barren plateaus in variational quantum algorithms,
S. Wanget al., “Noise-induced barren plateaus in variational quantum algorithms,”Nature Communications, vol. 12, no. 1, nov 2021
work page 2021
-
[28]
Noisy hqnns: A comprehensive analysis of noise ro- bustness in hybrid quantum neural networks,
T. Ahmedet al., “Noisy hqnns: A comprehensive analysis of noise ro- bustness in hybrid quantum neural networks,”arXiv:2505.03378, 2025
-
[29]
Nrqnn: The role of observable selection in noise-resilient quantum neural networks,
M. Kashif and M. Shafique, “Nrqnn: The role of observable selection in noise-resilient quantum neural networks,”arXiv:2502.12637, 2025
-
[30]
Pennylane: Automatic differentiation of hybrid quantum-classical computations,
V . Bergholmet al., “Pennylane: Automatic differentiation of hybrid quantum-classical computations,”arXiv, 2018
work page 2018
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.