activity
20242026
most citedTime-Efficient Logical Operations on Quantum Low-Density Parity Check Codes

7 citations · 9 across the 8 of their papers we have counts for

collaborators

8 papers

quant-ph2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

Yunxin Tang, Zixuan Huo, Junxiang Huang +14

Fault-tolerant quantum computing is progressing from demonstrations of individual logical components toward the execution of useful quantum algorithms on large-scale error-correcte…

quant-ph2026

Quantum-classical crossover in fault-tolerant quantum dynamics simulation

Jinzhao Sun, Bozhen Zhou, Jue Xu +28

While quantum computers promise to solve classically intractable problems, identifying the point at which fault-tolerant quantum computation outperforms the best classical algorith…

quant-ph2026

A Three-Layer Architecture for Fault-Tolerant Quantum Computing

Zhirao Wang, Zhou You, Yiming Huang +4

Fault tolerance is an indispensable prerequisite for constructing large-scale universal quantum computers. Drawing philosophies from classical computer architecture, this paper pre…

quant-ph2025

Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes

Guo Zhang, Yuanye Zhu, Ying Li

We propose a fault-tolerant quantum computation scheme that is broadly applicable to quantum low-density parity-check (qLDPC) codes. The scheme achieves constant qubit overhead and…

quant-ph2025

Planar fault-tolerant logical measurements with low qubit overhead

Yingli Yang, Guo Zhang, Ying Li

Fault-tolerant quantum computation critically depends on architectures uniting high encoding rates with physical implementability. Quantum low-density parity-check (qLDPC) codes, i…

quant-ph2025

Constant-Overhead Magic State Injection into qLDPC Codes with Error Independence Guarantees

Guo Zhang, Yuanye Zhu, Xiao Yuan +1

Magic states are essential yet resource-intensive components for realizing universal fault-tolerant quantum computation. Preparing magic states within emerging quantum low-density…

quant-ph2024★ 7 cited

Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes

Guo Zhang, Ying Li

We propose schemes capable of measuring an arbitrary set of commutative logical Pauli operators in time independent of the number of operators. The only condition is commutativity,…

quant-ph2024★ 2 cited

Low-density parity-check representation of fault-tolerant quantum circuits

Ying Li

In fault-tolerant quantum computing, quantum algorithms are implemented through quantum circuits capable of error correction. These circuits are typically constructed based on spec…