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.
By Ran Miao, Rui Luo, Xiaohan Shan, Xiaoming Sun
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.
By Nico Meyer, Christopher Mutschler, Dominik Seu{\ss}, Andreas Maier, Daniel D. Scherer
arXiv:2601. 00242v2 Announce Type: replace-cross Abstract: Realizing the full potential of quantum computation requires Quantum Error Correction (QEC).
By Yotam Peled, David Zenati, Eliya Nachmani
arXiv:2511. 12482v2 Announce Type: replace-cross Abstract: Quantum error correction is essential for fault-tolerant quantum computing.
By Yue Yin, Tailong Xiao, Xiaoyang Deng, Ming He, Jianping Fan, Guihua Zeng
arXiv:2606. 26312v1 Announce Type: cross Abstract: Autoencoders transformed classical machine learning by solving the curse of dimensionality, enabling principled weight initialization and learning compact, structured representations.
By Aldo Lamarre, Dominik \v{S}afr\'anek
The paper introduces QuBA, a Quantum Bayesian graph Attention decoder that provides expressive error-pattern recognition and calibrated uncertainty estimates for quantum error correction. It also presents SAGU, a multi-phase training framework that enhances cross-domain robustness, allowing decoding beyond the training set. Experiments on bivariate bicycle codes show that both QuBA and SAGU outperform classical belief propagation, achieving up to two orders of magnitude lower logical error rates and comparable or better performance than domain-specific training approaches.
By Xiangjun Mi, Frank Mueller
arXiv:2607. 00365v1 Announce Type: cross Abstract: Artificial intelligence (AI) and quantum information (QI) are rapidly co-evolving.
By Min Chen, Yu Gan, Xin Jin, Yuqing Li, Junqi Wang, Zeguan Wu, Yunfei Wang, Bingzhi Zhang, Priyam Srivastava, Tianlong Chen, Ankit Kulshrestha, Yuan Liu, Juan Jos\'e Mendoza-Arenas, Kaushik P. Seshadreesan, Sarvagya Upadhyay, Xueyue Zhang, Quntao Zhuang, Junyu Liu
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.
By Nico Meyer, Christopher Mutschler, Andreas Maier, Daniel D. Scherer
arXiv:2606. 27119v1 Announce Type: cross Abstract: Foundation decoders, a class of high-capacity neural decoders, are leading candidates for fault-tolerant quantum computing, with accurate and efficient decoding at large code distances.
By Ge Yan, Shanchuan Li, Shiyi Xiao, Pengyue Ma, Hanyan Cao, Feng Pan, Yuxuan Du
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.
By Sumit Chongder
arXiv:2604. 06135v2 Announce Type: replace-cross Abstract: Efficient data loading remains a bottleneck for near-term quantum machine learning.
By Basil Kyriacou, Viktoria Patapovich, Maniraman Periyasamy, Alexey Melnikov
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.
By Tobias Haug, Askery Canabarro, Leandro Aolita