Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
- URL: http://arxiv.org/abs/2212.00813v1
- Date: Thu, 1 Dec 2022 19:00:02 GMT
- Title: Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
- Authors: H\'ector Bomb\'in, Mihir Pant, Sam Roberts, Karthik I. Seetharam
- Abstract summary: Post-selection strategies based on the logical gap can suppress the encoding error rate of a magic state preparation channel to the level of the physical error rate with low overhead.
The FTPS framework can be utilized for mitigating errors in more general fault-tolerant logical channels.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce a framework for fault-tolerant post-selection (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 \emph{logical gap} (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 (\emph{i.i.d.}) Pauli and erasure errors. Post-selection strategies
based on the logical gap can suppress the encoding error rate of a magic state
preparation channel to the level of the physical error rate with low overhead.
For example, when operating at $60\%$ the bulk threshold of the corresponding
surface code, an overall reduction of the encoding error rate by a factor of
$15$ is achievable with a relative overhead factor of ${< 2}$ (approximately
$23$ times less than that of simple syndrome-counting rules). We analyze a
schematic buffer architecture for implementing post-selection 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.
Related papers
- Mitigating errors in logical qubits [1.6385815610837167]
We develop new methods to quantify logical failure rates with exclusive decoders.
We identify a regime at low error rates where the exclusion rate decays with code distance.
Our work highlights the importance of post-selection as a powerful tool in quantum error correction.
arXiv Detail & Related papers (2024-05-06T18:04:41Z) - FFN-SkipLLM: A Hidden Gem for Autoregressive Decoding with Adaptive Feed Forward Skipping [49.66872823080736]
Autoregressive Large Language Models (e.g., LLaMa, GPTs) are omnipresent achieving remarkable success in language understanding and generation.
To mitigate overload incurred during generation, several early-exit and layer-dropping strategies have been proposed.
We propose FFN-SkipLLM, which is an input-adaptive feed-forward skipping strategy.
arXiv Detail & Related papers (2024-04-05T02:35:43Z) - Reducing the error rate of a superconducting logical qubit using analog
readout information [2.5466328776335936]
Traditional error decoding approaches ignore valuable information embedded in the analog (soft') readout signal.
We present experimental results showcasing the advantages of incorporating soft information into the decoding process.
Our results show a reduction of up to $6.8%$ in the extracted logical error rate with the use of soft information.
arXiv Detail & Related papers (2024-03-01T17:48:23Z) - Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations.
We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes.
Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
arXiv Detail & Related papers (2023-12-21T17:40:18Z) - Global Context Aggregation Network for Lightweight Saliency Detection of
Surface Defects [70.48554424894728]
We develop a Global Context Aggregation Network (GCANet) for lightweight saliency detection of surface defects on the encoder-decoder structure.
First, we introduce a novel transformer encoder on the top layer of the lightweight backbone, which captures global context information through a novel Depth-wise Self-Attention (DSA) module.
The experimental results on three public defect datasets demonstrate that the proposed network achieves a better trade-off between accuracy and running efficiency compared with other 17 state-of-the-art methods.
arXiv Detail & Related papers (2023-09-22T06:19:11Z) - Bounds on Autonomous Quantum Error Correction [3.9119979887528125]
We analyze Markovian autonomous decoders that can be implemented with a wide range of qubit and bosonic error-correcting codes.
For many-body quantum codes, we show that, to achieve error suppression comparable to active error correction, autonomous decoders generally require correction rates that grow with code size.
arXiv Detail & Related papers (2023-08-30T18:00:07Z) - Concatenation Schemes for Topological Fault-tolerant Quantum Error
Correction [1.6114012813668934]
We propose fault-tolerant quantum error correction schemes based on the concatenation of small error detection codes with the three-dimensional cluster state.
We find a set of codes for which such a conversion is possible, and study their performance against the standard circuit-level depolarizing model.
Our best performing scheme, which is based on a concatenation with a classical code, improves the threshold by $16.5%$ and decreases the spacetime overhead by $32%$.
arXiv Detail & Related papers (2022-09-20T00:08:28Z) - Improved decoding of circuit noise and fragile boundaries of tailored
surface codes [61.411482146110984]
We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes.
Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC.
We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
arXiv Detail & Related papers (2022-03-09T18:48:54Z) - Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions.
We explore novel schemes for universal logic that improve resource overheads.
Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
arXiv Detail & Related papers (2021-12-22T19:00:03Z) - Error-rate-agnostic decoding of topological stabilizer codes [0.0]
We develop a decoder that depends on the bias, i.e., the relative probability of phase-flip to bit-flip errors, but is agnostic to error rate.
Our decoder is based on counting the number and effective weight of the most likely error chains in each equivalence class of a given syndrome.
arXiv Detail & Related papers (2021-12-03T15:45:12Z) - Communication-Efficient Robust Federated Learning Over Heterogeneous
Datasets [147.11434031193164]
This work investigates fault-resilient federated learning when the data samples are non-uniformly distributed across workers.
In the presence of adversarially faulty workers who may strategically corrupt datasets, the local messages exchanged can be unreliable.
The present work introduces a fault-resilient gradient (FRPG) algorithm that relies on Nesterov's acceleration technique.
For strongly convex loss functions, FRPG and LFRPG have provably faster convergence rates than a benchmark robust aggregation algorithm.
arXiv Detail & Related papers (2020-06-17T16:50:33Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.