Shuwen Kan

Shuwen Kan

Auto-generated profile, based on publicly available information

Shuwen Kan

Fordham University, New York, NY, USA

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 May 2025 in IEEE Systems Journal
Verified
Journal Article
Closed access
SDShuhong Dai
Shuhong Dai
NSNishant Saurabh
Nishant Saurabh
QWQingle Wang
Qingle Wang
JNjiawei Nian
jiawei Nian
SKShuwen Kan
Shuwen Kan
Long ChengLong Cheng
Long Cheng
Effective cloud job scheduling is essential for enhancing the performance and operational efficiency of cloud-based services, directly impacting their quality of service (QoS). Among existing methodologies, deep reinforcement learning (DRL) has proven effective in addressing complex, multidimensional optimization challenges in real-time scheduling. With advancements in quantum computing, quantum neural networks (QNNs) are showing unique advantages in information representation and processing. This study is the first to explore quantum reinforcement learning (QRL) for real-time job scheduling in cloud systems. Specifically, we propose a QRL framework that utilizes variational and encoding layers to convert state information into quantum data, repeatedly embedded into a QNN to compute optimal value returns. This approach aims to enhance QoS by improving job execution success rates and reducing average response times with unpredictable job arrivals. We present the detailed design of our approach, and our simulation results demonstrate that the QRL method significantly exceeds established baselines, including those based on DRL, across a range of workload intensities and computational resource configurations. This is particularly evident under high-load conditions, where our approach can achieve 55.2% higher success rates, underscoring its significant potential in cloud job scheduling optimization.

6 March 2026 in Physical Review Research
Verified
Journal Article
Open access
SSSamuel Stein
Samuel Stein
CLChenxu Liu
Chenxu Liu
SKShuwen Kan
Shuwen Kan
ECEleanor Crane
Eleanor Crane
YDYufei Ding
Yufei Ding
ALAng Li
Ang Li
Multitarget gates offer the potential to reduce gate depth in syndrome extraction for quantum error correction. Although neutral-atom quantum computers have demonstrated native multiqubit gates, existing approaches that avoid additional control or multiple atomic species have been limited to single-target gates. We propose single-control multitarget C ( Z ⊗ N ) gates on a single-species neutral-atom platform that requires no extra control and has gate durations comparable to standard C Z gates. Our approach leverages tailored interatomic distances to create an asymmetric blockade between the control and target atoms. Using a graphics processing unit-accelerated pulse synthesis protocol, we design smooth control pulses for C Z Z and C Z Z Z gates, achieving fidelities of up to 99.55 % and 99.24 % , respectively, even in the presence of simulated atom-placement errors and Rydberg-state decay. Our approach is most effective for N = 2 ( C Z Z ) and N = 3 targets ( C Z Z Z ) ; for larger , increasing spatial crowding of the targets introduces significant challenges for maintaining the required blockade asymmetry. This work presents a practical path to implementing low-overhead multitarget gates in single-species neutral-atom systems, significantly reducing the resource overhead for syndrome extraction. To motivate the impact of these gates, we apply a greedy scheduling algorithm and we demonstrate that our proposed gates can reduce the number of atom reconfiguration costs by up to 50% for color code syndrome extraction of code distances greater than 5.

14 November 2025 in IEEE Transactions on Quantum Engineering
Verified
Journal Article
Open access
MPMiguel Palma
Miguel Palma
SKShuwen Kan
Shuwen Kan
WWWenqi Wei
Wenqi Wei
JCJuntao Chen
Juntao Chen
KHKaixun Hua
Kaixun Hua
Ying MaoYing Mao
Ying Mao
The rapid expansion of quantum cloud services has led to long job queues due to single-tenant execution models that underutilize hardware resources. Quantum multiprogramming (QMP) mitigates this by executing multiple circuits in parallel on a single device, but existing methods target superconducting systems with limited connectivity, high crosstalk, and lower gate fidelity. Trapped-ion architecture, with all-to-all connectivity, long coherence times, and high-fidelity mid-circuit measurement properties, presents itself as a more suitable platform for scalable QMP. We present CircPack, a hardware-aware circuit packing framework designed for modular trapped-ion devices based on the quantum charge-coupled device (QCCD) architecture. CircPack formulates static circuit scheduling as a 2-D packing problem with hardware-specific shuttling constraints. Compared to superconducting-based QMP approaches, CircPack achieves up to 70.72% better fidelity, 62.67% higher utilization, and 32.80% improved layer reduction. This framework is also capable of scalable balanced scheduling across a cluster of independent QCCD modules, highlighting trapped-ion systems’ potential in improving the throughput of quantum cloud computing in the near future.

17 August 2026 in Physical Review Research
Verified
Journal Article
Open access
PDF file
SSSamuel Stein
Samuel Stein
SKShuwen Kan
Shuwen Kan
CLChenxu Liu
Chenxu Liu
AHAdrian Harkness
Adrian Harkness
SGSean Garner
Sean Garner
ALAng Li
Ang Li
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.

6 January 2026 in arXiv
Verified
Preprint
Open access
PDF file
AHAdrian Harkness
Adrian Harkness
SKShuwen Kan
Shuwen Kan
CLChenxu Liu
Chenxu Liu
MWMeng Wang
Meng Wang
JMJohn M. Martyn
John M. Martyn
SSSamuel Stein
Samuel Stein
Realizing large-scale quantum advantage is expected to require quantum error correction (QEC), making the compilation and optimization of logical operations a critical area of research. Logical computation imposes distinct constraints and operational paradigms that differ from those of the Noisy Intermediate-Scale Quantum (NISQ) regime, motivating the continued evolution of compilation tools. Given the complexity of this emerging stack, where factors such as gate decomposition precision and computational models must be co-designed, standardized benchmarks and toolkits are valuable for evaluating progress. To support this need, we introduce FTCircuitBench, which serves as: (1) a benchmark suite of impactful quantum algorithms, featuring pre-compiled instances in both Clifford+T and Pauli Based Computation models; (2) a modular end-to-end pipeline allowing users to compile and decompose algorithms for various fault-tolerant architectures, supporting both prebuilt and custom optimization passes; and (3) a toolkit for evaluating the impact of algorithms and optimization across the full compilation stack, providing detailed numerical analysis at each stage. FTCircuitBench is fully open-sourced and maintained on Github.