A note on threshold theorem of fault-tolerant quantum computation
Min Liang, Li Yang

TL;DR
This paper examines the optimal timing for error correction in fault-tolerant quantum computing, revealing that the best correction interval depends on the code's concatenation level, challenging the common practice of correcting after each gate.
Contribution
It demonstrates that the optimal error-correction period varies with the concatenation level, providing insights for improving quantum error correction strategies.
Findings
Optimal correction period depends on concatenation level k
Correcting after each gate may not be optimal
Error correction timing should consider code level
Abstract
Error-correction process has to be carried out periodically to prevent accumulation of errors in fault-tolerant quantum computation. It is believed that the best choice to get maximum threshold value is carrying out an error-correction process after each quantum gate operation. Result of this note shows that the optimal error-correction period depends on the value of k which is the level number of concatenated quantum error-correction code.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
