Searcharxiv⌕ Search

arXiv · 2610.11261

Q-Capsule: A Localized Capsule-Based Quantum Neural Architecture for Barren Plateau Mitigation

Abstract

Variational quantum algorithms are often limited by barren plateaus: gradients vanish as circuit size and depth increase, making quantum neural networks difficult to train. We propose Q-Capsule, a localized capsule-based quantum neural architecture that mitigates this problem through register partitioning, local readout, sparse inter-capsule coupling, trainable data re-uploading, and Quantum Fisher Information Matrix (QFIM)-guided adaptive depth growth. By restricting the dominant support of each observable to a small capsule and controlling inter-capsule entanglement, Q-Capsule preserves useful gradient signals while retaining communication between local quantum representations. As the register width increases, Q-Capsule consistently maintains stable gradient variance, whereas globally entangling baselines exhibit exponential suppression with a log-gradient-variance slope near -ln 2 per qubit. Q-Capsule also produces more structured optimization landscapes, higher parameter efficiency, improved robustness to depolarizing noise, and lower measurement requirements. Its adaptive policy achieves 98.1% accuracy on binary classification and 97.7% on four-class classification, while using approximately 73% fewer two-qubit gates than the fixed-deep model on the multiclass task.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Awal Ahmed Fime, Tasfia Zaman Samiha, Saika Zaman, Dimitris Pados, George Sklivanitis, Abdur R. Shahid, Ahmed Imteaj. 2026-10-08. Q-Capsule: A Localized Capsule-Based Quantum Neural Architecture for Barren Plateau Mitigation. https://arxiv.org/abs/2610.11261

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Cavity-mediated cross-cross-resonance gate

We propose a cavity-mediated gate between two transmon qubits or other nonlinear superconducting elements. The gate is realized by driving both qubits at a frequency that is near-resonant with the frequency of the cavity. Since both qubits are subject to a cross-resonant drive, we call this gate a cross-cross-resonance gate. In close analogy with gates between trapped-ion qubits, in phase space, the state of the cavity makes a circle whose area depends on the state of the two qubits, realizing a controlled-phase gate. We propose two schemes for canceling the dominant error, which is the qubit-cavity dispersive coupling. We also show that this cross-cross-resonance gate allows one to realize simultaneous gates between multiple pairs of qubits coupled via the same metamaterial composed of an array of coupled cavities or other linear mediators.

quant-ph↗

Clifford and Haar scramblers yield equal mean fidelity but unequal fluctuations in black hole-inspired teleportation

Quantum information transfer between entangled black holes has inspired many-body teleportation protocols. We study such a protocol without assuming a gravitational dual and ask whether its fidelity requires nonstabilizerness, or magic, in the scrambling dynamics. Because the mean fidelity depends only on the third moments of the scrambler ensemble, zero-magic Clifford scramblers teleport on average as well as Haar-random unitaries. Solving the protocol exactly at infinite temperature, we find that typical Clifford scramblers approach perfect teleportation while the magic of the complete circuit vanishes as the inverse system size. The two ensembles nevertheless differ in their fluctuations: the exact Clifford fidelity variance decays only algebraically with system size, whereas the Haar variance is exponentially small. This separation characterizes the ensembles rather than magic itself, since magic added away from the message qubit can leave every fidelity statistic unchanged. With a decoder uncorrelated with the scrambler, every unitary 2-design leaves the mean fidelity at the no-transfer value, whatever its magic.

quant-ph↗

An Information-Theoretic Principle for Optimal Quantum Encoding: Tight Frames and Equiangular Ensembles

Optimal encoding of classical data for quantum-assisted statistical inference is investigated from an information-theoretic perspective. We prove that the accuracy of any quantum-computing inference procedure is upper bounded by the maximal quantum leakage from the classical data through its quantum encoding, establishing leakage as a universal, task-agnostic quality measure for encoders. The optimal encoding strategy, i.e., an encoding strategy that maximizes the maximal quantum leakage, is proved to be attained by pure states. When there are enough qubits, basis encoding is proved to be universally optimal. However, when the dimension of the system is small, phase encoding is optimal. For the latter, the optimal encoding is not unique. That is, any tight frame, any ensemble whose average state is the maximally mixed state, is in fact optimal. Within tight frames, equiangular tight frames (ETFs) are distinguished as the uniquely symmetric optimal encodings, i.e., they saturate the Welch lower bound on pairwise overlaps. Prominent special cases are the qubit trine, the regular simplex, and symmetric informationally complete positive operator-valued measures (SIC-POVMs), for which the ETF structure and explicit codeword constructions are provided. Numerical examples are presented to validate the theoretical predictions.

quant-ph↗