Zi-Han Chen

Zi-Han Chen

Auto-generated profile, based on publicly available information

Zi-Han Chen

University of Science and Technology of China

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

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

Representative Publications

View All Publications
22 January 2026 in PRX Quantum
Verified
Journal Article
Open access
ZCZi-Han Chen
Zi-Han Chen
MCMing-Cheng Chen
Ming-Cheng Chen
CLChaoyang Lu
Chaoyang Lu
JPJian-Wei Pan
Jian-Wei Pan
Preparation of high-fidelity logical magic states is crucial for fault-tolerant quantum computation. Among previous attempts to reduce the substantial cost of magic state preparation, magic state cultivation (MSC) [Gidney , Magic state cultivation: growing T states as cheap as CNOT gates, arXiv:2409.17595], a recently proposed protocol for logical T state preparation without magic state distillation, achieves state-of-the-art efficiency. Inspired by this work [Gidney , Magic state cultivation: growing T states as cheap as CNOT gates, arXiv:2409.17595], we propose a MSC procedure that can produce logical T states on the rotated surface code at a further reduced cost. To maintain high efficiency throughout our protocol, we design structured codes along with compact circuits bridging between them. More specifically, we construct a code family, the RP code, by putting the rotated surface code on R P 2 (a two-dimensional manifold), as well as two self-dual Calderbank-Shor-Steane codes, named SRP-3 and SRP-5, respectively. In our MSC protocol, we start with a cultivation process, in which a high-fidelity T state is prepared on a small RP code with distance 3 or 5. Then, to preserve the logical T state, we use an efficient and easy-to-decode expansion stage to grow a small RP code to a larger rotated surface code in one syndrome extraction (SE) round. The RP code serves as an efficient transfer station with efficient SE circuits and compact interfaces between the SRP-3 (or SRP-5) code—used in the cultivation process to efficiently verify the correctness of the logical T state—and larger rotated surface codes for preserving the prepared logical T state. Our MSC protocol utilizes nonlocal connectivity, available on both neutral atom array and ion trap platforms. According to our Monte Carlo sampling results, our MSC protocol requires about an order of magnitude smaller space-time volume to reach a target logical error rate of around 10 − 9 compared to the original MSC protocol.

31 March 2026 in Physical Review Letters
Verified
Journal Article
Closed access
ZCZi-Han Chen
Zi-Han Chen
MCMing-Cheng Chen
Ming-Cheng Chen
CLChaoyang Lu
Chaoyang Lu
JPJian-Wei Pan
Jian-Wei Pan
We propose hardware-efficient schemes for implementing logical h and s gates transversally on the rotated surface code with reconfigurable neutral atom arrays. Our protocol for logical s gates utilizes the time dynamics of the data and ancilla qubits during syndrome extraction (SE). In particular, we move beyond traditional schemes where transversal logical gates take place between two SE rounds and instead embed our fold-transversal logical operation within a single SE round, leveraging the fact that data and ancilla qubits can be morphed into an unrotated surface code state halfway through an SE round. Under circuit noise, we observe that the performance of our s gate protocol is comparable to that of the quantum memory. For logical h gates, we first develop a simple strategy to rotate code patches efficiently with two sets of 2D acousto-optic deflectors (2D-AOD). We also propose a new transversal h gate protocol, based on the same principle as our s gate protocol, to remove the need for an additional set of 2D-AOD. Together with transversal logical cnot gates, our protocols complete a transversal logical Clifford gate set on the rotated surface code and allow for efficient implementation on neutral atom array platforms.

24 April 2026 in Physical Review Letters
Verified
Journal Article
Closed access
CYCheng-Cheng Yu
Cheng-Cheng Yu
ZCZi-Han Chen
Zi-Han Chen
YDYu-Hao Deng
Yu-Hao Deng
CLChaoyang Lu
Chaoyang Lu
MCMing-Cheng Chen
Ming-Cheng Chen
JPJian-Wei Pan
Jian-Wei Pan
Programmable neutral atom arrays show great promise for fault-tolerant quantum computing. A dominant physical error on this platform is qubit leakage and loss, notably decay errors from the Rydberg state during two-qubit gates. Such leakage events are particularly detrimental as they propagate, generating correlated errors that severely degrade the effective error distance of quantum error correction codes. Here, we present a novel approach to address Rydberg decay errors leveraging measurement-based quantum computation. Our scheme strategically exploits the inherent geometric structure of topological cluster states and only uses final leakage detection information to locate propagated errors originating from Rydberg decay. This eliminates the need for complex and atom-species-specific midcircuit leakage detection, offering broader applicability, e.g., to the well-established Rb atom platform. We demonstrate a high error threshold of 3.65% per cz gate for pure Rydberg decay and achieve a favorable error distance d_{e}≈d. Our method compares favorably with state-of-the-art erasure conversion protocols in the subthreshold performance, offering comparable or marginally larger logical error rates while significantly reducing experimental overhead.

26 May 2026 in Physical Review Research
Verified
Journal Article
Open access
ZSZhong-Xia Shang
Zhong-Xia Shang
ZCZi-Han Chen
Zi-Han Chen
CCCai-Sheng Cheng
Cai-Sheng Cheng
Fighting against noise is crucial for Noisy Intermediate Scale Quantum (NISQ) devices to demonstrate practical quantum applications. In this work, we give a paradigm of quantum error mitigation based on the vectorization of density matrices for variational quantum algorithms. Different from the ideas of existing quantum error mitigation methods that try to distill noiseless information from noisy quantum states, our proposal directly changes the way of encoding information and maps the density matrices of noisy quantum states to noiseless virtual pure states, which is realized by an NISQ-friendly measurement protocol and a classical postprocessing procedure. Our protocol requires no knowledge of the noise model, no ability to tune the noise strength, and no ancilla qubits for complicated controlled unitaries. Under our encoding, NISQ devices are always preparing virtual pure quantum states that are highly desired resources for variational quantum algorithms to have good performance in many tasks. We show how this protocol can be well fitted into variational quantum algorithms. We give several concrete ansatz constructions that are suitable for our proposal and do theoretical analysis on the sampling complexity, the expressibility, and the trainability. We also give a discussion on how this protocol is influenced by large noise and how it can be well combined with other quantum error mitigation protocols. The effectiveness of our proposal is demonstrated by various numerical experiments.