arXiv:2607. 10707v1 Announce Type: cross Abstract: We propose a unified meta-decoding framework for quantum error correction that learns syndrome-to-recovery mappings across multiple stabilizer codes and noise settings, without requiring separate decoders for each configuration.
arXiv:2607. 05814v1 Announce Type: cross Abstract: Real-time decoding is a major bottleneck in scaling quantum error correction (QEC) from noisy intermediate-scale quantum (NISQ) devices to fault-tolerant quantum computing.
arXiv:2607. 19563v1 Announce Type: cross Abstract: Quantum error correction can be enhanced by post-selecting out runs that are likely to produce a logical failure, but the most accurate measures for that require costly decoder-level information.
arXiv:2607. 28422v1 Announce Type: new Abstract: Fault-tolerant quantum computing (FTQC) relies on quantum error correction to suppress physical errors and preserve logical information at scale.
The paper introduces QEMScore, a metric that compares learned quantum error mitigators to capacity‑matched controls that do not use measurement data. Using simulated circuits with exact ideal answers, the study finds that many mitigators gain little from measurement inputs, with a plain polynomial model often outperforming them. On real hardware data, however, measurement inputs can provide predictive benefits, highlighting that performance depends on representation and protocol specifics.
arXiv:2604.21863v2 Announce Type: replace-cross Abstract: Deep reinforcement learning for quantum circuit optimization faces three bottlenecks: replay buffers that overlook temporal difference (TD) t...
arXiv:2607.21411v1 Announce Type: cross Abstract: Quantum transfer learning (QTL) is often evaluated by replacing a classical classifier with a fixed variational quantum head, but this hides a key qu...
The paper proposes a hybrid, learning‑based strategy for selecting quantum error‑correcting codes at each concatenation level. By estimating the effective noise channel after each level, the method chooses small, non‑additive encoders when the noise has structure and switches to standard codes as the noise becomes uniform. Simulations show that this adaptive approach can achieve a target logical error rate with up to two orders of magnitude fewer qubits than using stabilizer codes alone for strongly structured noise.
arXiv:2504. 05336v4 Announce Type: replace-cross Abstract: A recurring weakness in quantum machine learning (QML) is that reported ``quantum advantages'' are seldom tested against a \emph{capacity-matched} classical control, leaving it unclear whether a gain comes from the quantum substrate or from the architectural change that accompanies it.
The study reports on three separate executions of a four‑qubit ZZ feature map on the ibm_fez backend, each using 1024 shots per circuit. The authors compare the resulting hardware‑reconstructed Gram matrices to an exact statevector reference, finding off‑diagonal RMSE values of 0.0878, 0.0864, and 0.0427 for the baseline, dynamical decoupling, and gate‑twirling jobs respectively, and centered kernel alignment scores ranging from 0.933 to 0.989. The gate‑twirling job shows the smallest deviation across all metrics, while the baseline job’s contrasts remain stable under deletion‑stable diagnostics; the study notes that sampling alone cannot explain the observed errors and that implementation fidelity and task relevance are distinct diagnostic axes.
The paper introduces a new objective function for designing quantum error correction codes that maximizes the distinguishability of quantum states after a noise channel. This approach, called variational quantum error correction (VarQEC), uses a distinguishability loss function as a machine learning objective to discover encoding circuits tailored to specific noise characteristics. The authors demonstrate that VarQEC produces resource‑efficient codes that outperform standard codes and provide proof‑of‑concept experiments on IBM and IQM hardware.
arXiv:2607. 20377v1 Announce Type: cross Abstract: Quantum-kernel methods encode a dataset's geometry in a Gram matrix, so learning claims on hardware kernels assume the intended geometry survives execution.
arXiv:2607. 29491v1 Announce Type: cross Abstract: Reinforcement-learning-based quantum architecture search (RL-QAS) repeatedly optimizes a variational quantum eigensolver (VQE) after extending a circuit, although circuit construction and action legality are deterministic and known.