Concatenating surface codes with quantum Hamming codes achieves high error thresholds up to the surface code limit and suppresses logical errors more effectively than surface codes with comparable overhead for intermediate-scale quantum memories.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2verdicts
UNVERDICTED 2representative citing papers
A graph-based method is proposed to study entanglement entropy in CSS quantum codes, with illustrations on toric codes and quantum LDPC codes showing scaling behavior.
citing papers explorer
-
Quantum memory based on concatenating surface codes and quantum Hamming codes
Concatenating surface codes with quantum Hamming codes achieves high error thresholds up to the surface code limit and suppresses logical errors more effectively than surface codes with comparable overhead for intermediate-scale quantum memories.
-
A graph-based approach to entanglement entropy of quantum error correcting codes
A graph-based method is proposed to study entanglement entropy in CSS quantum codes, with illustrations on toric codes and quantum LDPC codes showing scaling behavior.