5 citations · 9 across the 7 of their papers we have counts for
14 papers · 1 filter
High-rate qLDPC processors
Aditya Bhardwaj, Muzhou Ma, Nadine Meister +6
Despite significant progress on quantum low-density parity-check (qLDPC) codes, building qLDPC processors that are high-rate, high-throughput, hardware-friendly, and fast-to-decode…
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…
Shor's algorithm is possible with as few as 10,000 reconfigurable atomic qubits
Madelyn Cain, Qian Xu, Robbie King +6
Quantum computers have the potential to perform computational tasks beyond the reach of classical machines. A prominent example is Shor's algorithm for integer factorization and di…
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…
Constant-Overhead Fault-Tolerant Bell-Pair Distillation using High-Rate Codes
J. Pablo Bonilla Ataides, Hengyun Zhou, Qian Xu +4
We present a fault-tolerant Bell-pair distillation scheme achieving constant overhead through high-rate quantum low-density parity-check (qLDPC) codes. Our approach maintains a con…