Skip to main content

Fault-tolerant quantum computation with polylogarithmic time and constant space overheads

Submitted by wwwadm on

Nature Physics, Published online: 26 November 2025; doi:10.1038/s41567-025-03102-5

Quantum low-density parity-check codes are anticipated to be an efficient approach to quantum error correction. Now it has been proven that these codes can be time-efficient with only a constant overhead in the required number of qubits.