Guo Zheng

Guo Zheng

Auto-generated profile, based on publicly available information

Guo Zheng

The University of Chicago

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
3 August 2023 in npj Quantum Information
Verified
Journal Article
Open access
PDF file
QXQian Xu
Qian Xu
GZGuo Zheng
Guo Zheng
YWYu-Xin Wang
Yu-Xin Wang
PZPeter Zoller
Peter Zoller
ACAashish A. Clerk
Aashish A. Clerk
LJLiang Jiang
Liang Jiang
We propose an autonomous quantum error correction scheme using squeezed cat (SC) code against excitation loss in continuous-variable systems. Through reservoir engineering, we show that a structured dissipation can stabilize a two-component SC while autonomously correcting the errors. The implementation of such dissipation only requires low-order nonlinear couplings among three bosonic modes or between a bosonic mode and a qutrit. While our proposed scheme is device independent, it is readily implementable with current experimental platforms such as superconducting circuits and trapped-ion systems. Compared to the stabilized cat, the stabilized SC has a much lower dominant error rate and a significantly enhanced noise bias. Furthermore, the bias-preserving operations for the SC have much lower error rates. In combination, the stabilized SC leads to substantially better logical performance when concatenating with an outer discrete-variable code. The surface-SC scheme achieves more than one order of magnitude increase in the threshold ratio between the loss rate κ1 and the engineered dissipation rate κ2. Under a practical noise ratio κ1/κ2 = 10−3, the repetition-SC scheme can reach a 10−15 logical error rate even with a small mean excitation number of 4, which already suffices for practically useful quantum algorithms.

22 May 2025 in Physical Review X
Verified
Journal Article
Open access
QXQian Xu
Qian Xu
HZHengyun Zhou
Hengyun Zhou
GZGuo Zheng
Guo Zheng
DBDolev Bluvstein
Dolev Bluvstein
JAJ. Pablo Bonilla Ataides
J. Pablo Bonilla Ataides
LJLiang Jiang
Liang Jiang
Quantum error correction is necessary to perform large-scale quantum computation but requires extremely large overheads in both space and time. High-rate quantum low-density-parity-check (qLDPC) codes promise a route to reduce qubit numbers, but performing computation while maintaining low space cost has required serialization of operations and extra time costs. In this work, we design fast and parallelizable logical gates for qLDPC codes and demonstrate their utility for key algorithmic subroutines such as the quantum adder. Our gate gadgets utilize transversal logical s between a data qLDPC code and a suitably constructed ancilla code to perform parallel Pauli product measurements (PPMs) on the data logical qubits. For hypergraph product codes, we show that the ancilla can be constructed by simply modifying the base classical codes of the data code, achieving parallel PPMs on a subgrid of the logical qubits with a lower space-time cost than existing schemes for an important class of circuits. Generalizations to 3D and 4D homological product codes further feature fast PPMs in constant depth. While prior work on qLDPC codes has focused on individual logical gates, we initiate the study of fault-tolerant compilation with our expanded set of native qLDPC code operations, constructing algorithmic primitives for preparing k -qubit Greenberger-Horne-Zeilinger states and distilling or teleporting k magic states with O ( 1 ) space overhead in O ( 1 ) and O ( k log k ) logical cycles, respectively. We further generalize this to key algorithmic subroutines, demonstrating the efficient implementation of quantum adders using parallel operations. Our constructions are naturally compatible with reconfigurable architectures such as neutral atom arrays, paving the way to large-scale quantum computation with low space and time overheads.

17 June 2024 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
GZGuo Zheng
Guo Zheng
WHWenhao He
Wenhao He
GLGideon Lee
Gideon Lee
LJLiang Jiang
Liang Jiang
The Knill-Laflamme conditions distinguish exact quantum error correction codes, and they have played a critical role in the discovery of state-of-the-art codes. However, the family of exact codes is a very restrictive one and does not necessarily contain the best-performing codes. Therefore, it is desirable to develop a generalized and quantitative performance metric. In this Letter, we derive the near-optimal channel fidelity, a concise and optimization-free metric for arbitrary codes and noise. The metric provides a narrow two-sided bound to the optimal code performance, and it can be evaluated with exactly the same input required by the Knill-Laflamme conditions. We demonstrate the numerical advantage of the near-optimal channel fidelity through multiple qubit code and oscillator code examples. Compared to conventional optimization-based approaches, the reduced computational cost enables us to simulate systems with previously inaccessible sizes, such as oscillators encoding hundreds of average excitations. Moreover, we analytically derive the near-optimal performance for the thermodynamic code and the Gottesman-Kitaev-Preskill code. In particular, the Gottesman-Kitaev-Preskill code’s performance under excitation loss improves monotonically with its energy and converges to an asymptotic limit at infinite energy, which is distinct from other oscillator codes.

19 May 2025 in Physical Review Letters
Verified
Journal Article
Closed access
PDF file
BLBikun Li
Bikun Li
ZWZhaoyou Wang
Zhaoyou Wang
GZGuo Zheng
Guo Zheng
YWYat Wong
Yat Wong
LJLiang Jiang
Liang Jiang
In quantum error correction, the Petz map serves as a perfect recovery map when the Knill-Laflamme conditions are satisfied. Notably, while perfect recovery is generally infeasible for most quantum channels of finite dimension, the Petz map remains a versatile tool with near-optimal performance in recovering quantum states. This work introduces and proves, for the first time, the necessary and sufficient conditions for the optimality of the Petz map in terms of entanglement fidelity. In some special cases, the violation of this condition can be easily characterized by a simple commutator that can be efficiently computed. We provide multiple examples that substantiate our new findings.

28 July 2025 in PRX Quantum
Verified
Journal Article
Open access
GZGuo Zheng
Guo Zheng
WHWenhao He
Wenhao He
GLGideon Lee
Gideon Lee
KNKyungjoo Noh
Kyungjoo Noh
LJLiang Jiang
Liang Jiang
Quantum error-correction codes protect information from realistic noisy channels and lie at the heart of quantum computation and communication tasks. Understanding the optimal performance and other information-theoretic properties, such as the achievable rates, of a given code is crucial, as these factors determine the fundamental limits imposed by the encoding in conjunction with the noise channel. Here, we use the transpose channel to analytically obtain the near-optimal performance of any Gottesman-Kitaev-Preskill (GKP) code under pure loss and pure amplification. We present rigorous connections between GKP code’s near-optimal performance and its dual lattice geometry and average input energy. With no energy constraint, we show that when | τ / ( 1 − τ ) | is an integer, specific families of GKP codes simultaneously achieve the loss and amplification capacity. τ is the transmissivity (gain) for loss (amplification). Our results establish GKP code as the first structured bosonic code family that achieves the capacity of loss and amplification.

27 February 2025 in Physical Review Applied
Verified
Journal Article
Closed access
GZGuo Zheng
Guo Zheng
SLSimon Lieu
Simon Lieu
EREmma L. Rosenfeld
Emma L. Rosenfeld
KNKyungjoo Noh
Kyungjoo Noh
CHConnor T. Hann
Connor T. Hann