17 citations · 25 across the 6 of their papers we have counts for
7 papers
Logical computation with canonical lifted product codes
Han Zheng, Guo Zheng, Liang Jiang +1
High-rate quantum low-density parity-check (qLDPC) codes encode many logical qubits with low physical-qubit overhead, but realizing efficient fault-tolerant computation on such den…
Error-structure-tailored early fault-tolerant quantum computing
Pei Zeng, Guo Zheng, Qian Xu +1
Fault tolerance is widely regarded as indispensable for achieving scalable and reliable quantum computing. However, the spacetime overhead required for fault-tolerant quantum compu…
High-Rate Surgery: towards constant-overhead logical operations
Guo Zheng, Liang Jiang, Qian Xu
Scalable quantum computation requires not only quantum codes with low memory overhead but also encoded operations with low space-time overhead. High rate quantum low-density parity…
Achievable rates for concatenated square Gottesman-Kitaev-Preskill codes
Mahadevan Subramanian, Guo Zheng, Liang Jiang
The Gottesman-Kitaev-Preskill (GKP) codes are known to achieve optimal rates under displacement noise and pure loss channels, which establishes theoretical foundations for its opti…
Optimality Condition for the Petz Map
Bikun Li, Zhaoyou Wang, Guo Zheng +2
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…
Fast and Parallelizable Logical Computation with Homological Product Codes
Qian Xu, Hengyun Zhou, Guo Zheng +4
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-parit…
The Near-optimal Performance of Quantum Error Correction Codes
Guo Zheng, Wenhao He, Gideon Lee +1
The Knill-Laflamme (KL) conditions distinguish exact quantum error correction codes, and it has played a critical role in the discovery of state-of-the-art codes. However, the fami…