PRX Quantum · 2024 · 14 citations · 42 references
EngineeringComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsChannel CodingCoding TheoryError Control CodingError RecoveryError-correcting CodesFault-tolerant CommunicationBit Error RateError Correction CodesError Rate AnalysisError Rate MetricsLogical Error RatesSoft InformationSurface CodesTopological Codes
We introduce a framework for fault-tolerant postselection (FTPS) of fault-tolerant codes and channels—such as those based on surface codes—using soft-information metrics based on visible syndrome and erasure information. We introduce several metrics for ranking configurations of syndromes and erasures. In particular, we introduce the (and variants thereof) as a powerful soft-information metric for predicting logical error rates of fault-tolerant channels based on topological error-correcting codes. The logical gap is roughly the unsigned weight difference between inequivalent logical corrections and is adaptable to any tailored noise model or decoder. We deploy this framework to prepare high-quality surface-code magic states with low overhead under a model of independent and identically distributed (IID) Pauli and erasure errors. Postselection strategies based on the logical gap can suppress the encoding error rate (EER) of a magic state preparation channel to the level of the physical error rate with low overhead. For example, when operating at <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><a:mn>60</a:mn><a:mi mathvariant="normal">%</a:mi></a:math> of the bulk threshold of the corresponding surface code, an overall reduction of the EER by a factor of <e:math xmlns:e="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><e:mn>15</e:mn></e:math> is achievable with a relative overhead factor of <h:math xmlns:h="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><h:mo><</h:mo><h:mn>2</h:mn></h:math> (approximately <k:math xmlns:k="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><k:mn>23</k:mn></k:math> times less than that of simple syndrome-counting rules). We analyze a schematic buffer architecture for implementing postselection rules on magic state factories in the context of magic state distillation. The FTPS framework can be utilized for mitigating errors in more general fault-tolerant logical channels. Published by the American Physical Society 2024
42
Fault-tolerant quantum computation by anyons
Alexei Kitaev · Annals of Physics · 2003 · 7.3K citations · Full text
Computing, Computer Science, Physics +12
Anyons in an exactly solved model and beyond
Alexei Kitaev · Annals of Physics · 2006 · 5.3K citations · Full text
Journal of Mathematical Physics · 2002 · 1.7K citations · Full text
Computing, Computer Science, Physics +17
CERN Document Server (European Organization for Nuclear Research) · 2001 · 1.6K citations
Computing, Computer Science, Physics +17
Universal quantum computation with ideal Clifford gates and noisy ancillas
Sergey Bravyi, Alexei Kitaev · Physical Review A · 2005 · 1.5K citations · Full text
Computing, Computer Science, Physics +14