Zefan Du
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zefan Du has a total of 56 co-authors. Here are the top co-authors by number of shared publications:
- Ying Mao
Fordham University, New York, NY, USA
5 shared publications - Ang Li
Pacific Northwest National Laboratory
2 shared publications - Chenxu Liu
Pacific Northwest National Laboratory
2 shared publications - Samuel Stein
Pacific Northwest National Laboratory, Richland, USA
2 shared publications Shuwen Kan
2 shared publications- Shuwen Kan
Fordham University, New York, NY, USA
2 shared publications
Latest Publications
- Open Access
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 909-919
S2PAR: Scalable Surface Code Ancilla Routing Card for Distributed Fault-Tolerant Quantum Computing
- 27 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 909-919
Open AccessS2PAR: Scalable Surface Code Ancilla Routing Card for Distributed Fault-Tolerant Quantum Computing
- 23 September 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 188
Hardware-aware compilation for chip-to-chip coupler-connected modular quantum systems
- 23 September 2026
- Published by Elsevier in Future Generation Computer Systems
- Vol. 188
Hardware-aware compilation for chip-to-chip coupler-connected modular quantum systems
- Open Access
- 17 August 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (3) , 033194
Calibration-conditioned featurewise linear modulation decoders for low-latency decoding of quantum error correction evaluated on IBM repetition-code experiments
Real-time decoding of quantum error correction is essential for enabling fault-tolerant quantum computation. A practical decoder must operate with high accuracy at low latency, while remaining robust to spatial and temporal variations in hardware noise. We introduce a hardware-conditioned neural decoder framework designed to exploit the natural separation of timescales in superconducting processors, where calibration drifts occur over hours while error correction requires microsecond-scale responses. By processing calibration data through a graph-based encoder and conditioning a lightweight convolutional backbone via featurewise linear modulation (FiLM), we decouple the heavy processing of device statistics from the low-latency syndrome decoding. We evaluate this approach using the repetition code as a test bed on IBM , , and processors, collecting over 2.7 million experimental shots spanning distances up to d = 11 . Training one decoder per code distance, basis, and round count ( d , r ) , we demonstrate that each trained model generalizes to unseen qubit chains and new calibration data acquired days later without retraining. The FiLM-conditioned decoder achieves up to a 11.1 × reduction in logical error rate relative to modified minimum-weight perfect matching. Cross-conditioning ablations further show that the calibration input actively improves decoding, with performance degrading when the decoder is conditioned on incorrect backend data or the conditioning is disabled. We observe that by employing a network architecture that exploits the highly asynchronous nature of system calibration and decoding, hardware-conditioned neural decoding demonstrated promising, adaptive performance with negligible latency overhead relative to unconditioned baselines.
- 17 August 2026
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 8 (3) , 033194
Open AccessCalibration-conditioned featurewise linear modulation decoders for low-latency decoding of quantum error correction evaluated on IBM repetition-code experiments
Real-time decoding of quantum error correction is essential for enabling fault-tolerant quantum computation. A practical decoder must operate with high accuracy at low latency, while remaining robust to spatial and temporal variations in hardware noise. We introduce a hardware-conditioned neural decoder framework designed to exploit the natural separation of timescales in superconducting processors, where calibration drifts occur over hours while error correction requires microsecond-scale responses. By processing calibration data through a graph-based encoder and conditioning a lightweight convolutional backbone via featurewise linear modulation (FiLM), we decouple the heavy processing of device statistics from the low-latency syndrome decoding. We evaluate this approach using the repetition code as a test bed on IBM , , and processors, collecting over 2.7 million experimental shots spanning distances up to d = 11 . Training one decoder per code distance, basis, and round count ( d , r ) , we demonstrate that each trained model generalizes to unseen qubit chains and new calibration data acquired days later without retraining. The FiLM-conditioned decoder achieves up to a 11.1 × reduction in logical error rate relative to modified minimum-weight perfect matching. Cross-conditioning ablations further show that the calibration input actively improves decoding, with performance degrading when the decoder is conditioned on incorrect backend data or the conditioning is disabled. We observe that by employing a network architecture that exploits the highly asynchronous nature of system calibration and decoding, hardware-conditioned neural decoding demonstrated promising, adaptive performance with negligible latency overhead relative to unconditioned baselines.
- 13 September 2025
- Published by Elsevier
- p. 97-115
Distributed learning with quantum-classical collaborative management
- 13 September 2025
- Published by Elsevier
- p. 97-115
Distributed learning with quantum-classical collaborative management
- 13 September 2025
- Published by Elsevier
Contributors